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

The New Scientist

On-sale computer aces quantum test

Jacob Aron

Published Jan 1, 2013• 0 citations
OpenAlex

Abstract

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.

Related papers

Adiabatic Quantum Computing with QUBO Formulations

Rui Hua

Quantum physics has the potential to revolutionize computer science by building what is called a quantum computer. Quantum computers can perform tasks that are impossible with Turing-machine based classical computers (e.g., generating random sequences of bits) and can outperform classical computers (to different degrees) in a variety of classical computation problems. Several different models of quantum computing exist. Based on the Adiabatic Theorem in physics, Adiabatic Quantum Computing is a novel computing framework that is drastically different from the more traditional quantum logic gate model. Traditionally, quantum computing has only been tested on devices with a very small number of qubits, severely limiting their uses in practice. In recent years however, advances in engineering and physics have allowed the construction for (relatively) large machines called quantum annealers that do what is known as a specific type of adiabatic quantum computation called quantum annealing. Solving classical computation problems with the quantum annealing framework is not an easy task and there are many obstacles to overcome if we want to achieve any kind of speedups over classical algorithms. In this thesis, we present quantum annealing solutions to several classical problems including the Hamiltonian Cycle Problem, Mixed Dominating Set Problem, Graph Isomorphism Problem, Densest k-Subgraph Problem and the Maximum Weighted Independent Set Problem. Experimental results of these quantum solutions on DWave quantum annealers are also reported. We also look at some of the bottlenecks in the quantum annealing framework and propose several novel approach to mitigate their effects on the efficiency of the quantum solutions.

•Jan 1, 2016•2 citations

Adiabatic quantum computing

Elisabeth Lobe, Tobias Stollenwerk, Anke Tröltzsch

In the recent years, the field of adiabatic quantum computing has gained importance due to the advances in the realisation of such machines, especially by the company D-Wave Systems. These machines are suited to solve discrete optimisation problems which are typically very hard to solve on a classical computer. Due to the quantum nature of the device it is assumed that there is a substantial speedup compared to classical HPC facilities. We explain the basic principles of adiabatic quantum computing as well as its advantages and limitations. By using a quantum computer simulation software we present how discrete optimisation problems, like map colouring and the maximal Clique problem, can be solved. In addition, we investigate the applicability of adiabatic quantum computing to DLR specific problems.

•Jan 1, 2015•9 citations

How to test the “quantumness” of a quantum computer?

Alexandre M. Zagoskin, Evgeni V. Il’ichev, M. Grajcar +2 more

Recent devices, using hundreds of superconducting quantum bits, claim to perform quantum computing. However, it is not an easy task to determine and quantify the degree of quantum coherence and control used by these devices. Namely, it is a difficult task to know with certainty whether or not a given device (e.g., the D-Wave One or D-Wave Two) is a quantum computer. Such a verification of quantum computing would be more accessible if we already had some kind of working quantum computer, to be able to compare the outputs of these various computing devices. Moreover, the verification process itself could strongly depend on whether the tested device is a standard (gate-based) or, e.g., an adiabatic quantum computer. Here we do not propose a technical solution to this quantum-computing “verification problem”, but rather outline the problem in a way which would help both specialists and non-experts to see the scale of this difficult task, and indicate some possible paths towards its solution.

arXiv:1401.2870•Frontiers in Physics•May 30, 2014•21 citations

Solving Hard Problems on Adiabatic Quantum Computers

Daniel Ciocirlan, Nicolae Ţăpuş, Dan Dragomir

Quantum Computation has thus far proven a promising new research field, with results that vastly surpass their classical counterparts, but programming a quantum computer is in its infant stage, at best. D-Wave have successfully implemented a computing machine based on adiabatic evolution which natively solves Ising problems by construction. In this paper we present additional solutions to known computational problems by reducing them to mathematical expressions. They will be passed to the quantum computer through Blackbox, a mechanism that maps objective functions to the native Ising form the D-Wave machine recognizes.

International Conference on Control Systems and Computer Science•May 1, 2015•0 citations

Adiabatic Quantum Computing

Sebastian D. Pinski

Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim to have built a working AQC which is now commercially available and hope to be distributing a 1024 qubit chip by the end of 2008. Their 16 qubit chip was demonstrated online for the Supercomputing 2007 conference within which a few small problems were solved; although the explanations that journalists and critics received were minimal and very little was divulged in the question and answer session. This 'unconvincing' demonstration has caused physicists and computer scientists to hit back at D-Wave. The aim of this project is to give an introduction to the historic advances in classical and quantum computing and to explore the methods of AQC. Through numerical simulations an algorithm for the Max Independent Set problem is empirically obtained.

arXiv:1108.0560•Aug 2, 2011•2 citations

Gates for Adiabatic Quantum Computing

Richard H. Warren

