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

Elsevier eBooks

Quantum annealing and adiabatic quantum computing

Charles R. Giardina

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1016/b978-0-443-13697-9.00021-7

Related papers

Adiabatic Quantum Computing and Quantum Annealing

Bastien Chopard B, Marco Tomassini

Natural computing series•Jan 1, 2026•0 citations

Adiabatic Quantum Computation and Quantum Annealing

WORLD SCIENTIFIC eBooks•Jul 15, 2020•0 citations

Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice

Catherine C. McGeoch

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

Computational performance and scaling of adiabatic quantum annealing processors

Troels F. R Onnow, Sergei V. Isakov, Dave Wecker +2 more

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

Discussions about high-quality embeddings on Quantum Annealers

Valentin Gilbert, Julien Rodriguez

Quantum Annealers (QA) such as D-Wave systems constitute a noisy implementation of the Adiabatic Quantum Computing process (AQC) and are used to find the ground state of an Ising problem. Qubit interconnections of a quantum chip are usually limited, and finding a good mapping of the Ising problem onto the quantum chip can be challenging. In fact, even defining what is a high-quality embedding is not trivial. After presenting a short review of existing embedding methods, we propose different experiments that could identify important criteria to consider while mapping problems on Quantum Annealers.

•Apr 17, 2023•1 citation

Assessing the quantumness of the annealing dynamics via Leggett Garg’s inequalities: a weak measurement approach

Vittorio Vitale, G. De Filippis, ANTONIO DE CANDIA +3 more

Adiabatic quantum computation (AQC) is a promising counterpart of universal quantum computation, based on the key concept of quantum annealing (QA). QA is claimed to be at the basis of commercial quantum computers and benefits from the fact that the detrimental role of decoherence and dephasing seems to have poor impact on the annealing towards the ground state. While many papers show interesting optimization results with a sizable number of qubits, a clear evidence of a full quantum coherent behavior during the whole annealing procedure is still lacking. In this paper we show that quantum non-demolition (weak) measurements of Leggett Garg inequalities can be used to efficiently assess the quantumness of the QA procedure. Numerical simulations based on a weak coupling Lindblad approach are compared with classical Langevin simulations to support our statements.

arXiv:1902.08257•Scientific Reports•Sep 20, 2019•3 citations
Quantum Annealers (QA) such as D-Wave systems constitute a noisy implementation of the Adiabatic Quantum Computing process (AQC) and are used to find the ground state of an Ising problem. Qubit interconnections of a quantum chip are usually limited, and finding a good mapping of the Ising problem onto the quantum chip can be challenging. In fact, even defining what is a high-quality embedding is not trivial. After presenting a short review of existing embedding methods, we propose different experiments that could identify important criteria to consider while mapping problems on Quantum Annealers.
Adiabatic quantum computation (AQC) is a promising counterpart of universal quantum computation, based on the key concept of quantum annealing (QA). QA is claimed to be at the basis of commercial quantum computers and benefits from the fact that the detrimental role of decoherence and dephasing seems to have poor impact on the annealing towards the ground state. While many papers show interesting optimization results with a sizable number of qubits, a clear evidence of a full quantum coherent behavior during the whole annealing procedure is still lacking. In this paper we show that quantum non-demolition (weak) measurements of Leggett Garg inequalities can be used to efficiently assess the quantumness of the QA procedure. Numerical simulations based on a weak coupling Lindblad approach are compared with classical Langevin simulations to support our statements.