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:1912.08314 · Lecture notes in computer science

Integer Programming Techniques for Minor-Embedding in Quantum Annealers

David E. Bernal, Kyle E. C. Booth, Raouf Dridi, Hedayat Alghassi, Sridhar R. Tayur, Davide Venturelli

Published Jan 1, 2020• 31 citations
arXivHTMLPDF
DOI
10.1007/978-3-030-58942-4_8

Related papers

Efficient Embedding of Integer Programming Problems on Quantum Annealers

Davide Venturelli, Immanuel Trummer

Bulletin of the American Physical Society•Mar 13, 2017•0 citations

Addressing the minor-embedding problem in quantum annealing and evaluating state-of-the-art algorithm performance

Aitor Gomez-Tejedor, Eneko Osaba, Esther Villar-Rodríguez

arXiv:2504.13376•Future Generation Computer Systems•Mar 17, 2026•17 citations

Quantum Error Correction for Minor Embedded Quantum Annealing

Walter Vinci, Gerardo A. Paz-Silva, Anurag Mishra +2 more

Bulletin of the American Physical Society•Mar 2, 2015•0 citations

Structure-Aware Minor-Embedding for Machine Learning in Quantum Annealing Processors

Jose P. Pinilla, Steven J. E. Wilton

Springer eBooks•Aug 7, 2023•2 citations

Adiabatic quantum programming: minor embedding with hard faults

Christine Klymko, Blair D. Sullivan, Travis S. Humble

arXiv:1210.8395•Quantum Information Processing•Nov 19, 2013•104 citations

4-Clique network minor embedding for quantum annealers

Elijah Pelofske

Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024

arXiv:2301.08807•Physical Review Applied•Mar 13, 2024•19 citations
Quantum annealing is a quantum algorithm for computing solutions to combinatorial optimization problems. This study proposes a method for minor embedding optimization problems onto sparse quantum annealing hardware graphs called 4-clique network minor embedding. This method is in contrast to the standard minor embedding technique of using a path of linearly connected qubits in order to represent a logical variable state. The 4-clique minor embedding is possible on Pegasus graph connectivity, which is the native hardware graph for some of the current D-Wave quantum annealers. The Pegasus hardware graph contains many cliques of size 4, making it possible to form a graph composed entirely of paths of connected 4-cliques on which a problem can be minor-embedded. The 4-clique chains come at the cost of additional qubit usage on the hardware graph, but they allow for stronger coupling within each chain, thereby increasing chain integrity, reducing chain breaks, and allow for greater usage of the available energy scale for programming logical problem coefficients on current quantum annealers. The 4-clique minor embedding technique is compared with the standard linear path minor embedding with experiments on two D-Wave quantum annealing processors with Pegasus hardware graphs. We show proof-of-concept experiments where the 4-clique minor embeddings can use weak chain strengths while successfully carrying out the computation of minimizing random all-to-all spin glass problem instances. Published by the American Physical Society 2024