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

Theoretical and Mathematical Physics

Realizations of standard quantum computational circuits by adiabatic evolution

V. E. Zobov, Alexander S. Ermilov

Published Mar 1, 2007• 2 citations
Publisher
DOI
10.1007/s11232-007-0029-9

Related papers

On the quantum circuit model of a kind of quantum adiabatic evolution

Jie Sun

Quantum Information Processing•Jul 29, 2025•1 citation

Direct mapping of quantum circuits to adiabatic algorithms

M. Stewart Siu

We give a method of mapping any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. It is a direct mapping as we use the same initial, intermediate and final states as in the circuit. Hence we show constructively the existence of efficient adiabatic evolution paths for a class of problems. Since the physical implementation of unitary gates in the circuit model requires precise timing control, the equivalent adiabatic construction may also provide a more realizable alternative.

•Sep 3, 2004•0 citations

Quantum Computation and Adiabatic Evolution

Stefano Olivares

Lecture notes in physics•Jan 1, 2025•0 citations

Transform of Quantum States Via Adiabatic Quantum Evolution

Shi‐Dong Liang

The success of quantum algorithms is to implement correctly quantum states transform,which is mainly achieved by suitable quantum operators.It is shown that the finding of a suitable quantum operator is a great challenge.Most of previous studies solve this problem by machine learning methods.However,these algorithms are different from the standard circuit model of quantum computation which characterizes as unitary quantum operations,thus they are difficult to be realized on quantum computers.It is shown that the transform of quantum states can be implemented by adiabatic quantum evolution,which is a kind of pure quantum effect and suitable well for physical implementation.The adiabatic theorem guarantees that the final state of the system would be the desired output.It is therefore a remarkable approach for quantum states transform in quantum computation and quantum communication.

Acta Scientiarum Naturalium Universitatis Sunyatseni•Jan 1, 2007•0 citations

On universal adiabatic quantum computation

Ari Mizel

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

Adiabatic Quantum Computation

Catherine C. McGeoch

Synthesis lectures on quantum computing•Jan 1, 2014•7 citations
We give a method of mapping any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. It is a direct mapping as we use the same initial, intermediate and final states as in the circuit. Hence we show constructively the existence of efficient adiabatic evolution paths for a class of problems. Since the physical implementation of unitary gates in the circuit model requires precise timing control, the equivalent adiabatic construction may also provide a more realizable alternative.
The success of quantum algorithms is to implement correctly quantum states transform,which is mainly achieved by suitable quantum operators.It is shown that the finding of a suitable quantum operator is a great challenge.Most of previous studies solve this problem by machine learning methods.However,these algorithms are different from the standard circuit model of quantum computation which characterizes as unitary quantum operations,thus they are difficult to be realized on quantum computers.It is shown that the transform of quantum states can be implemented by adiabatic quantum evolution,which is a kind of pure quantum effect and suitable well for physical implementation.The adiabatic theorem guarantees that the final state of the system would be the desired output.It is therefore a remarkable approach for quantum states transform in quantum computation and quantum communication.