Physical Review Letters · 2023 · 18 citations · 36 references
ComputingComputer SciencePhysicsQuantum ComputingQuantum MechanicsTheory Of ComputationAdiabatic Quantum ComputingComputational Quantum MechanicsQuantum AlgorithmsQuantum AnnealingQuantum ComputationAdiabatic Theorem ConditionsAnnealingCoherent StatesEnergy EigenstatesLower BoundsOptimal ScalingQuantum Adiabatic TheoremQuantum Coherence
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.
36
Tillmann Baumgratz, M. Cramer, Martin B. Plenio · Physical Review Letters · 2014 · 2.7K citations · Full text
<i>Colloquium</i>: Quantum coherence as a resource
Alexander Streltsov, Gerardo Adesso, Martin B. Plenio · Reviews of Modern Physics · 2017 · 1.8K citations · Full text
Natural Sciences, Biology, Physics +17
Tameem Albash, Daniel A. Lidar · Reviews of Modern Physics · 2018 · 1.6K citations · Full text
Computing, Computer Science, Physics +14