1
talks
0
committee roles
0
leadership roles
2021–2021
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization | QIP 2021 | regular | Yuval Sanders, Dominic Berry, Pedro Costa, Nathan Wiebe, Craig Gidney, Hartmut Neven, Ryan Babbush |
Abstract We compile explicit circuits and evaluate the computational cost for heuristic-based quantum algorithms for combinatorial optimization. We consider several variants of quantum-accelerated simulated annealing as well as adiabatic algorithms, quantum-enhanced population transfer, the quantum approximate optimization algorithm, and other approaches. We provide novel methods for executing the bottleneck subroutines for these heuristics, and our methods can easily be applied to other algorithms where numerical performance matters. We estimate how quickly the subroutines could be executed on a modestly sized superconducting-qubit-based quantum computer with surface code error correction. We conclude that quadratic speedups for heuristic-based quantum optimization algorithms are insufficient for early quantum computers to beat present day classical computers. |
|||
Collaborators
| Co-author | Joint talks |
|---|---|
| Craig Gidney | 1 |
| Dominic Berry | 1 |
| Hartmut Neven | 1 |
| Nathan Wiebe | 1 |
| Pedro Costa | 1 |
| Ryan Babbush | 1 |
| Yuval Sanders | 1 |