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

Bulletin of the American Physical Society

Experimental studies of reverse annealing of p-spin problem on D-Wave quantum annealer

Yuki Bando, Ka-Wa Yip, Hidetoshi Nishimori, Daniel A. Lidar

Published Mar 15, 2021• 0 citations
OpenAlex

Related papers

Progress on exploring practical applications of quantum annealing and D-Wave One

Sergio Boixo, Federico M. Spedalieri

Bulletin of the American Physical Society•Feb 29, 2012•0 citations

Unraveling reverse annealing: A study of D-Wave quantum annealers

Vrinda Mehta, Hans A. De Raedt, Kristel F. L. Michielsen +1 more

D-Wave quantum annealers offer reverse annealing as a feature allowing them to refine solutions to optimization problems. This paper investigates the influence of key parameters, such as annealing times and reversal distance, on the behavior of reverse annealing by studying models containing up to 1000 qubits. Through the analysis of theoretical models and experimental data, we explore the interplay between quantum and classical processes in describing the empirical data. Our findings provide a deeper understanding that can better equip users to fully harness the potential of the D-Wave annealers.

Physical Review A•Jan 1, 2025•0 citations

Solving Quantum Chemistry Problems with a D-Wave Quantum Annealer

Michael Streif, Florian Neukart, Martin Leib

arXiv:1811.05256•Lecture notes in computer science•Jan 1, 2019•64 citations

Unraveling reverse annealing: A study of D-Wave quantum annealers

Vrinda Mehta, Hans A. De Raedt, Kristel F. L. Michielsen +1 more

D-Wave quantum annealers offer reverse annealing as a feature allowing them to refine solutions to optimization problems. This paper investigates the influence of key parameters, such as annealing times and reversal distance, on the behavior of reverse annealing by studying models containing up to 1000 qubits. Through the analysis of theoretical models and experimental data, we explore the interplay between quantum and classical processes in describing the empirical data. Our findings provide a deeper understanding that can better equip users to fully harness the potential of the D-Wave annealers.

arXiv:2502.08575•Physical Review A•Jun 12, 2025•9 citations

Reverse Quantum Annealing Assisted by Forward Annealing

Manpreet Singh Jattana

Quantum annealers conventionally use forward annealing to generate heuristic solutions. Reverse annealing can potentially generate better solutions but necessitates an appropriate initial state. Ways to find such states are generally unknown or highly problem dependent, offer limited success, and severely restrict the scope of reverse annealing. We use a general method that improves the overall solution quality and quantity by feeding reverse annealing with low-quality solutions obtained from forward annealing. An experimental demonstration of solving the graph coloring problem using the D-Wave quantum annealers shows that our method is able to convert invalid solutions obtained from forward annealing to at least one valid solution obtained after assisted reverse annealing for 57% of 459 random Erdos–Rényi graphs. Our method significantly outperforms random initial states, obtains more unique solutions on average, and widens the applicability of reverse annealing. Although the average number of valid solutions obtained drops exponentially with the problem size, a scaling analysis for the graph coloring problem shows that our method effectively extends the computational reach of conventional forward annealing using reverse annealing.

arXiv:2408.13603•Quantum Reports•Aug 23, 2024•6 citations

Optimal quantum annealing in p-spin model

Kostyantyn Kechedzhi, Vadim Smelyanskiy

Bulletin of the American Physical Society•Mar 4, 2015•0 citations
D-Wave quantum annealers offer reverse annealing as a feature allowing them to refine solutions to optimization problems. This paper investigates the influence of key parameters, such as annealing times and reversal distance, on the behavior of reverse annealing by studying models containing up to 1000 qubits. Through the analysis of theoretical models and experimental data, we explore the interplay between quantum and classical processes in describing the empirical data. Our findings provide a deeper understanding that can better equip users to fully harness the potential of the D-Wave annealers.
D-Wave quantum annealers offer reverse annealing as a feature allowing them to refine solutions to optimization problems. This paper investigates the influence of key parameters, such as annealing times and reversal distance, on the behavior of reverse annealing by studying models containing up to 1000 qubits. Through the analysis of theoretical models and experimental data, we explore the interplay between quantum and classical processes in describing the empirical data. Our findings provide a deeper understanding that can better equip users to fully harness the potential of the D-Wave annealers.
Quantum annealers conventionally use forward annealing to generate heuristic solutions. Reverse annealing can potentially generate better solutions but necessitates an appropriate initial state. Ways to find such states are generally unknown or highly problem dependent, offer limited success, and severely restrict the scope of reverse annealing. We use a general method that improves the overall solution quality and quantity by feeding reverse annealing with low-quality solutions obtained from forward annealing. An experimental demonstration of solving the graph coloring problem using the D-Wave quantum annealers shows that our method is able to convert invalid solutions obtained from forward annealing to at least one valid solution obtained after assisted reverse annealing for 57% of 459 random Erdos–Rényi graphs. Our method significantly outperforms random initial states, obtains more unique solutions on average, and widens the applicability of reverse annealing. Although the average number of valid solutions obtained drops exponentially with the problem size, a scaling analysis for the graph coloring problem shows that our method effectively extends the computational reach of conventional forward annealing using reverse annealing.