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:2505.01370

Engineering CSS surgery: compiling any CNOT in any code

Clément Poirson, Joschka Roffe, Robert I. Booth

Published May 2, 2025• 13 citations
arXivHTMLPDF

Abstract

We introduce a framework for implementing logic in CSS quantum error correction codes, building on the surgery methods of Cowtan and Burton [CB24]. Our approach offers a systematic methodology for designing and analysing surgery protocols. At the physical level, we introduce the concept of subcodes, which encapsulate all the necessary data for performing surgery. At the logical level, leveraging homological algebra, subcodes enable us to track the logical operations induced by any surgery protocol, regardless of the choice of logical operator basis. In particular, we make no assumptions on the structure of the logical operators of the code. As a proof of concept, we develop a surgery protocol inspired by lattice surgery that implements a logical CNOT gate between any two logical qubits of any CSS code, with fault-tolerance guarantees.

DOI
10.48550/arxiv.2505.01370

Related papers

Exploiting Movable Logical Qubits for Lattice Surgery Compilation

Laura S. Herzog, Lucas Berent, Aleksander Kubica +1 more

Lattice surgery with two-dimensional quantum error correcting codes is among the leading schemes for fault-tolerant quantum computation, motivated by superconducting hardware architectures. In conventional lattice surgery compilation schemes, logical circuits are compiled following a place-and-route paradigm, where logical qubits remain statically fixed in space throughout the computation. In this work, we introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate. Focusing on lattice surgery with the color code, we propose a proof-of-concept compilation scheme that leverages this capability. Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth compared to standard place-and-route compilation techniques. Our results demonstrate that optimizations based on movable logical qubits are not limited to architectures with physically movable qubits, such as neutral atoms or trapped ions - they are also readily applicable to superconducting quantum hardware. An open-source implementation of our method is available on GitHub https://github.com/munich-quantum-toolkit/qecc.

quant-pharXiv:2512.04169•ACM/IEEE Design Automation Conference (DAC)•Dec 5, 2025•6 citations

Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction

Junichi Haruna

The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.

hep-thCross-listedarXiv:2511.15224•Progress of Theoretical and Experimental Physics•Nov 20, 2025•4 citations

Three Sheets, One Architecture: Inter-Sheet Logical Gates for K=4 Quantum Error Correction

Raghu Kulkarni

Abstract We present a CSS quantum error correcting code on the Face-Centered Cubic (FCC) lattice that combines surface-code-compatible K=4 connectivity with native inter-sheet logical gates between co-located CSS code blocks — a combination not previously achieved among well-studied codes. The construction has two parts. First, restricting the [[3L³, 2L³+2, 3]] FCC lattice code to a single triad sheet yields the sheet code with parameters [[L³, 2L, L]] at even L (or [[L³, L, L]] as a planar variant), uniform weight-4 stabilizers, and K=4 per-qubit connectivity. Three triad sheets share the FCC lattice geometry and can be deployed in one of three ways — monolithic 2D for small L, a three-layer stacked architecture for scalable deployment, or native 3D hardware — in each case encoding 6L logical qubits at distance L. Second, we introduce a fault-tolerant lattice surgery protocol that uses local FCC triangle measurements to implement joint Pauli measurements between logical qubits in different sheets. Each surgery operation adds O(L) two-qubit gates to the O(L³) per-round syndrome extraction cost. Under circuit-level depolarizing noise with MWPM decoding, the static memory threshold is p_th ≈ 0.63% and the surgery threshold is p_th ≈ 0.5%, both above the operating range of current quantum processors. Compared to surface code lattice surgery (also K=4, lattice surgery confined within a single patch), the sheet code provides 2L logicals per sheet at the same distance and connectivity; compared to bivariate bicycle codes (which target inter-block gates between physically separated modules at K=6 with long-range couplers), the sheet code achieves inter-sheet gates at K=4 with only short-range couplings between co-located sheets.

•Jun 19, 2026•0 citations

Lattice Surgery Compilation Beyond the Surface Code