The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and corresponds to minimizing a discrete function. The input function can be influenced by rewards and penalties to favor a solution that meets restrictions that are imposed by the problem. We show how to accomplish this influence for gates in adiabatic quantum computing, particularly the controlled-NOT gate (CNOT gate) which is fundamental to all quantum gates on two or more qubits. In addition, we adapt the Toffoli gate, the Fredkin gate, and the Hadamard gate to the Ising objective function which is a foundation for discrete optimization on D-Wave System machines. The quantum work in this paper encompasses Boolean operations, some of which are used to construct gates. We think the possible advantages of the building blocks in this paper will enhance quantum algorithms on D-Wave System computers.

arXiv:1405.2354•May 7, 2014•3 citations
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.
Quantum physics has the potential to revolutionize computer science by building what is called a quantum computer. Quantum computers can perform tasks that are impossible with Turing-machine based classical computers (e.g., generating random sequences of bits) and can outperform classical computers (to different degrees) in a variety of classical computation problems. Several different models of quantum computing exist. Based on the Adiabatic Theorem in physics, Adiabatic Quantum Computing is a novel computing framework that is drastically different from the more traditional quantum logic gate model. Traditionally, quantum computing has only been tested on devices with a very small number of qubits, severely limiting their uses in practice. In recent years however, advances in engineering and physics have allowed the construction for (relatively) large machines called quantum annealers that do what is known as a specific type of adiabatic quantum computation called quantum annealing. Solving classical computation problems with the quantum annealing framework is not an easy task and there are many obstacles to overcome if we want to achieve any kind of speedups over classical algorithms. In this thesis, we present quantum annealing solutions to several classical problems including the Hamiltonian Cycle Problem, Mixed Dominating Set Problem, Graph Isomorphism Problem, Densest k-Subgraph Problem and the Maximum Weighted Independent Set Problem. Experimental results of these quantum solutions on DWave quantum annealers are also reported. We also look at some of the bottlenecks in the quantum annealing framework and propose several novel approach to mitigate their effects on the efficiency of the quantum solutions.
In the recent years, the field of adiabatic quantum computing has gained importance due to the advances in the realisation of such machines, especially by the company D-Wave Systems. These machines are suited to solve discrete optimisation problems which are typically very hard to solve on a classical computer. Due to the quantum nature of the device it is assumed that there is a substantial speedup compared to classical HPC facilities. We explain the basic principles of adiabatic quantum computing as well as its advantages and limitations. By using a quantum computer simulation software we present how discrete optimisation problems, like map colouring and the maximal Clique problem, can be solved. In addition, we investigate the applicability of adiabatic quantum computing to DLR specific problems.
Recent devices, using hundreds of superconducting quantum bits, claim to perform quantum computing. However, it is not an easy task to determine and quantify the degree of quantum coherence and control used by these devices. Namely, it is a difficult task to know with certainty whether or not a given device (e.g., the D-Wave One or D-Wave Two) is a quantum computer. Such a verification of quantum computing would be more accessible if we already had some kind of working quantum computer, to be able to compare the outputs of these various computing devices. Moreover, the verification process itself could strongly depend on whether the tested device is a standard (gate-based) or, e.g., an adiabatic quantum computer. Here we do not propose a technical solution to this quantum-computing “verification problem”, but rather outline the problem in a way which would help both specialists and non-experts to see the scale of this difficult task, and indicate some possible paths towards its solution.
Quantum Computation has thus far proven a promising new research field, with results that vastly surpass their classical counterparts, but programming a quantum computer is in its infant stage, at best. D-Wave have successfully implemented a computing machine based on adiabatic evolution which natively solves Ising problems by construction. In this paper we present additional solutions to known computational problems by reducing them to mathematical expressions. They will be passed to the quantum computer through Blackbox, a mechanism that maps objective functions to the native Ising form the D-Wave machine recognizes.
Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim to have built a working AQC which is now commercially available and hope to be distributing a 1024 qubit chip by the end of 2008. Their 16 qubit chip was demonstrated online for the Supercomputing 2007 conference within which a few small problems were solved; although the explanations that journalists and critics received were minimal and very little was divulged in the question and answer session. This 'unconvincing' demonstration has caused physicists and computer scientists to hit back at D-Wave. The aim of this project is to give an introduction to the historic advances in classical and quantum computing and to explore the methods of AQC. Through numerical simulations an algorithm for the Max Independent Set problem is empirically obtained.
The goal of this paper is to introduce building blocks for adiabatic quantum algorithms. Adiabatic quantum computing uses the principle of quantum annealing, which implies that a carefully controlled energy solution is optimal and corresponds to minimizing a discrete function. The input function can be influenced by rewards and penalties to favor a solution that meets restrictions that are imposed by the problem. We show how to accomplish this influence for gates in adiabatic quantum computing, particularly the controlled-NOT gate (CNOT gate) which is fundamental to all quantum gates on two or more qubits. In addition, we adapt the Toffoli gate, the Fredkin gate, and the Hadamard gate to the Ising objective function which is a foundation for discrete optimization on D-Wave System machines. The quantum work in this paper encompasses Boolean operations, some of which are used to construct gates. We think the possible advantages of the building blocks in this paper will enhance quantum algorithms on D-Wave System computers.