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

Physics World

D-Wave Systems claims quantum advantage in simulations

Tim Wogan

Published Jun 1, 2025• 0 citations
Publisher

Abstract

The US-based firm D-Wave Systems has used quantum annealing to do simulations of quantum magnetic phase transitions.
DOI
10.1088/2058-7058/38/05/11

Related papers

Assessing claims of quantum annealing: Does D-Wave have a quantum computer?

John A. Smolin, Graeme Smith

Bulletin of the American Physical Society•Mar 4, 2014•0 citations

Optimizing Multi-Path Routing in Large-Scale Quantum Networks Using Quantum Annealing

Parker Jones, Vini Chaudhary

This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.

IEEE SoutheastCon•Feb 20, 2026•0 citations

Frustrated Ising Model on D-wave Quantum Annealing Machine

Hayun Park, Hunpyo Lee

We study the frustrated Ising model on the two-dimensional $L \times L$ square lattice with ferromagnetic (FM) nearest-neighbor and antiferromagnetic diagonal-neighbor interactions using the D-wave quantum annealing machine (D-QAM) with 5000+ qubits composed on structure of the Pegasus graph. As the former Monte Carlo and mean field results, we find the FM to stripe order phase transition, through observations of the magnetization $M$, energy, magnetic susceptibility and structure factor. We also analyze probability which occurs any $M$ at a given interaction for many quantum annealing shots to estimate the shape of objective function $f$. The only one value of $M$ with specific phase is observed in the regions far from phase transition for many quantum annealing shots, while several values of $M$ with different possibilities are appeared in the regimes of phase transition. We guess that $f$ in the regimes of phase transition retains the multi-modal structure with several local minimums, due to the strong degeneracies caused by frustrations. Finally, we discuss fail of the quantum annealing simulations, through analysis of the number of the chains, defined as the same variable with $N$-qubits, as a function of $L$.

arXiv:2110.05124•Journal of the Physical Society of Japan•Jun 2, 2022•18 citations

Simulations of Thermal Quantum Annealing on the D-Wave Device

Tameem Albash, Walter Vinci, Anurag Mishra +2 more

Bulletin of the American Physical Society•Mar 4, 2014•0 citations

Performance of quantum annealing on random Ising problems implemented using the D-Wave Two

Zhihui Wang, Joshua Job, Troels F. R Onnow +2 more

Bulletin of the American Physical Society•Mar 4, 2014•1 citation

Simulated outperforms quantum reverse annealing in mean-field models

Christopher L. Baldwin

Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) $p$-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.

arXiv:2511.00150•Oct 31, 2025•2 citations
This paper evaluates quantum annealing as a potential method for solving multi-path routing in large-scale quantum communication networks. The routing problem was formulated as a quadratic unconstrained binary optimization (QUBO) problem that minimizes negative throughput while satisfying quantum network constraints. The experimental framework tests four solution approaches on randomly generated networks: (1) the classical quantum fidelity rate maximizing (Q-FiRM) algorithm, (2) classical simulated annealing, (3) D-Wave hybrid solver, and (4) pure quantum annealing on D-Wave Advantage2 hardware. Results show that while quantum annealers produce feasible solutions, the classical Q-FiRM algorithm achieves superior throughput and faster computation times for this problem class. Among QUBO approaches, hybrid solvers demonstrate computational advantages over pure classical simulated annealing while maintaining comparable solution quality. These findings provide practical insight into the current capabilities and limitations of quantum optimization for quantum internet infrastructure design.
We study the frustrated Ising model on the two-dimensional L×LL \times LL×L square lattice with ferromagnetic (FM) nearest-neighbor and antiferromagnetic diagonal-neighbor interactions using the D-wave quantum annealing machine (D-QAM) with 5000+ qubits composed on structure of the Pegasus graph. As the former Monte Carlo and mean field results, we find the FM to stripe order phase transition, through observations of the magnetization MMM, energy, magnetic susceptibility and structure factor. We also analyze probability which occurs any MMM at a given interaction for many quantum annealing shots to estimate the shape of objective function fff. The only one value of MMM with specific phase is observed in the regions far from phase transition for many quantum annealing shots, while several values of MMM with different possibilities are appeared in the regimes of phase transition. We guess that fff in the regimes of phase transition retains the multi-modal structure with several local minimums, due to the strong degeneracies caused by frustrations. Finally, we discuss fail of the quantum annealing simulations, through analysis of the number of the chains, defined as the same variable with NNN-qubits, as a function of LLL.
Adiabatic reverse annealing (ARA) has been proposed as an improvement to conventional quantum annealing for solving optimization problems, in which one takes advantage of an initial guess at the solution to suppress problematic phase transitions. Here we interpret the performance of ARA through its effects on the free energy landscape, and use the intuition gained to introduce a classical analogue to ARA termed ``simulated reverse annealing'' (SRA). This makes it more difficult to claim that ARA provides a quantum advantage in solving a given problem, as not only must ARA succeed but the corresponding SRA must fail. As a solvable example, we analyze how both protocols behave in the infinite-range (non-disordered) ppp-spin model. Through both the thermodynamic phase diagrams and explicit dynamical behavior, we establish that the quantum algorithm has no advantage over its classical counterpart: SRA succeeds not only in every case where ARA does but even in a narrow range of parameters where ARA fails.