Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
arXiv:2110.08325 · doi:10.1016/j.tcs.2023.114369
Abstract
The embedding is an essential step when calculating on the D-Wave machine. In this work we show the hardness of the embedding problem for both types of existing hardware, represented by the Chimera and the Pegasus graphs, containing unavailable qubits. We construct certain broken Chimera graphs, where it is hard to find a Hamiltonian cycle. As the Hamiltonian cycle problem is a special case of the embedding problem, this proves the general complexity result for the Chimera graphs. By exploiting the subgraph relation between the Chimera and the Pegasus graphs, the proof is then further extended to the Pegasus graphs.
arXiv comment36 pages, 21 figures
References in corpus (6)
- Ising formulations of many NP problems
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- A case study in programming a quantum annealer for hard operational planning problems
- Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
- Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
- Embedding of Complete Graphs in Broken Chimera Graphs