Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Progress in physics

INTRODUCING ADIABATIC QUANTUM COMPUTATION

Huazhong Li

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

Recent applications of quantum adiabatic approximation to quantum computation are reviewed.We discuss the adiabatic quantum algorithm and the recent discovery of inconsistency of quantum adiabatic theorem giving impact to this application.

Related papers

A note on adiabatic theorem for Markov chains and adiabatic quantum computation

Yevgeniy Kovchegov

We derive an adiabatic theorem for Markov chains using well known facts about mixing and relaxation times. We discuss the results in the context of the recent developments in adiabatic quantum computation.

arXiv:0901.4954•Jan 30, 2009•0 citations

Quantum adiabatic computation and adiabatic conditions

Zhaohui Wei, Mingsheng Ying

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.

Physical Review A•Aug 22, 2007•31 citations

Adiabatic quantum computation

Tameem Albash, Daniel A. Lidar

The simple act of slowly varying the parameters of a quantum system so that it remains always in its ground state is extremely rich from an information processing point of view. For an ideal, closed system, this adiabatic evolution is equivalent to full quantum computation, and it is convenient for establishing quantum algorithms for optimization. This review presents adiabatic quantum algorithms, proves the closed-system equivalence of the adiabatic and circuit models of quantum computation, reviews the placement of adiabatic quantum computation in the more general classification of computational complexity theory, and discusses the case of ``stoquastic'' quantum evolutions.

arXiv:1611.04471•Reviews of Modern Physics•Jan 29, 2018•1,546 citations

Consistency of the Adiabatic Theorem

M. H. S. Amin

The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations of the adiabatic theorem all arise from resonant transitions between energy levels. In the absence of fast driven oscillations the traditional adiabatic theorem holds. Implications for adiabatic quantum computation are discussed.

arXiv:0810.4335•Physical Review Letters•Jun 3, 2009•186 citations

Adiabatic quantum computation

Lukáš Charamza

In this thesis we summarize the principles of quantum computing. We specifically consider adiabatic quantum computing, whose principles are explained and shown on several examples. To explain the principle of adiabatic quantum computing we review the adiabatic theorem. We also outline possibility of using a particular Hamiltonian by Berry, which enables us to evolve system adiabatically in arbitrarily short time. In the final part of this thesis, we explain the concept of quantum phase transitions. We discuss a relationship between quantum phase transitions and adiabatic quantum computing and show that adiabatic quantum computing scales polynomially with the number of qubits only for quantum phase transitions of second or higher order. Powered by TCPDF (www.tcpdf.org)

•Jan 1, 2014•0 citations

GEOMETRIC QUANTUM COMPUTATION AND TOPOLOGICAL QUANTUM COMPUTATION——RECENT APPLICATION OF GLOBAL PROPERTIES OF QUANTUM SYSTEMS

Huazhong Li

The new field of recent developments in quantum computation is reviewed This is an elementary introduction to quantum geometric computation and topological quantum computation.

Progress in physics•Jan 1, 2008•0 citations
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.
The simple act of slowly varying the parameters of a quantum system so that it remains always in its ground state is extremely rich from an information processing point of view. For an ideal, closed system, this adiabatic evolution is equivalent to full quantum computation, and it is convenient for establishing quantum algorithms for optimization. This review presents adiabatic quantum algorithms, proves the closed-system equivalence of the adiabatic and circuit models of quantum computation, reviews the placement of adiabatic quantum computation in the more general classification of computational complexity theory, and discusses the case of ``stoquastic'' quantum evolutions.
In this thesis we summarize the principles of quantum computing. We specifically consider adiabatic quantum computing, whose principles are explained and shown on several examples. To explain the principle of adiabatic quantum computing we review the adiabatic theorem. We also outline possibility of using a particular Hamiltonian by Berry, which enables us to evolve system adiabatically in arbitrarily short time. In the final part of this thesis, we explain the concept of quantum phase transitions. We discuss a relationship between quantum phase transitions and adiabatic quantum computing and show that adiabatic quantum computing scales polynomially with the number of qubits only for quantum phase transitions of second or higher order. Powered by TCPDF (www.tcpdf.org)