Dynamically generated concatenated codes and their phase diagrams

Abstract

We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry and find that for certain classes of gates, applied identically at each node, a binary tree circuit encodes a single logical qubit with code distance that grows exponentially in the depth of the tree. When there is noise in the bulk or at the end of this encoding circuit, the system undergoes a phase transition between a coding phase, where an optimal decoder can successfully recover logical information, and a non-coding phase. Leveraging the tree structure, we combine the formalism of "tensor enumerators" from quantum coding theory with standard recursive techniques for classical spin models on the Bethe lattice to explore these phases. In the presence of bulk errors, the coding phase is a type of spin glass, characterized by a distribution of failure probabilities. When the errors are heralded, the recursion relation is exactly solvable, giving us an analytic handle on the phase diagram.

15 pages, 8 figures, 1 table + 21 pages, 14 figures. v3: close to published version

References in corpus (34)

• Topological quantum memory
• The Bethe lattice spin glass revisited
• Operator Spreading in Random Unitary Circuits
• Quantum Entanglement Growth Under Random Unitary Dynamics
• Theory of the phase transition in random unitary circuits with measurements
• Measurement-induced criticality in random quantum circuits
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Stabilizer Formalism for Operator Quantum Error Correction
• Quantum Low-Density Parity-Check Codes
• Emergent statistical mechanics of entanglement in random unitary circuits
• A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
• High-fidelity gates with mid-circuit erasure conversion in a metastable neutral atom qubit
• Statistical mechanics of quantum error correcting codes
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Measurement and entanglement phase transitions in all-to-all quantum circuits, on quantum trees, and in Landau-Ginsburg theory
• Reconstruction on trees and spin glass transition
• Erasure conversion in a high-fidelity Rydberg quantum simulator
• The entanglement membrane in chaotic many-body systems
• Optimal and Efficient Decoding of Concatenated Quantum Block Codes
• Statistical mechanical models for quantum codes with correlated noise
• Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel
• Tensor Networks and Quantum Error Correction
• High threshold codes for neutral atom qubits with biased erasure errors
• Entanglement Domain Walls in Monitored Quantum Circuits and the Directed Polymer in a Random Environment
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Measurement-induced phase transitions on dynamical quantum trees
• Tensor-network codes
• Ultrafast Entanglement Dynamics in Monitored Quantum Circuits
• Zero-temperature entanglement membranes in quantum circuits
• Local tensor-network codes
• A Solvable Model of Quantum Darwinism-Encoding Transitions
• On the Cleaning Lemma of Quantum Coding Theory
• Charge and Spin Sharpening Transitions on Dynamical Quantum Trees
• Quantum Darwinism-encoding transitions on expanding trees