Qubit-efficient embedding of parity-encoded Hamiltonians in quantum annealers

arXiv:2603.28667 · quant-ph · Submitted 2026-03-30 · Read on arXiv

quant-ph

Submitted: 2026-03-30

Updated: 2026-09-26

Terminology

• Combinatorial Optimization — 2× in this paper · explained in 2 episodes
• Effective Hamiltonian — 2× in this paper · explained in 2 episodes
• Benchmarking — 1× in this paper · explained in 3 episodes
• Decode — 1× in this paper · explained in 2 episodes
• Embeddings — 1× in this paper · explained in 2 episodes

Sources

• Quantum Computation by Adiabatic Evolution
• Next-Generation Topology of D-Wave Quantum Processors
• A practical heuristic for finding graph minors
• Four-body interactions in Kerr parametric oscillator circuits
• Optimal Decoder for the Error Correcting Parity Code

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity