Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
arXiv:1705.08117 · doi:10.7566/JPSJ.87.124002
Abstract
What are the conditions for adiabatic quantum computation (AQC) to outperform classical computation? Although there exist several quantum adiabatic algorithms achieving the strong quantum speedup, the essential keys to their speedups are still unclear. Here, we investigate the connection between superpositions of macroscopically distinct states and known examples of the speedup in AQC. To formalize this notion we consider an index that quantifies a superposition of macroscopically distinct states from the asymptotic behaviors of fluctuations of additive observables. We determine this index for five examples of adiabatic algorithms exhibiting various degrees of the speedup. The results suggest that the superposition of macroscopically distinct states is an appropriate indicator of entanglement crucial to the strong quantum speedup in AQC.
15 pages, 1 figure
References in corpus (13)
- Exponential algorithmic speedup by quantum walk
- Mathematical Foundation of Quantum Annealing
- Bounds for the adiabatic approximation with applications to quantum computation
- Simple proof of equivalence between adiabatic quantum computation and the circuit model
- Quantum Adiabatic Brachistochrone
- The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
- Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction
- Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems
- Probing Entanglement in Adiabatic Quantum Optimization with Trapped Ions
- Conversion of Thermal Equilibrium States into Superpositions of Macroscopically Distinct States
- Visualization of superposition of macroscopically distinct states
- Realizable Quantum Adiabatic Search
- Entanglement as a resource in adiabatic quantum optimization