Automated logical Clifford gadgets for heterogeneous architectures via chain maps

• URL: http://arxiv.org/abs/2607.02482v1
• Date: Thu, 02 Jul 2026 17:49:54 GMT
• Title: Automated logical Clifford gadgets for heterogeneous architectures via chain maps
• Abstract summary: We introduce an automated framework for synthesising inter-code CNOT circuits.<n>We benchmark this method on a range of heterogeneous CSS code pairs.<n>We show how our framework straightforwardly extends to targeted logical CZ gates.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Transversal CNOTs are ubiquitous for entangling logical qubits of identical CSS codes pairwise. For distinct codes, the options are much more limited, and are typically known only for structurally related code families. We introduce an automated framework for synthesising inter-code logical CNOT circuits between arbitrary CSS codes using chain maps. Given a prescribed bipartite logical CNOT network between these codes, our method constructs the affine space of chain maps realising the desired logical action, and then searches this space for shallow and sparse physical circuit candidates. We benchmark this method on a range of heterogeneous CSS code pairs, recovering known transversal constructions, and finding new low-depth solutions, including distance-preserving and partially distance-preserving examples, which we demonstrate can be promoted to the full code distance using additional flag measurements. We discuss applications to code switching, magic-state injection, Pauli product measurements, and operations on concatenated codes, where bespoke chain maps offer favourable spacetime tradeoffs for logical interfaces tailored to heterogeneous architectures. Finally, we show how our framework straightforwardly extends to targeted logical CZ gates.

Related papers

• Computing with qLDPC Codes by Climbing the Chain Map Hierarchy [0.0029410438275861584]
  We develop a framework for logical computation with qLDPC codes that places logical Pauli, Clifford, and non-Clifford operations on the same footing.<n>This brings the simple homological description of Pauli logicals to the patchwork landscape of logical Clifford and non-Clifford operations.
  arXiv  Detail & Related papers  (2026-09-02T18:00:00Z)
• Quantum Codes with Arbitrary Z-Rotation logical Gates and Applications to Fault-Tolerant Code Switching [0.0]
  We present the first demonstration of fault-tolerant code switching by means of code switching within a distance-three rotated surface code using a total footprint of only 45 physical qubits.<n>We also provide an overhead optimization protocol alongside several candidate codes tailored for realizing logical $Z$-rotation gates within rotated surface codes.
  arXiv  Detail & Related papers  (2026-08-11T17:17:51Z)
• Logical computation with canonical lifted product codes [3.653555716265332]
  Code-agnostic techniques such as code surgery and gate teleportation apply broadly, but are difficult to make modular, low-overhead, and fully certifiable on complex high-rate codes.<n>Here we overcome these obstacles by co-designing the code together with its logical instruction set for a broad family of emphcanonical lifted-product (LP) codes.<n>We show that these codes admit a emphcanonical logical basis, in which conjugate logical operators are organized into rows and columns of cyclic orbits inherited directly from the underlying classical codes.
  arXiv  Detail & Related papers  (2026-07-30T17:55:34Z)
• Quantum codes from classical annealing [0.15293427903448023]
  Search for quantum error-correcting codes with high encoding rates and large distances.<n>For block lengths of up to $50$ physical qubits, our search finds state-of-the-art CSS and SWEL codes.<n>Codes found in this work are promising candidates for high-rate code demonstrations on near-term quantum computing hardware.
  arXiv  Detail & Related papers  (2026-07-21T21:01:37Z)
• Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus [37.09090127609627]
  We use the ZX-calculus language to handle dynamical stabilizer codes.<n>We combine gauge-fixing steps to implement a closed loop in the space of stabilizer codes.<n>This yields a machine-interpretable method for constructing dynamical automorphisms.
  arXiv  Detail & Related papers  (2026-06-01T17:46:09Z)
• Constant-Overhead Addressable Gates via Single-Shot Code Switching [1.6822770693792826]
  It is a major challenge to perform addressable and parallel logical operations on constantrate quantum LDPC (qLDPC) codes.<n>We introduce fault-tolerant protocols for performing various addressable gadgets as well as parallel logical operations with constant space-time overhead.
  arXiv  Detail & Related papers  (2025-10-08T08:37:50Z)
• Fast correlated decoding of transversal logical algorithms [67.01652927671279]
  Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead.<n>Recent advances have shown that by jointly decoding logical qubits in algorithms composed of logical gates, the number of syndrome extraction rounds can be reduced.<n>Here, we reform the problem of decoding circuits by directly decoding relevant logical operator products as they propagate through the circuit.
  arXiv  Detail & Related papers  (2025-05-19T18:00:00Z)
• Targeted Clifford logical gates for hypergraph product codes [54.57204856880369]
  We first derive symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group.<n>This enables us to design explicit transformations that result in targeted logical gates for arbitrary codes in this family.
  arXiv  Detail & Related papers  (2024-11-26T02:32:44Z)
• Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
  We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes.<n>We present a formalism for addressable and parallel logical gates in LDPC codes viasymmetries.<n>As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
  arXiv  Detail & Related papers  (2024-11-24T14:01:37Z)
• Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding [62.25533750469467]
  Low-Density Parity-Check (LDPC) codes possess several advantages over other families of codes. The proposed approach is shown to outperform the decoding performance of existing popular codes by orders of magnitude.
  arXiv  Detail & Related papers  (2024-06-09T12:08:56Z)
• Homological Quantum Rotor Codes: Logical Qubits from Torsion [47.52324012811181]
  homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.<n>We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
  arXiv  Detail & Related papers  (2023-03-24T00:29:15Z)
• Hierarchical memories: Simulating quantum LDPC codes with local gates [0.016385815610837167]
  We construct a new family of $[[N,K,D]]$ codes, that encode a number of logical qubits $K = Omega(N/log(N)2)$.<n>The N-th element of this code family is obtained by concatenating a constant-rate quantum LDPC code with a surface code.<n>Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
  arXiv  Detail & Related papers  (2023-03-08T18:48:12Z)
• CSS code surgery as a universal construction [51.63482609748332]
  We define code maps between Calderbank-Shor-Steane (CSS) codes using maps between chain complexes. We describe code surgery between such codes using a specific colimit in the category of chain complexes.
  arXiv  Detail & Related papers  (2023-01-31T16:17:25Z)
• Towards Bi-directional Skip Connections in Encoder-Decoder Architectures and Beyond [95.46272735589648]
  We propose backward skip connections that bring decoded features back to the encoder. Our design can be jointly adopted with forward skip connections in any encoder-decoder architecture. We propose a novel two-phase Neural Architecture Search (NAS) algorithm, namely BiX-NAS, to search for the best multi-scale skip connections.
  arXiv  Detail & Related papers  (2022-03-11T01:38:52Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.