Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus

• URL: http://arxiv.org/abs/2606.02542v1
• Date: Mon, 01 Jun 2026 17:46:09 GMT
• Title: Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus
• Abstract summary: 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.
• Score: 37.09090127609627
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The ZX-calculus is a powerful graphical language for manipulating quantum circuits, which has recently found many applications in quantum error correction. We extend this language to handle Floquet and other dynamical stabilizer codes via the connection between measurement-based code switching and gauge fixing (arXiv:1810.10037). We combine gauge-fixing steps to implement a closed loop in the space of stabilizer codes, returning to the original codespace up to a logical Clifford gate. These measurement-based paths in the space of stabilizer codes can be viewed as shortcuts, or "chutes and ladders", relative to single-qubit Clifford operations and qubit permutations. This yields a machine-interpretable method for constructing dynamical automorphisms and facilitates the search for implementations of desired logical gates. As an example, we implement a logical phase gate via distance-preserving code switching for the seven-qubit code bare code (arXiv:1702.01155), which has no non-trivial logical Clifford gates based on single-qubit Clifford operations and qubit permutations (arXiv:2409.18175).

Related papers

• Surface code logical operations on a superconducting quantum processor [66.1042398805403]
  We experimentally realize key elements of patch-based surface-code logical processing on a 107-qubit superconducting quantum processor.<n>Our results advance superconducting surface-code experiments from protected logical memory to active, patch-based fault-tolerant logical operations.
  arXiv  Detail & Related papers  (2026-07-01T21:07:02Z)
• 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)
• Hardware-tailored logical Clifford circuits for stabilizer codes [1.2116854758481392]
  Quantum error correction is the art of protecting fragile quantum information.<n>It is notoriously difficult to manipulate encoded quantum data without introducing uncorrectable errors.<n>We introduce a mathematical framework for constructing hardware-tailored quantum circuits.
  arXiv  Detail & Related papers  (2025-05-26T17:40:52Z)
• 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)
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes [3.058685580689604]
  We present a measurement-free code-switching protocol for universal quantum teleportation, a stabiliser code for Cliffords and a permutation-invariant code for non-Cliffords.<n>Non-Clifford gates enabled by this code-switching protocol provide for a lower gate count implementation of a universal gate set relative to the Clifford$+T$ gate set.<n>We also present a new class of PI codes with tunable code distance, supporting non-Clifford gates.
  arXiv  Detail & Related papers  (2024-11-20T09:16:07Z)
• Fault-Tolerant Logical Clifford Gates from Code Automorphisms [2.7262923206583136]
  We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries.<n>Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group, and impose constraints based on the Clifford operators permitted.
  arXiv  Detail & Related papers  (2024-09-26T18:00:00Z)
• Improved QLDPC Surgery: Logical Measurements and Bridging Codes [0.957656843920191]
  We introduce the gauge-fixed QLDPC surgery scheme, an improved logical measurement scheme based on the construction of Cohen et al.<n>In certain cases, we only require $Theta(w)$ ancilla qubits to fault-tolerantly measure a weight $w$ logical operator.<n>We present a modular decoding algorithm that achieves maximal fault-distance.
  arXiv  Detail & Related papers  (2024-07-25T20:55:24Z)
• A High Performance Compiler for Very Large Scale Surface Code Computations [38.26470870650882]
  We present the first high performance compiler for very large scale quantum error correction. It translates an arbitrary quantum circuit to surface code operations based on lattice surgery. The compiler can process millions of gates using a streaming pipeline at a speed geared towards real-time operation of a physical device.
  arXiv  Detail & Related papers  (2023-02-05T19:06:49Z)
• 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)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)

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.