19
collaborators
2020–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Evidence that the Quantum Approximate Optimization Algorithm Optimizes the Sherrington-Kirkpatrick Model Efficiently in the Average Case | QIP 2026 | regular ▸ presenter | Abid A. Khan, Minzhao Liu, Jeffrey Larson, Dylan Herman, Ruslan Shaydulin, Marco Pistoia |
The Sherrington-Kirkpatrick (SK) model serves as a foundational framework for understanding disordered systems. The Quantum Approximate Optimization Algorithm (QAOA) is a quantum optimization algorithm whose performance monotonically improves with its depth $p$. In this work, we introduce a new equivalence between the task of evaluating the energy of QAOA applied to the SK model in the infinite-size limit and the task of simulating a spin-boson system, which we show can be done with modest cost using matrix product states. Using this equivalence, we optimize QAOA parameters and provide numerical evidence that QAOA obtains a $(1-\epsilon)$ approximation to the optimal energy with circuit depth $\mathcal{O}(n/\epsilon^{\infiniteSizeLimitOneOverEta})$ in the average case, with $\varepsilon\lesssim\infiniteSizeLastpError\%$ at $p=\infiniteSizeLastp$. We then use these optimized QAOA parameters to evaluate the QAOA energy for finite-sized instances with up to $30$ qubits and find convergence to the ground state consistent with the infinite-size limit prediction. Our results provide strong numerical evidence that QAOA can efficiently approximate the ground state of the SK model in the average case. |
|||
| Solving boolean satisfiability problems with the quantum approximate optimization algorithm | QIP 2023 | regular ▸ presenter | Ashley Montanaro |
5 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm | QIP 2026 | Sivaprasad Omanakuttan, Zichang He, Zhiwei Zhang, Tianyi Hao, Arman Babakhani, Shouvanik Chakrabarti, Dylan Herman, Joseph Sullivan, ▸Michael A. Perlin, Ruslan Shaydulin, Marco Pistoia |
| Equivalence of Quantum Approximate Optimization Algorithm and Linear-Time Quantum Annealing for the Sherrington-Kirkpatrick Model | TQC 2025 | — |
| Applying the Quantum Approximate Optimization Algorithm to flow problems | QIP 2024 | Alexander Frei, Catherine White |
| Improving the Quantum Approximation Optimization Algorithm with postselection | QIP 2021 | — |
| Approximate quantum non-demolition measurements | TQC 2020 | Mischa Woods, Joseph M. Renes |
Collaborators
| Co-author | Joint talks |
|---|---|
| Dylan Herman | 2 |
| Marco Pistoia | 2 |
| Ruslan Shaydulin | 2 |
| Abid A. Khan | 1 |
| Alexander Frei | 1 |
| Arman Babakhani | 1 |
| Ashley Montanaro | 1 |
| Catherine White | 1 |
| Jeffrey Larson | 1 |
| Joseph M. Renes | 1 |
| Joseph Sullivan | 1 |
| Michael A. Perlin | 1 |
| Minzhao Liu | 1 |
| Mischa Woods | 1 |
| Shouvanik Chakrabarti | 1 |
| Sivaprasad Omanakuttan | 1 |
| Tianyi Hao | 1 |
| Zhiwei Zhang | 1 |
| Zichang He | 1 |