Quantum adiabatic computation and adiabatic conditions

Journal Article · Wed Aug 15 04:00:00 EDT 2007 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.76.024304· OSTI ID:21016064

Zhaohui, Wei; Mingsheng, Ying ^[1]

---

1. State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and Technology, Tsinghua University, Beijing 100084 (China)

Recently, quantum adiabatic computation has attracted more and more attention in the literature. It is a novel quantum computation model based on adiabatic approximation, and the analysis of a quantum adiabatic algorithm depends highly on the adiabatic conditions. However, it has been pointed out that the traditional adiabatic conditions are problematic. Thus, results obtained previously should be checked and sufficient adiabatic conditions applicable to adiabatic computation should be proposed. Based on a result of Tong et al. [Phys. Rev. Lett. 98, 150402 (2007)], we propose a modified adiabatic criterion which is more applicable to the analysis of adiabatic algorithms. As an example, we prove the validity of the local adiabatic search algorithm by employing our criterion.

• OSTI ID: 21016064
• Journal Information: Physical Review. A, Journal Name: Physical Review. A Journal Issue: 2 Vol. 76; ISSN 1050-2947; ISSN PLRAAN
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
ADIABATIC APPROXIMATION
ALGORITHMS
INFORMATION THEORY
QUANTUM COMPUTERS
QUANTUM INFORMATION
QUANTUM MECHANICS