Laura S. Herzog, Lucas Berent, Aleksander Kubica +1 more

Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge has mostly focused on the surface code and lattice surgery schemes. In this work, we broaden the scope by considering lattice surgery compilation for topological codes beyond the surface code. We begin by defining a code substrate-a blueprint for implementing topological codes and lattice surgery. We then abstract from the microscopic details and rephrase the compilation task as a mapping and routing problem on a macroscopic routing graph, potentially subject to substrate-specific constraints. We explore specific substrates and codes, including the color code and the folded surface code, providing detailed microscopic constructions. For the color code, we present numerical simulations analyzing how design choices at the microscopic and macroscopic levels affect the depth of compiled logical CNOT + T circuits. An opensource code is available on GitHub https://github.com/cda-tum/mqt-qecc.

arXiv:2504.10591•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•12 citations

From Syndromes to Computation: A General Framework for Logical Operations in Quantum Error-Correcting Codes

Hunter Nelson, Arshag Danageozian, ChunJun Cao +2 more

Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of $\lceil d/2\rceil$ for distance-$d$ codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed $T$ gate on the $[[16,4,4]]$ BB code, $T$-type rotations on the $[[64,8,8]]$ BB code, and CCZ-, CS-, and $T$-type operations on the $[[36,6,6]]$ Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields C${}^r$Z gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.

quant-pharXiv:2610.17612•Oct 14, 2026•0 citations

Transversal diagonal logical operators for stabiliser codes

Mark A Webster, Armanda O. Quintavalle, Stephen D. Bartlett

Abstract Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be implemented on Calderbank-Shor-Steane (CSS) codes, a commonly-studied category of codes, by applying a series of physical Pauli X and Z gates. Logical operators of this form are fault-tolerant because each qubit is acted upon by at most one gate, limiting the spread of errors, and are referred to as transversal logical operators. Identifying transversal logical operators outside the Pauli group is less well understood. Pauli operators are the first level of the Clifford hierarchy which is deeply connected to fault-tolerance and universality. In this work, we study transversal logical operators composed of single- and multi-qubit diagonal Clifford hierarchy gates. We demonstrate algorithms for identifying all transversal diagonal logical operators on a CSS code that are more general or have lower computational complexity than previous methods. We also show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates. Our methods rely on representing operators composed of diagonal Clifford hierarchy gates as diagonal XP operators and this technique may have broader applications.

