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

Validating the solutions of the D-Wave quantum annealers through graph mirroring

Dilina Perera, James S. Hall, M. A. Novotny

Published Mar 15, 2016• 0 citations
OpenAlex

Related papers

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

An answer checking method for quantum annealers

Dilina Perera, M. A. Novotny

We present a generic approach for checking the validity of the solutions returned by quantum annealing devices to aid in the analysis of whether the solution is the true ground state of the desired problem. The underlying principle is to embed a mirrored graph G' of the original graph G, and connect the two graphs via strong ferromagnetic/antiferromagnetic couplings that span across the mirror plane. This allows one to dismiss solutions that do not agree with the underlying mirror symmetry inherent to the true ground state of the composite graph. Using a 1000 qubit D-Wave 2X device, we demonstrate this method by applying it to spin glass problems defined on the device's native Chimera architecture.

Journal of Physics Conference Series•Sep 1, 2016•1 citation

Quantum Annealing Error Mitigation Using Mirror Symmetries on Different Generations of Quantum Annealers

Bhavika Bhalgamiya, Dilina Perera, M. A. Novotny

We present an effective method of error mitigation on adiabatic quantum annealing machines. This method involves a mirror symmetric property of the adiabatic quantum device underlying graph. The methodology is tested on different generations of D-Wave annealing devices. An initial Hamiltonian is formed with two mirror- symmetric graphs k = k′, coupled with either ferromagnetic (M > 0) or antiferromagnetic (M < 0) graph edges, and then implemented on the underlying D-Wave Chimera graph. Examining the returned solution states at the end of annealing process, allows one to discard returned states that are not the ground state of the problem Hamiltonian. The approach is applicable to any quantum adiabatic device. We used the method to compare the performances of different generations of adiabatic devices.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•1 citation

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

Yuki Bando, Ka-Wa Yip, Hidetoshi Nishimori +1 more

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

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

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
We present a generic approach for checking the validity of the solutions returned by quantum annealing devices to aid in the analysis of whether the solution is the true ground state of the desired problem. The underlying principle is to embed a mirrored graph G' of the original graph G, and connect the two graphs via strong ferromagnetic/antiferromagnetic couplings that span across the mirror plane. This allows one to dismiss solutions that do not agree with the underlying mirror symmetry inherent to the true ground state of the composite graph. Using a 1000 qubit D-Wave 2X device, we demonstrate this method by applying it to spin glass problems defined on the device's native Chimera architecture.
We present an effective method of error mitigation on adiabatic quantum annealing machines. This method involves a mirror symmetric property of the adiabatic quantum device underlying graph. The methodology is tested on different generations of D-Wave annealing devices. An initial Hamiltonian is formed with two mirror- symmetric graphs k = k′, coupled with either ferromagnetic (M > 0) or antiferromagnetic (M < 0) graph edges, and then implemented on the underlying D-Wave Chimera graph. Examining the returned solution states at the end of annealing process, allows one to discard returned states that are not the ground state of the problem Hamiltonian. The approach is applicable to any quantum adiabatic device. We used the method to compare the performances of different generations of adiabatic devices.
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.