Addressing the minor-embedding problem in quantum annealing and evaluating state-of-the-art algorithm performance
Top Cited Papers
- 17 March 2026
- journal article
- Published by Elsevier in Future Generation Computer Systems
- Vol. 182
Abstract
No abstract availableAll Related Versions
Funding Information
- HORIZON EUROPE Framework Programme
- Eusko Jaurlaritza
This publication has 25 references indexed in Scilit:
- On the emerging potential of quantum annealing hardware for combinatorial optimizationJournal of Heuristics, 2024
- Minor embedding in broken chimera and derived graphs is NP-completeTheoretical Computer Science, 2023
- Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problemsQuantum Information Processing, 2022
- Optimizing adiabatic quantum program compilation using a graph-theoretic frameworkQuantum Information Processing, 2018
- Fast clique minor generation in Chimera qubit connectivity graphsQuantum Information Processing, 2015
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph designQuantum Information Processing, 2010
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problemQuantum Information Processing, 2008
- Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization ProblemAnnals of Operations Research, 2004
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- On the complexity of finding iso- and other morphisms for partial k-treesDiscrete Mathematics, 1992