A scalable 2-local architecture for quantum annealing of Ising models with arbitrary dimensions
arXiv:2404.06861 · doi:10.1103/PhysRevApplied.23.054070
Abstract
Achieving densely connected hardware graphs is a challenge for most quantum computing platforms today, and a particularly crucial one for the case of quantum annealing applications. In this context, we present a scalable architecture for quantum annealers to realize effective Ising Hamiltonians of arbitrary connectivity. Our proposal consists on a resource-efficient configuration based on a hardware graph where physical qubits are connected to at most other 3 and containing exclusively 2-local interactions. We derive this configuration based on chains of qubits encoding logical variables by describing the problem graph in terms of triangles. We thus present a promising new route to scale up devices dedicated to classical optimization tasks within the quantum annealing paradigm.
Incorporation of third author. Changed format and expanded section II to include an example, incorporating current figures 1 and 2 and current table II. Improved accessibility of the text and minor changes to current figures 3 and 4 regarding the presentation of the results, which remain unchanged