Energy Scale Degradation in Sparse Quantum Solvers: A Barrier to Quantum Utility
Not on the map. Why?
Abstract (arXiv)
Quantum computing offers a promising route for tackling hard optimization problems by encoding them as Ising models. However, sparse qubit connectivity requires the use of minor-embedding, mapping logical qubits onto chains of physical qubits, which necessitates stronger intra-chain coupling to maintain consistency. This elevated coupling strength forces a rescaling of the Hamiltonian due to hardware-imposed limits on the allowable ranges of coupling strengths, reducing the energy gaps between competing states, thus, degrading the solver's performance. Here, we introduce a theoretical model that quantifies this degradation. We show that as the connectivity degree increases, the effective temperature rises as a polynomial function, resulting in a success probability that decays exponentially. Our analysis further establishes worst-case bounds on the energy scale degradation based on the inverse conductance of chain subgraphs, revealing two most important drivers of chain strength, textitchain volume and textitchain connectivity. Our findings indicate that achieving quantum advantage is inherently challenging. Experiments on D-Wave quantum annealers validate these findings, highlighting the need for hardware with improved connectivity and optimized scale-aware embedding algorithms.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 3 of its 25 references that are in the map. First posted on arXiv 11 Mar 2025.
Builds on
3 of 25 references.
References · 3
- 2013Ising formulations of many NP problemscited by 206
- 2014A practical heuristic for finding graph minorscited by 26
- 2015Fast clique minor generation in Chimera qubit connectivity graphscited by 10
Built on by
Not cited yet.