Bibliographic Details
| Title: |
Minor embedding in broken chimera and derived graphs is NP-complete. |
| Authors: |
Lobe, Elisabeth1 (AUTHOR) elisabeth.lobe@dlr.de, Lutz, Annette2 (AUTHOR) |
| Source: |
Theoretical Computer Science. Mar2024, Vol. 989, pN.PAG-N.PAG. 1p. |
| Subjects: |
Hamiltonian graph theory, Quantum annealing, Qubits |
| 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 all types of currently existing hardware, represented by the Chimera and the derived Pegasus and Zephyr 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 derived graphs, the proof is then further extended to the Pegasus graphs and to the Zephyr graphs. [ABSTRACT FROM AUTHOR] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
