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

arXiv:1212.1739 · Nature Communications

Experimental signature of programmable quantum annealing

Sergio Boixo, Tameem Albash, Federico M. Spedalieri, Nicholas Chancellor, Daniel A. Lidar

Published Jun 28, 2013• 303 citations
arXivHTMLPDF
DOI
10.1038/ncomms3067

Related papers

Experimental signatures of quantum annealing

Sergio Boixo

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

Experimental Realization of Spin Liquids in a Programmable Quantum Device

Shiyu Zhou, Dmitry Green, Edward D. Dahl +1 more

The advent of widely available computing power has spawned a whole research field that we now call computational physics. Today, we may be on the cusp of a similar paradigm shift as programmable qubit devices enable one to run experiments on a platform of actual physical quantum states. Here we use the commercially available D-Wave DW-2000Q device to build and probe a state of matter that has not been observed or fabricated before. The topological phase that we build has been widely sought for many years and is a candidate platform for quantum computation. While we cannot observe the full quantum regime due to the limitations of the current device, we do observe unmistakable signatures of the phase in its classical limit at the endpoint of the quantum annealing protocol. In the process of doing so, we identify additional features that a programmable device of this sort would need in order to implement fully functional topological qubits. It is a testament to technological progress that a handful of theorists can observe and experiment with new physics while being equipped only with remote access to a commercial device.

Bulletin of the American Physical Society•Sep 16, 2020•4 citations

A quantum annealing approach to solve max-cover problem

NGUYEN Thi Uyen, NGUYEN Canh An, DO Mai Trang +1 more

The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating programmable quantum processors to implement the quantum annealing technique. In this article, we apply the quantum annealing approach to solve the Max-Cover problem. The experimental results show that this approach gives better results than Simulated Annealing in terms of both solution quality and annealing time.

Vinh University Journal of Science•Dec 20, 2022•0 citations

Experiments on Quantum Annealing

G. Aeppli, T. F. Rosenbaum

Lecture notes in physics•Nov 16, 2005•2 citations

Recent progress of quantum annealing

Sei Suzuki

AIP conference proceedings•Jan 1, 2015•0 citations

Analysis of a Programmable Quantum Annealer as a Random Number Generator

Elijah Pelofske

Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.

arXiv:2307.02573•IEEE Transactions on Information Forensics and Security•Jan 1, 2024•4 citations
The advent of widely available computing power has spawned a whole research field that we now call computational physics. Today, we may be on the cusp of a similar paradigm shift as programmable qubit devices enable one to run experiments on a platform of actual physical quantum states. Here we use the commercially available D-Wave DW-2000Q device to build and probe a state of matter that has not been observed or fabricated before. The topological phase that we build has been widely sought for many years and is a candidate platform for quantum computation. While we cannot observe the full quantum regime due to the limitations of the current device, we do observe unmistakable signatures of the phase in its classical limit at the endpoint of the quantum annealing protocol. In the process of doing so, we identify additional features that a programmable device of this sort would need in order to implement fully functional topological qubits. It is a testament to technological progress that a handful of theorists can observe and experiment with new physics while being equipped only with remote access to a commercial device.
The Max-Cover is a NP-hard problem. Therefore, the heuristic approach is suitable to solve this problem for large instances. Quantum annealing is a heuristic quantum optimization algorithm that can be used to handle the Max-Cover problem. Recent developments in quantum technology allows creating programmable quantum processors to implement the quantum annealing technique. In this article, we apply the quantum annealing approach to solve the Max-Cover problem. The experimental results show that this approach gives better results than Simulated Annealing in terms of both solution quality and annealing time.
Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate qubits in a uniform superposition and then measure the state of those qubits. If the preparation of the qubits in a uniform superposition is unbiased, then quantum computers can be used to create high entropy, secure random numbers. Typically, preparing and measuring such quantum systems requires more time compared to classical pseudo random number generators (PRNGs) which are inherently deterministic algorithms. Therefore, the typical use of quantum random number generators (QRNGs) is to provide high entropy secure seeds for PRNGs. Quantum annealing (QA) is a type of analog quantum computation that is a relaxed form of adiabatic quantum computation and uses quantum fluctuations in order to search for ground state solutions of a programmable Ising model. Here we present extensive experimental random number results from a D-Wave 2000Q quantum annealer, totaling over 20 billion bits of QA measurements, which is significantly larger than previous D-Wave QA random number generator studies. Current quantum annealers are susceptible to noise from environmental sources and calibration errors, and are not in general unbiased samplers. Therefore, it is of interest to quantify whether noisy quantum annealers can effectively function as an unbiased QRNG. The amount of data that was collected from the quantum annealer allows a comprehensive analysis of the random bits to be performed using the NIST SP 800-22 Rev 1a testsuite, as well as min-entropy estimates from NIST SP 800-90B. The randomness tests show that the generated random bits from the D-Wave 2000Q are biased, and not unpredictable random bit sequences. With no server-side sampling post-processing, the 1 microsecond annealing time measurements had a min-entropy of 0.824.