Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.08566 · PRX Quantum

XYZ Ruby Code: Making a Case for a Three-Colored Graphical Calculus for Quantum Error Correction in Spacetime

Julio C. Magdalena de la Fuente, Josias Old, Alex Townsend-Teague, Manuel Rispler, Jens Eisert, Markus Müller

Published Mar 28, 2025• 21 citations
arXivHTMLPDF

Abstract

Analyzing and developing new quantum error-correcting (QEC) schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the functioning of the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ . Based on the projective symmetries of the building blocks of the tensor network we develop a framework of . Pauli flows allow for a graphical understanding of all quantities entering an error-correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor-network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement-based and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes, which are in the same topological phase as the 2 + 1 -dimensional color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z 3 automorphism to the logical Pauli group every three time steps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of approximately equal to 0.18 % , comparable with other Floquet codes and 2 + 1 -dimensional color codes.

DOI
10.1103/prxquantum.6.010360

Related papers

Spacetime Spins: Statistical mechanics for error correction with stabilizer circuits

Cory T. Aitchison, Benjamin Béri

A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements. Recent progress in quantum error correction, however, has prompted new paradigms where codes emerge from stabilizer circuits in spacetime -- a unifying perspective encompassing syndrome extraction circuits of static codes, dynamically generated codes, and logical operations. We show how to construct statistical mechanical models for stabilizer circuits subject to independent Pauli errors, by mapping logical equivalence class probabilities of errors to partition functions using the spacetime subsystem code formalism. We also introduce a modular language of spin diagrams for constructing the spin Hamiltonians, which we describe in detail focusing on independent circuit-level X-Z error channels. With the repetition and toric codes as examples, we use our approach to analytically rank logical error rates and thresholds between code implementations with standard and dynamic syndrome extraction circuits, describe the effect of transversal logical Clifford gates on logical error rates, and perform Monte Carlo simulations to estimate maximum likelihood thresholds. Our framework offers a universal prescription to analyze, simulate, and compare the decoding properties of any stabilizer circuit, while revealing the innate connections between dynamical quantum systems and noise-resilient phases of matter.

quant-pharXiv:2512.21991•Dec 29, 2025•4 citations

Fault-tolerant transformations of spacetime codes

Arthur Chalom Pesah, Austin K. Daniel, Ilan Tzitrin +1 more

Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code equipped with a syndrome extraction circuit. Spacetime codes have emerged as a natural framework to understand error correction at the circuit level while leveraging the traditional QEC toolbox. Here, we introduce a framework based on chain complexes and chain maps to model spacetime codes and transformations between them. We show that stabilizer codes, quantum circuits, and decoding problems can all be described using chain complexes, and that the equivalence of two spacetime codes can be characterized by specific maps between chain complexes, the fault-tolerant maps, that preserve the number of encoded qubits, fault distance, and minimum-weight decoding problem. As an application of this framework, we extend the foliated cluster state construction from stabilizer codes to any spacetime code, showing that any Clifford circuit can be transformed into a measurement-based protocol with the same fault-tolerant properties. To this protocol, we associate a chain complex which encodes the underlying decoding problem, generalizing previous cluster state complex constructions. Our method enables the construction of cluster states from non-CSS, subsystem, and Floquet codes, as well as from logical Clifford operations on a given code.

arXiv:2509.09603•Sep 11, 2025•17 citations

Planar Fault-Tolerant Circuits for Non-Clifford Gates on the 2D Color Code

Andreas Bauer, Julio C. Magdalena de la Fuente

We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical T gate or a logical non-Pauli measurement that prepares a magic | T ⟩ state. The circuits are relatively simple, consisting only of physical T gates, C X gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime Z X tensor network and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a “just-in-time” decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.

arXiv:2505.05175•PRX Quantum•Apr 24, 2026•18 citations

Practical gates by Majorana fermion motion

Yuri D. Lensky, Bryce Kobrin, Kostyantyn Kechedzhi +1 more

