Error Correction in Dynamical Codes
arXiv:2403.04163 · doi:10.22331/q-2025-10-20-1886
Abstract
We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. Recently, there has been much interest in Floquet codes and space-time codes. In this work, we define and study the distance of a dynamical code. This is a subtle concept and difficult to determine: At any given time, the system will be in a subspace which forms a quantum error-correcting code with a given distance, but the full error correction capability of that code may not be available due to the schedule of measurements associated with the code. We address this challenge by developing an algorithm that tracks information we have learned about the error syndromes through the protocol and put that together to determine the distance of a dynamical code, in a non-fault-tolerant context. We use the tools developed for the algorithm to analyze the initialization and masking properties of a generic Floquet code. Further, we look at properties of dynamical codes under the constraint of geometric locality with a view to understand whether the fundamental limitations on logical gates and code parameters imposed by geometric locality for traditional codes can be surpassed in the dynamical paradigm. We find that codes with a limited number of long range connectivity will not allow non-Clifford gates to be implemented with finite depth circuits in the 2D setting.
46 pages, 8 figures
References in corpus (28)
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Restrictions on Transversal Encoded Quantum Gate Sets
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Tradeoffs for reliable quantum information storage in 2D systems
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Dynamically Generated Logical Qubits
- Classification of topologically protected gates for local stabilizer codes
- Universal transversal gates with color codes - a simplified approach
- Fault-tolerant logical gates in quantum error-correcting codes
- 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
- Quantifying nonlocality: how outperforming local quantum codes is expensive
- Constructions and performance of hyperbolic and semi-hyperbolic Floquet codes
- Quantum computation from dynamic automorphism codes
- Opportunities and Challenges in Fault-Tolerant Quantum Computation
- Topological error correcting processes from fixed-point path integrals
- Spacetime codes of Clifford circuits
- Fault-tolerant hyperbolic Floquet quantum error correcting codes
- Dynamical Logical Qubits in the Bacon-Shor Code
- Floquet codes with a twist
- Measurement Quantum Cellular Automata and Anomalies in Floquet Codes
- Transversal switching between generic stabilizer codes
- Fault tolerance of stabilizer channels
- Fault-tolerant protocols through spacetime concatenation