Logical Operator Decomposition for Distance Analysis of Bivariate Bicycle Codes

arXiv:2609.39395 · quant-ph, cs.IT, math.IT · Submitted 2026-09-30 · Read on arXiv

quant-ph, cs.IT, math.IT

Submitted: 2026-09-30

Updated: 2026-10-01

Code: https://github.com/mohammad-rowshan/BB-Codes-Distance-Logical-Decomposition

Terminology

• Verification — 5× in this paper · explained in 2 episodes
• Sparsity — 2× in this paper · explained in 4 episodes
• Trace — 2× in this paper · explained in 2 episodes
• Anyons — 1× in this paper · explained in 2 episodes
• Consistency — 1× in this paper · explained in 3 episodes
• Failure Modes — 1× in this paper · explained in 3 episodes
• Hypergraph — 1× in this paper · explained in 2 episodes
• Pruning — 1× in this paper · explained in 4 episodes

Sources

• Fault-tolerant quantum computing with color codes
• Self-dual bivariate bicycle codes with transversal Clifford gates

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