Dynamical Logical Qubits in the Bacon-Shor Code

Abstract

The Bacon-Shor code is a quantum error correcting subsystem code composed of weight 2 check operators that admits a single logical qubit, and has distance $d$ on a $d\times d$ square lattice. We show that when viewed as a Floquet code, by choosing an appropriate measurement schedule of the check operators, it can additionally host several dynamical logical qubits. Specifically, we identify a period 4 measurement schedule of the check operators that preserves logical information between the instantaneous stabilizer groups. Such a schedule measures not only the usual stabilizers of the Bacon-Shor code, but also additional stabilizers that protect the dynamical logical qubits against errors. We show that the code distance of these Floquet-Bacon-Shor codes scales as $\Theta (d/\sqrt{k})$ on an $n=d\times d$ lattice with $k$ dynamical logical qubits, along with the logical qubit of the parent subsystem code. Unlike the usual Bacon-Shor code, the Floquet-Bacon-Shor code family introduced here can therefore saturate the subsystem bound $kd=O(n)$. Moreover, several errors are shown to be self-corrected purely by the measurement schedule itself. This work provides insights into the design space for dynamical codes and expands the known approaches for constructing Floquet codes.

version accepted in Physical Review A

References in corpus (24)

• Anyons in an exactly solved model and beyond
• Surface codes: Towards practical large-scale quantum computation
• Topological Quantum Distillation
• Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
• Stim: a fast stabilizer circuit simulator
• Stabilizer Formalism for Operator Quantum Error Correction
• Interacting Quantum Observables: Categorical Algebra and Diagrammatics
• Dynamically Generated Logical Qubits
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching
• A Fault-Tolerant Honeycomb Memory
• Floquet codes without parent subsystem codes
• Anyon condensation and the color code
• Boundaries for the Honeycomb Code
• Subsystem codes with spatially local generators
• Performance of planar Floquet codes with Majorana-based qubits
• 2-D Compass Codes
• Subsystem codes with high thresholds by gauge fixing and reduced qubit overhead
• Benchmarking the Planar Honeycomb Code
• Unifying flavors of fault tolerance with the ZX calculus
• Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
• Engineering 3D Floquet codes by rewinding
• Quantum computation from dynamic automorphism codes
• Floquetifying the Colour Code
• Topological error correcting processes from fixed-point path integrals

Cited by in corpus (7)

• Error Correction in Dynamical Codes
• Tailoring Dynamical Codes for Biased Noise: The X${}^3$Z${}^3$ Floquet Code
• Contextuality of Quantum Error-Correcting Codes
• Subsystem many-hypercube codes: High-rate concatenated codes with low-weight syndrome measurements
• Logical operations with a dynamical qubit in Floquet-Bacon-Shor code
• A dynamic circuit for the honeycomb Floquet code
• Phases of Floquet code under local decoherence