A quantum annealing approach to the minimum distance problem of quantum codes

arXiv:2404.17703 · quant-ph, cond-mat.stat-mech · Submitted 2024-04-26 · Read on arXiv

quant-ph, cond-mat.stat-mech

Submitted: 2024-04-26

Updated: 2026-10-14

Code: https://github.com/RefatIsmail96/QUBO-for-Self-dual-Stabilizer-codes

Terminology

• Quantum Annealing — 2× in this paper · explained in 2 episodes
• Hybrid Approach — 1× in this paper · explained in 4 episodes
• Quadratic Unconstrained Binary Optimization — 1× in this paper
• Quantum Annealing (QA) — 1× in this paper · explained in 2 episodes

Sources

• Stabilizer Codes and Quantum Error Correction
• On the Hardness of the Minimum Distance Problem of Quantum Codes
• Numerical Techniques for Finding the Distances of Quantum Codes
• Distance verification for classical and quantum LDPC codes
• A Tutorial on Formulating and Using QUBO Models
• Quantum Error Correction via Codes over GF(4)

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
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians