Minor embedding in broken chimera and derived graphs is NP-complete
Authors:
- Elisabeth LobeELElisabeth Lobe
- Annette LutzALAnnette Lutz
Open Access
- 28 December 2023
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 989
Abstract
No abstract availableKeywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Optimizing adiabatic quantum program compilation using a graph-theoretic frameworkQuantum Information Processing, 2018
- A case study in programming a quantum annealer for hard operational planning problemsQuantum Information Processing, 2014
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Adiabatic quantum programming: minor embedding with hard faultsQuantum Information Processing, 2013
- Faster parameterized algorithms for minor containmentTheoretical Computer Science, 2011
- Fast Minor Testing in Planar GraphsAlgorithmica, 2011
- 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
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Hamilton Paths in Grid GraphsSIAM Journal on Computing, 1982