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 scalable, universal adiabatic quantum computation

Ari Mizel

Published Mar 18, 2013• 0 citations
OpenAlex

Related papers

On universal adiabatic quantum computation

Ari Mizel

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

Scalable Architecture for Adiabatic Quantum Computing of Np-Hard Problems

William M. Kaminsky, Seth Lloyd

arXiv:quant-ph/0211152•Springer eBooks•Jan 1, 2004•72 citations

Family of [[6k,2k,2]] codes for practical and scalable adiabatic quantum computation

Anand Ganti, Uzoma Onunkwo, Kevin C Young

In this work, we introduce a family of $[[6k,2k,2]]$ codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight 2 logical operators and are particularly well suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increases the graph degree by only two.

arXiv:1309.1674•Physical Review A•Apr 16, 2014•23 citations

Adiabatic Quantum Computation

Catherine C. McGeoch

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

Experimental Adiabatic Quantum Factorization under Ambient Conditions Based on a Solid-State Single Spin System

Kebiao Xu, Tianyu Xie, Zhaokai Li +8 more

The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.

arXiv:1611.03293•Physical Review Letters•Mar 30, 2017•42 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
In this work, we introduce a family of [[6k,2k,2]][[6k,2k,2]][[6k,2k,2]] codes designed specifically to be compatible with adiabatic quantum computation. These codes support computationally universal sets of weight 2 logical operators and are particularly well suited for implementing dynamical decoupling error suppression. For Hamiltonians embeddable on a planar graph of fixed degree, our encoding maintains a planar connectivity graph and increases the graph degree by only two.
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian to that of a final one, which encodes the solution of the problem. Adiabatic quantum computation has been proved to be a compatible candidate for scalable quantum computation. In this Letter, we report on the experimental realization of an adiabatic quantum algorithm on a single solid spin system under ambient conditions. All elements of adiabatic quantum computation, including initial state preparation, adiabatic evolution (simulated by optimal control), and final state read-out, are realized experimentally. As an example, we found the ground state of the problem Hamiltonian S_{z}I_{z} on our adiabatic quantum processor, which can be mapped to the factorization of 35 into its prime factors 5 and 7.
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.