analiza aiqbench
This paper presents a scalable architecture for implementing logical non-Clifford gates on 2D color codes using simple physical operations without wire crossings. By leveraging spacetime path integrals and just-in-time decoding, the work offers a practical pathway toward fault-tolerant quantum computation with nearest-neighbor qubit connectivity. The approach significantly simplifies circuit design while maintaining high fidelity through advanced error correction strategies.
Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
arXiv:2505.05175v2 Announce Type: replace Abstract: 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\rangle$ state. The circuits are relatively simple, consisting only of physical $T$ gates, $CX$ 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 $ZX$ 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.
Abstract: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\rangle$ state. The circuits are relatively simple, consisting only of physical $T$ gates, $CX$ 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 $ZX$ 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 Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el)
arXiv:2505.05175 [quant-ph]
(or arXiv:2505.05175v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2505.05175 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1103/p7c9-x1m9 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 252 cuvinte
Subiecte conexe

Floquetifying stabiliser codes with distance-preserving rewrites
Quantum Journal · 3 sept. 2026

Pangaea Quantum Bus Cuts Required Qubits Tenfold on Superconducting Hardware
techtimes.com · 5 aug. 2026

Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
Quantum Journal · 10 sept. 2026

Simple logical quantum computation with concatenated symplectic double codes
Quantum Journal · 19 aug. 2026