Quantum error correction protocols protect against local errors by storing logical information non-locally. This poses a challenge: how to design efficient logical gates on the non-local ``hidden'' logical information, and how to implement these gates using the local physical operations. We develop a general description of planar Pauli stabilizer codes and protocols for logical operations in terms of point-like particles called Majorana fermions. Information is stored in the pairwise fermion parities of spatially separated Majorana fermions. The description in terms of Majorana fermions captures not only large distance asymptotics, but also all scales down to the lattice constants. We exploit this locality to densely pack logical information in spacetime. The simplest application is to a static case: dense memory. More importantly, we implement fault-tolerant Majorana motion and leverage this primitive to design braiding-based logical gates. This approach reduces space overhead of logical operations resulting in an improved logical error rate given fixed number of physical qubits. We illustrate a practical use of our approach by designing and benchmarking of 2-qubit Clifford gates. We find numerically that our protocol outperforms lattice surgery in this setting for near-term error rates and realistic device constraints. More generally, introduction of compact motion of Majorana fermions as an efficient computational primitive opens a promising new route for the design of low overhead error correction protocols.

quant-pharXiv:2606.03916•Jun 3, 2026•1 citation

Quantum Error Correction: Surface And Topological Codes

N Raji

Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.

•Mar 12, 2026•0 citations

Logical Operations with a Dynamical Qubit in Floquet-Bacon-Shor Code

Xuandong Sun, Longcheng Li, Zechen Guo +29 more

Quantum error correction (QEC) protects quantum systems against inevitable noises and control inaccuracies, providing a pathway toward fault-tolerant (FT) quantum computation. Stabilizer codes, including surface code and color code, have long been the focus of research and have seen significant experimental progress in recent years. Recently proposed time-dynamical QEC, including Floquet codes and generalized time-dynamical code implementations, opens up new opportunities for FT quantum computation. By employing a periodic schedule of low-weight parity checks, Floquet codes can generate additional dynamical logical qubits, offering enhanced error correction capabilities and, potentially, higher code performance. Here, we experimentally implement the Floquet-Bacon-Shor code on a superconducting quantum processor. We encode a dynamical logical qubit within a 3×3 lattice of data qubits alongside a conventional static logical qubit. We demonstrate FT encoding and measurement of the two-qubit logical states and stabilize these states using repeated error detection. We showcase universal single-qubit logical gates on the dynamical qubit. Furthermore, by implementing a logical controlled-not (cnot) gate, we entangle the dynamical and static logical qubits, generating an error-detected logical Bell state with a fidelity of 75.9%. Our results highlight the potential of Floquet codes for resource-efficient FT quantum computation.

