Options
Compensating connectivity restrictions in quantum annealers via splitting and linearization techniques
Citation Link: https://doi.org/10.15480/882.15417
Publikationstyp
Preprint
Date Issued
2025-07-16
Sprache
English
TORE-DOI
Current quantum annealing experiments often suffer from restrictions in connectivity in the sense that only certain qubits can be coupled to each other. The most common strategy to overcome connectivity restrictions so far is by combining multiple physical qubits into a logical qubit with higher connectivity, which is achieved by adding terms to the Hamiltonian. Practically, this strategy is implemented by finding a so-called minor embedding, which is in itself an NP-hard problem. In this work, we present an iterative algorithm that does not need additional qubits but instead efficiently uses the available connectivity for different parts of the problem graph in every step. We present a weak monotonicity proof and benchmark our algorithm against the default minor-embedding algorithm on the D-Wave quantum annealer and multiple simple local search variants. While most of the experiments to compare the different iterative methods are performed with simulated annealing solvers, we also confirm the practicality of our method with experiments on the D-Wave Advantage quantum annealer.
Subjects
quantum annealer D-Wave qubits linearization
DDC Class
530: Physics
004: Computer Sciences
006: Special computer methods
More Funding Information
Martin Kliesch is funded by Fujitsu Germany GmbH as part of the endowed
professorship “Quantum Inspired and Quantum Optimization”.
professorship “Quantum Inspired and Quantum Optimization”.
Publication version
submittedVersion
Loading...
Name
2507.12536v1.pdf
Size
1.79 MB
Format
Adobe PDF