Theorem on the existence of a nonzero energy gap in adiabatic quantum computation

Abstract

Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and excited states. However, it is difficult to ascertain the exact value of the energy gap. In this paper, we put forward a theorem on the existence of nonzero energy gap for the Hamiltonians used in adiabatic quantum computation. It can help to effectively identify a large class of the Hamiltonians without energy-level crossing between the ground and excited states.

arXiv comment5 pages, 3 figures

References in corpus (19)

• The Physical Implementation of Quantum Computation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Quantum Search by Local Adiabatic Evolution
• Robustness of adiabatic quantum computation
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Simple proof of equivalence between adiabatic quantum computation and the circuit model
• Experimental implementation of an adiabatic quantum optimization algorithm
• A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
• Quantum Speedup by Quantum Annealing
• Adiabatic quantum algorithm for search engine ranking
• Noise resistance of adiabatic quantum computation using random matrix theory
• Experimental determination of Ramsey numbers
• Adiabatic Quantum Computing for Random Satisfiability Problems
• Adiabatic quantum algorithms as quantum phase transitions: first versus second order
• Ramsey numbers and adiabatic quantum computing
• Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?
• Graph isomorphism and adiabatic quantum computing
• Robustness of the adiabatic quantum search
• Probing nonlinear adiabatic paths with a universal integrator

Cited by in corpus (4)

• Quantum Computing for Discrete Optimization: A Highlight of Three Technologies
• Demonstration of Hardware Efficient Photonic Variational Quantum Algorithm
• Recursive simulation of quantum annealing
• Two geometric phases can dramatically differ from each other even if their evolution paths are sufficiently close in a pointwise manner