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:2504.13376 · Future Generation Computer Systems

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

Published Mar 17, 2026• 17 citations
arXivHTMLPDF
DOI
10.1016/j.future.2026.108481

Related papers

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

Integer Programming Techniques for Minor-Embedding in Quantum Annealers

David E. Bernal, Kyle E. C. Booth, Raouf Dridi +3 more

arXiv:1912.08314•Lecture notes in computer science•Jan 1, 2020•31 citations

ATOM: An Efficient Topology Adaptive Algorithm for Minor Embedding in Quantum Computing

Hoang M. Ngo, Tamer Kahveci, My T. Thai

Quantum annealing (QA) has emerged as a powerful technique to solve optimization problems by taking advantages of quantum physics. In QA process, a bottleneck that may prevent QA to scale up is minor embedding step in which we embed optimization problems represented by a graph, called logical graph, to Quantum Processing Unit (QPU) topology of quantum computers, represented by another graph, call hardware graph. Existing methods for minor embedding require a significant amount of running time in a large-scale graph embedding. To overcome this problem, in this paper, we introduce a novel notion of adaptive topology which is an expandable sub graph of the hardware graph. From that, we develop a minor embedding algorithm, namely Adaptive TOpology eMbedding (ATOM). ATOM iteratively selects a node from the logical graph, and embeds it to the adaptive topology of the hardware graph. Our experimental results show that ATOM is able to provide a feasible embedding in much smaller running time than that of the state-of-the-art without compromising the quality of resulting embedding. 1

arXiv:2307.01843•International Conference on Communications•May 28, 2023•5 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

Embedding parameters for Quantum Annealing

Davide Venturelli

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

Planarity Based Algorithms for Minor Embedding in Grid Graphs

Seyedeh Sahba Etezad

We present heuristic algorithms for minor embedding planar graphs in grids. Our work is motivated by the development of quantum computing hardware that performs quantum annealing. This hardware can be used to solve hard combinatorial problems, but requires the graph of each problem instance to be minor embedded in a graph that models the hardware. Hence, there is a need for practical minor embedding algorithms. We restrict our attention to planar graphs, and thus are able to make use of existing graph drawing methods. We present two algorithms for minor embedding planar graphs in grid graphs, and provide an experimental evaluation of one.

•Jul 20, 2016•1 citation
Quantum annealing (QA) has emerged as a powerful technique to solve optimization problems by taking advantages of quantum physics. In QA process, a bottleneck that may prevent QA to scale up is minor embedding step in which we embed optimization problems represented by a graph, called logical graph, to Quantum Processing Unit (QPU) topology of quantum computers, represented by another graph, call hardware graph. Existing methods for minor embedding require a significant amount of running time in a large-scale graph embedding. To overcome this problem, in this paper, we introduce a novel notion of adaptive topology which is an expandable sub graph of the hardware graph. From that, we develop a minor embedding algorithm, namely Adaptive TOpology eMbedding (ATOM). ATOM iteratively selects a node from the logical graph, and embeds it to the adaptive topology of the hardware graph. Our experimental results show that ATOM is able to provide a feasible embedding in much smaller running time than that of the state-of-the-art without compromising the quality of resulting embedding. 1
We present heuristic algorithms for minor embedding planar graphs in grids. Our work is motivated by the development of quantum computing hardware that performs quantum annealing. This hardware can be used to solve hard combinatorial problems, but requires the graph of each problem instance to be minor embedded in a graph that models the hardware. Hence, there is a need for practical minor embedding algorithms. We restrict our attention to planar graphs, and thus are able to make use of existing graph drawing methods. We present two algorithms for minor embedding planar graphs in grid graphs, and provide an experimental evaluation of one.