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

Bulletin of the American Physical Society

On universal adiabatic quantum computation

Ari Mizel

Published Mar 15, 2016• 0 citations
OpenAlex

Related papers

On scalable, universal adiabatic quantum computation

Ari Mizel

Bulletin of the American Physical Society•Mar 18, 2013•0 citations

Training neural networks with universal adiabatic quantum computing

Steven Adam Abel, Juan Carlos Criado, Michael Spannowsky

The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This article presents a novel approach to NN training using adiabatic quantum computing (AQC), a paradigm that leverages the principles of adiabatic evolution to solve optimization problems. We propose a universal AQC method that can be implemented on gate quantum computers, allowing for a broad range of Hamiltonians and thus enabling the training of expressive neural networks. We apply this approach to various neural networks with continuous, discrete, and binary weights. The study results indicate that AQC can very efficiently evaluate the global minimum of the loss function, offering a promising alternative to classical training methods.

arXiv:2308.13028•Frontiers in Artificial Intelligence•Jun 21, 2024•6 citations

Realization of universal adiabatic quantum computation with fewer physical resources

Qian-Heng Duan, Ping‐Xing Chen

The adiabatic quantum computation (AQC) has been proved to be equivalent with the standard circuit model. To realize AQC, we have to realize the target Hamiltonian. However, usually the target Hamiltonian contains $k$-local terms where $k\ensuremath{\ge}3$ which is difficult to realize in experiment. It has been proved that a $k$-local Hamiltonian can be reduced to a two-local one. However, the reduction process needs a lot of auxiliary qubits which makes the system very complicated. Here we show that one can reduce a three-local Hamiltonian to a two-local one using only one third of the auxiliary qubits the previous approach needs and, in special cases, only three auxiliary qubits.

Physical Review A•Oct 19, 2011•6 citations

Adiabatic Quantum Computation

Catherine C. McGeoch

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

Quantum Computation and Adiabatic Evolution

Stefano Olivares

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

Realizable Hamiltonians for universal adiabatic quantum computers

Jacob Biamonte, Peter J. Love

It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working toward the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known quantum-Merlin-Arthur-complete (QMA-complete) two-local Hamiltonians. The two-local Ising model with one-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable two-local transverse ${\ensuremath{\sigma}}^{x}{\ensuremath{\sigma}}^{x}$ coupling. We also show the universality and QMA-completeness of spin models with only one-local ${\ensuremath{\sigma}}^{z}$ and ${\ensuremath{\sigma}}^{x}$ fields and two-local ${\ensuremath{\sigma}}^{z}{\ensuremath{\sigma}}^{x}$ interactions.

arXiv:0704.1287•Physical Review A•Jul 28, 2008•190 citations
The training of neural networks (NNs) is a computationally intensive task requiring significant time and resources. This article presents a novel approach to NN training using adiabatic quantum computing (AQC), a paradigm that leverages the principles of adiabatic evolution to solve optimization problems. We propose a universal AQC method that can be implemented on gate quantum computers, allowing for a broad range of Hamiltonians and thus enabling the training of expressive neural networks. We apply this approach to various neural networks with continuous, discrete, and binary weights. The study results indicate that AQC can very efficiently evaluate the global minimum of the loss function, offering a promising alternative to classical training methods.
The adiabatic quantum computation (AQC) has been proved to be equivalent with the standard circuit model. To realize AQC, we have to realize the target Hamiltonian. However, usually the target Hamiltonian contains kkk-local terms where $k\ensuremath{\ge}3$ which is difficult to realize in experiment. It has been proved that a kkk-local Hamiltonian can be reduced to a two-local one. However, the reduction process needs a lot of auxiliary qubits which makes the system very complicated. Here we show that one can reduce a three-local Hamiltonian to a two-local one using only one third of the auxiliary qubits the previous approach needs and, in special cases, only three auxiliary qubits.
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions required between spins. To address this concern, the present paper provides two simple model Hamiltonians that are of practical interest to experimentalists working toward the realization of a universal adiabatic quantum computer. The model Hamiltonians presented are the simplest known quantum-Merlin-Arthur-complete (QMA-complete) two-local Hamiltonians. The two-local Ising model with one-local transverse field which has been realized using an array of technologies, is perhaps the simplest quantum spin model but is unlikely to be universal for adiabatic quantum computation. We demonstrate that this model can be rendered universal and QMA-complete by adding a tunable two-local transverse ${\ensuremath{\sigma}}^{x}{\ensuremath{\sigma}}^{x}$ coupling. We also show the universality and QMA-completeness of spin models with only one-local ${\ensuremath{\sigma}}^{z}$ and ${\ensuremath{\sigma}}^{x}$ fields and two-local ${\ensuremath{\sigma}}^{z}{\ensuremath{\sigma}}^{x}$ interactions.