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

中国科学通报:英文版

Why quantum adiabatic computation and D-Wave computers are so attractive?

Zhang‐qi Yin, Zhaohui Wei

Published May 11, 2017• 8 citations
Publisher
DOI
10.1016/j.scib.2017.05.001

Related papers

On-sale computer aces quantum test

Jacob Aron

Aron talks about D-Wave's new technique called adiabatic quantum computing. Unlike gate-based computers, which can run any algorithm, adiabatic computers only solve problems that can be expressed such that the lowest point in the landscape corresponds to a solution. Entanglement alone doesn't make D-Wave's device a quantum computer. D-Wave must now show that the entanglement translates into performance gains.

The New Scientist•Jan 1, 2013•0 citations

Quantum Dynamics and Computation with D-Wave Machine

一毅 池田

•Mar 25, 2020•0 citations

D-Wave Systems: Building a Quantum Computer

Alan MacCormack, Ajay K. Agrawal, Rebecca M. Henderson

•Apr 26, 2004•3 citations

Guest Column: Adiabatic Quantum Computing Challenges

Cristian S. Calude, Elena Calude, Michael J. Dinneen

The paper presents a brief introduction to quantum computing with focus on the adiabatic model which is illustrated with the commercial D-Wave computer. We also include new theory and experimental work done on the D-Wave computer. Finally we discuss a hybrid method of combining classical and quantum computing and a few open problems.

ACM SIGACT News•Mar 9, 2015•28 citations

Quantum Computing at D-Wave

P. Aaron Lott

Bulletin of the American Physical Society•Mar 7, 2018•1 citation

Quantum adiabatic computation and adiabatic conditions

Zhaohui Wei, Mingsheng Ying

Recently, quantum adiabatic computation has attracted more and more attention in the literature. It is a novel quantum computation model based on adiabatic approximation, and the analysis of a quantum adiabatic algorithm depends highly on the adiabatic conditions. However, it has been pointed out that the traditional adiabatic conditions are problematic. Thus, results obtained previously should be checked and sufficient adiabatic conditions applicable to adiabatic computation should be proposed. Based on a result of Tong et al. [Phys. Rev. Lett. 98, 150402 (2007)], we propose a modified adiabatic criterion which is more applicable to the analysis of adiabatic algorithms. As an example, we prove the validity of the local adiabatic search algorithm by employing our criterion.

Physical Review A•Aug 22, 2007•31 citations
Recently, quantum adiabatic computation has attracted more and more attention in the literature. It is a novel quantum computation model based on adiabatic approximation, and the analysis of a quantum adiabatic algorithm depends highly on the adiabatic conditions. However, it has been pointed out that the traditional adiabatic conditions are problematic. Thus, results obtained previously should be checked and sufficient adiabatic conditions applicable to adiabatic computation should be proposed. Based on a result of Tong et al. [Phys. Rev. Lett. 98, 150402 (2007)], we propose a modified adiabatic criterion which is more applicable to the analysis of adiabatic algorithms. As an example, we prove the validity of the local adiabatic search algorithm by employing our criterion.