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

Lecture notes in physics

Quantum Computation and Adiabatic Evolution

Stefano Olivares

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.1007/978-3-031-83361-8_12

Related papers

Realizations of standard quantum computational circuits by adiabatic evolution

V. E. Zobov, Alexander S. Ermilov

Theoretical and Mathematical Physics•Mar 1, 2007•2 citations

On the General Class of Models of Adiabatic Evolution

Jie Sun, Songfeng Lu, Fang Liu

The general class of models of adiabatic evolution was proposed to speed up the usual adiabatic computation in the case of quantum search problem. It was shown [8] that, by temporarily increasing the ground state energy of a time-dependent Hamiltonian to a suitable quantity, the quantum computation can perform the calculation in time complexity O(1). But it is also known that if the overlap between the initial and final states of the system is zero, then the computation based on the generalized models of adiabatic evolution can break down completely. In this paper, we find another severe limitation for this class of adiabatic evolution-based algorithms, which should be taken into account in applications. That is, it is still possible that this kind of evolution designed to deal with the quantum search problem fails completely if the interpolating paths in the system Hamiltonian are chosen inappropriately, while the usual adiabatic evolutions can do the same job relatively effectively. This implies that it is not always recommendable to use nonlinear paths in adiabatic computation. On the contrary, the usual simple adiabatic evolution may be sufficient for effective use.

Open Systems & Information Dynamics•Sep 1, 2016•3 citations

Adiabatic Quantum Computation

Catherine C. McGeoch

Synthesis lectures on quantum computing•Jan 1, 2014•8 citations

Measurement-driven analog of adiabatic quantum computation for frustration-free Hamiltonians

Liming Zhao, Carlos A. Pérez-Delgado, Simon C. Benjamin +1 more

The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realized in systems which support Hamiltonian evolution rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that, for certain Hamiltonians, which remain frustration free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a potentially more viable method of realizing adiabatic evolution in gate-based quantum computer architectures.

arXiv:1706.02559•Physical Review A•Sep 23, 2019•6 citations

On universal adiabatic quantum computation

Ari Mizel

Bulletin of the American Physical Society•Mar 15, 2016•0 citations

Different Approaches for Implementing Quantum Search by Adiabatic Evolution

Jie Sun, Songfeng Lu, Yu Zhang

Abstract In this paper, three different approaches for implementing a quantum search algorithm by adiabatic evolution are shown. As expected, either one of them can provide a quadratic speed up as opposed to the classical search algorithm. This implies that adiabatic evolution based quantum computation gives more feasibilities than the quantum circuit model, although the equivalence between them has already been proven in the corresponding literature.

AASRI Procedia•Jan 1, 2012•6 citations
The general class of models of adiabatic evolution was proposed to speed up the usual adiabatic computation in the case of quantum search problem. It was shown [8] that, by temporarily increasing the ground state energy of a time-dependent Hamiltonian to a suitable quantity, the quantum computation can perform the calculation in time complexity O(1). But it is also known that if the overlap between the initial and final states of the system is zero, then the computation based on the generalized models of adiabatic evolution can break down completely. In this paper, we find another severe limitation for this class of adiabatic evolution-based algorithms, which should be taken into account in applications. That is, it is still possible that this kind of evolution designed to deal with the quantum search problem fails completely if the interpolating paths in the system Hamiltonian are chosen inappropriately, while the usual adiabatic evolutions can do the same job relatively effectively. This implies that it is not always recommendable to use nonlinear paths in adiabatic computation. On the contrary, the usual simple adiabatic evolution may be sufficient for effective use.
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realized in systems which support Hamiltonian evolution rather than discrete gates. We explore an alternative approach in which slowly varying measurements are used to mimic adiabatic evolution. We show that, for certain Hamiltonians, which remain frustration free all along the adiabatic path, the necessary measurements can be implemented through the measurement of random terms from the Hamiltonian. This offers a potentially more viable method of realizing adiabatic evolution in gate-based quantum computer architectures.