arXiv:2503.03867•Physical Review Letters•Nov 6, 2025•3 citations
Analyzing and developing new quantum error-correcting (QEC) schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the functioning of the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ . Based on the projective symmetries of the building blocks of the tensor network we develop a framework of . Pauli flows allow for a graphical understanding of all quantities entering an error-correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor-network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement-based and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes, which are in the same topological phase as the 2 + 1 -dimensional color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z 3 automorphism to the logical Pauli group every three time steps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of approximately equal to 0.18 % , comparable with other Floquet codes and 2 + 1 -dimensional color codes.
A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements. Recent progress in quantum error correction, however, has prompted new paradigms where codes emerge from stabilizer circuits in spacetime -- a unifying perspective encompassing syndrome extraction circuits of static codes, dynamically generated codes, and logical operations. We show how to construct statistical mechanical models for stabilizer circuits subject to independent Pauli errors, by mapping logical equivalence class probabilities of errors to partition functions using the spacetime subsystem code formalism. We also introduce a modular language of spin diagrams for constructing the spin Hamiltonians, which we describe in detail focusing on independent circuit-level X-Z error channels. With the repetition and toric codes as examples, we use our approach to analytically rank logical error rates and thresholds between code implementations with standard and dynamic syndrome extraction circuits, describe the effect of transversal logical Clifford gates on logical error rates, and perform Monte Carlo simulations to estimate maximum likelihood thresholds. Our framework offers a universal prescription to analyze, simulate, and compare the decoding properties of any stabilizer circuit, while revealing the innate connections between dynamical quantum systems and noise-resilient phases of matter.
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code equipped with a syndrome extraction circuit. Spacetime codes have emerged as a natural framework to understand error correction at the circuit level while leveraging the traditional QEC toolbox. Here, we introduce a framework based on chain complexes and chain maps to model spacetime codes and transformations between them. We show that stabilizer codes, quantum circuits, and decoding problems can all be described using chain complexes, and that the equivalence of two spacetime codes can be characterized by specific maps between chain complexes, the fault-tolerant maps, that preserve the number of encoded qubits, fault distance, and minimum-weight decoding problem. As an application of this framework, we extend the foliated cluster state construction from stabilizer codes to any spacetime code, showing that any Clifford circuit can be transformed into a measurement-based protocol with the same fault-tolerant properties. To this protocol, we associate a chain complex which encodes the underlying decoding problem, generalizing previous cluster state complex constructions. Our method enables the construction of cluster states from non-CSS, subsystem, and Floquet codes, as well as from logical Clifford operations on a given code.
We introduce a family of scalable planar fault-tolerant circuits that implement logical non-Clifford operations on a 2D color code, such as a logical T gate or a logical non-Pauli measurement that prepares a magic | T ⟩ state. The circuits are relatively simple, consisting only of physical T gates, C X gates, and few-qubit measurements. They can be implemented with an array of qubits on a 2D chip with nearest-neighbor couplings and no wire crossings. The construction is based on a spacetime path integral representation of a non-Abelian 2+1D topological phase, which is related to the 3D color code. We turn the path integral into a circuit by expressing it as a spacetime Z X tensor network and then traversing it in some chosen time direction. We describe in detail how fault tolerance is achieved using a “just-in-time” decoding strategy, for which we repurpose and extend state-of-the-art color-code matching decoders.
Quantum error correction protocols protect against local errors by storing logical information non-locally. This poses a challenge: how to design efficient logical gates on the non-local ``hidden'' logical information, and how to implement these gates using the local physical operations. We develop a general description of planar Pauli stabilizer codes and protocols for logical operations in terms of point-like particles called Majorana fermions. Information is stored in the pairwise fermion parities of spatially separated Majorana fermions. The description in terms of Majorana fermions captures not only large distance asymptotics, but also all scales down to the lattice constants. We exploit this locality to densely pack logical information in spacetime. The simplest application is to a static case: dense memory. More importantly, we implement fault-tolerant Majorana motion and leverage this primitive to design braiding-based logical gates. This approach reduces space overhead of logical operations resulting in an improved logical error rate given fixed number of physical qubits. We illustrate a practical use of our approach by designing and benchmarking of 2-qubit Clifford gates. We find numerically that our protocol outperforms lattice surgery in this setting for near-term error rates and realistic device constraints. More generally, introduction of compact motion of Majorana fermions as an efficient computational primitive opens a promising new route for the design of low overhead error correction protocols.
Quantum error correction (QEC) represents a critical enabler for fault-tolerant quantum computing, protecting fragile quantum states from decoherence and operational errors. This paper provides a comprehensive analysis of leading quantum error correction schemes, focusing on surface codes and topological codes within the context of Noisy Intermediate-Scale Quantum (NISQ) era processors. We examine the theoretical foundations of stabilizer codes, compare surface code implementations with code distances ranging from d=3 to d=17, and analyze topological codes including toric codes and color codes. Our investigation encompasses syndrome extraction circuits, logical qubit encoding strategies, and threshold analysis for contemporary quantum hardware platforms. Performance metrics reveal that surface codes achieve error thresholds of approximately 1% with realistic noise models, while topological codes offer architectural advantages for specific qubit connectivity constraints. We discuss implementation challenges on current NISQ processors including IBM Quantum, Google Sycamore, and IonQ systems, addressing qubit overhead, gate fidelity requirements, and decoding algorithms. This analysis provides insights for selecting appropriate error correction schemes based on application requirements and hardware capabilities.
Quantum error correction (QEC) protects quantum systems against inevitable noises and control inaccuracies, providing a pathway toward fault-tolerant (FT) quantum computation. Stabilizer codes, including surface code and color code, have long been the focus of research and have seen significant experimental progress in recent years. Recently proposed time-dynamical QEC, including Floquet codes and generalized time-dynamical code implementations, opens up new opportunities for FT quantum computation. By employing a periodic schedule of low-weight parity checks, Floquet codes can generate additional dynamical logical qubits, offering enhanced error correction capabilities and, potentially, higher code performance. Here, we experimentally implement the Floquet-Bacon-Shor code on a superconducting quantum processor. We encode a dynamical logical qubit within a 3×3 lattice of data qubits alongside a conventional static logical qubit. We demonstrate FT encoding and measurement of the two-qubit logical states and stabilize these states using repeated error detection. We showcase universal single-qubit logical gates on the dynamical qubit. Furthermore, by implementing a logical controlled-not (cnot) gate, we entangle the dynamical and static logical qubits, generating an error-detected logical Bell state with a fidelity of 75.9%. Our results highlight the potential of Floquet codes for resource-efficient FT quantum computation.