arXiv:2303.15615•New Journal of Physics•Sep 22, 2023•21 citations
We introduce a framework for implementing logic in CSS quantum error correction codes, building on the surgery methods of Cowtan and Burton [CB24]. Our approach offers a systematic methodology for designing and analysing surgery protocols. At the physical level, we introduce the concept of subcodes, which encapsulate all the necessary data for performing surgery. At the logical level, leveraging homological algebra, subcodes enable us to track the logical operations induced by any surgery protocol, regardless of the choice of logical operator basis. In particular, we make no assumptions on the structure of the logical operators of the code. As a proof of concept, we develop a surgery protocol inspired by lattice surgery that implements a logical CNOT gate between any two logical qubits of any CSS code, with fault-tolerance guarantees.
Lattice surgery with two-dimensional quantum error correcting codes is among the leading schemes for fault-tolerant quantum computation, motivated by superconducting hardware architectures. In conventional lattice surgery compilation schemes, logical circuits are compiled following a place-and-route paradigm, where logical qubits remain statically fixed in space throughout the computation. In this work, we introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate. Focusing on lattice surgery with the color code, we propose a proof-of-concept compilation scheme that leverages this capability. Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth compared to standard place-and-route compilation techniques. Our results demonstrate that optimizations based on movable logical qubits are not limited to architectures with physically movable qubits, such as neutral atoms or trapped ions - they are also readily applicable to superconducting quantum hardware. An open-source implementation of our method is available on GitHub https://github.com/munich-quantum-toolkit/qecc.
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.
Abstract We present a CSS quantum error correcting code on the Face-Centered Cubic (FCC) lattice that combines surface-code-compatible K=4 connectivity with native inter-sheet logical gates between co-located CSS code blocks — a combination not previously achieved among well-studied codes. The construction has two parts. First, restricting the [[3L³, 2L³+2, 3]] FCC lattice code to a single triad sheet yields the sheet code with parameters [[L³, 2L, L]] at even L (or [[L³, L, L]] as a planar variant), uniform weight-4 stabilizers, and K=4 per-qubit connectivity. Three triad sheets share the FCC lattice geometry and can be deployed in one of three ways — monolithic 2D for small L, a three-layer stacked architecture for scalable deployment, or native 3D hardware — in each case encoding 6L logical qubits at distance L. Second, we introduce a fault-tolerant lattice surgery protocol that uses local FCC triangle measurements to implement joint Pauli measurements between logical qubits in different sheets. Each surgery operation adds O(L) two-qubit gates to the O(L³) per-round syndrome extraction cost. Under circuit-level depolarizing noise with MWPM decoding, the static memory threshold is p_th ≈ 0.63% and the surgery threshold is p_th ≈ 0.5%, both above the operating range of current quantum processors. Compared to surface code lattice surgery (also K=4, lattice surgery confined within a single patch), the sheet code provides 2L logicals per sheet at the same distance and connectivity; compared to bivariate bicycle codes (which target inter-block gates between physically separated modules at K=6 with long-range couplers), the sheet code achieves inter-sheet gates at K=4 with only short-range couplings between co-located sheets.
Large-scale fault-tolerant quantum computation requires compiling logical circuits into physical operations tailored to a given architecture. Prior work addressing this challenge has mostly focused on the surface code and lattice surgery schemes. In this work, we broaden the scope by considering lattice surgery compilation for topological codes beyond the surface code. We begin by defining a code substrate-a blueprint for implementing topological codes and lattice surgery. We then abstract from the microscopic details and rephrase the compilation task as a mapping and routing problem on a macroscopic routing graph, potentially subject to substrate-specific constraints. We explore specific substrates and codes, including the color code and the folded surface code, providing detailed microscopic constructions. For the color code, we present numerical simulations analyzing how design choices at the microscopic and macroscopic levels affect the depth of compiled logical CNOT + T circuits. An opensource code is available on GitHub https://github.com/cda-tum/mqt-qecc.
Fault-tolerant quantum computation requires error-correcting codes that not only protect quantum information but also support useful logical operations with practical physical realizations. Here we develop a general framework in which the stabilizer syndromes of commuting Pauli rotations directly organize logical-gate design. We derive an exact codespace-preservation condition valid at arbitrary rotation angles, providing a common stabilizer-level description for CSS and non-CSS codes and for both Clifford and non-Clifford operations. A particularly useful equal-syndrome specialization reduces Clifford gate design to stabilizer factorization, yields a general generator weight bound of ⌈d/2⌉\lceil d/2\rceil⌈d/2⌉ for distance-ddd codes, and systematically extends to logical rotations higher in the Clifford hierarchy. Applied to bivariate-bicycle (BB) and non-CSS Mirror qLDPC codes, the framework gives explicit low-weight Clifford and controlled-phase gates. Our implementations yield new low-weight gates, including an addressed TTT gate on the [[16,4,4]][[16,4,4]][[16,4,4]] BB code, TTT-type rotations on the [[64,8,8]][[64,8,8]][[64,8,8]] BB code, and CCZ-, CS-, and TTT-type operations on the [[36,6,6]][[36,6,6]][[36,6,6]] Mirror code. We also develop analytic constructions using Clifford algebra bases, which turn the syndrome constraints into explicit algebraic relations and provide a systematic route to logical addressability. We use this approach to analytically construct addressed CNOT, SWAP, controlled, and CCZ-type gates on recursive hypercube codes. An independent construction on middle quantum Reed--Muller codes yields Cr{}^rrZ gates that saturate the equal-syndrome weight bound. These results establish stabilizer syndromes as a constructive link between the stabilizer structure of a quantum code, the logical computations it can directly support, and the fault-tolerance properties of their physical realizations.
Abstract Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be implemented on Calderbank-Shor-Steane (CSS) codes, a commonly-studied category of codes, by applying a series of physical Pauli X and Z gates. Logical operators of this form are fault-tolerant because each qubit is acted upon by at most one gate, limiting the spread of errors, and are referred to as transversal logical operators. Identifying transversal logical operators outside the Pauli group is less well understood. Pauli operators are the first level of the Clifford hierarchy which is deeply connected to fault-tolerance and universality. In this work, we study transversal logical operators composed of single- and multi-qubit diagonal Clifford hierarchy gates. We demonstrate algorithms for identifying all transversal diagonal logical operators on a CSS code that are more general or have lower computational complexity than previous methods. We also show a method for constructing CSS codes that have a desired diagonal logical Clifford hierarchy operator implemented using single qubit phase gates. Our methods rely on representing operators composed of diagonal Clifford hierarchy gates as diagonal XP operators and this technique may have broader applications.