7.2k citations · 8.3k across the 21 of their papers we have counts for
21 papers
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
Sergey Knysh, Eugeniu Plamadeala, Davide Venturelli
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffith…
Supplementary information for "Quantum supremacy using a programmable superconducting processor"
Frank Arute, Kunal Arya, Ryan Babbush +74
This is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 201…
Noise amplification at spin-glass bottlenecks of quantum annealing: a solvable model
David Roberts, Lukasz Cincio, Avadh Saxena +2
To gain better insight into the complexity theory of quantum annealing, we propose and solve a class of spin systems which contain bottlenecks of the kind expected to dominate the…
A NASA Perspective on Quantum Computing: Opportunities and Challenges
Rupak Biswas, Zhang Jiang, Kostya Kechezhi +10
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, howeve…
Quantum annealing via environment-mediated quantum diffusion
Vadim N. Smelyanskiy, Davide Venturelli, Alejandro Perdomo-Ortiz +2
We show that quantum diffusion near the quantum critical point can provide a highly very efficient mechanism of open-system quantum annealing. It is based on the diffusion-mediated…
Computational Bottlenecks of Quantum Annealing
Sergey Knysh
A promising approach to solving hard binary optimisation problems is quantum adiabatic annealing (QA) in a transverse magnetic field. An instantaneous ground state --- initially a…