Dynamical quantum codes and logic gates on a lattice with sparse connectivity

• URL: http://arxiv.org/abs/2510.05225v2
• Date: Fri, 31 Oct 2025 15:22:28 GMT
• Title: Dynamical quantum codes and logic gates on a lattice with sparse connectivity
• Authors: Dominic J. Williamson, Bence Hetényi,
• Abstract summary: We first review examples of Floquet codes and their implementation with nearest-neighbor gates and ancillary qubits.<n>We then show how switching between the color code and a pair of Floquet codes, via a depth-two circuit followed by mid-circuit measurement, can be used to perform syndrome extraction for the color code.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce several dynamical schemes that take advantage of mid-circuit measurement and nearest-neighbor gates on a lattice with maximum vertex degree three to implement topological codes and perform logic gates between them. We first review examples of Floquet codes and their implementation with nearest-neighbor gates and ancillary qubits. Next, we describe implementations of these Floquet codes that make use of the ancillary qubits to reset all qubits every measurement cycle. We then show how switching the role of data and ancilla qubits allows a pair of Floquet codes to be implemented simultaneously. We describe how to perform a logical Clifford gate to entangle a pair of Floquet codes that are implemented in this way. Finally, we show how switching between the color code and a pair of Floquet codes, via a depth-two circuit followed by mid-circuit measurement, can be used to perform syndrome extraction for the color code.

Related papers

• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• Logical gates on Floquet codes via folds and twists [45.88028371034407]
  We show how two techniques from static quantum error-correcting codes can be implemented on Floquet codes.<n>First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates.<n>Second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists.
  arXiv  Detail & Related papers  (2025-12-19T19:00:06Z)
• Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
  In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
  arXiv  Detail & Related papers  (2024-10-10T04:07:24Z)
• Engineering 3D Floquet codes by rewinding [0.0]
  Floquet codes are quantum error-correcting codes with dynamically generated logical qubits. We utilize the interpretation of measurements in terms of condensation of topological excitations. We show that rewinding is advantageous for obtaining a desired set of instantaneous stabilizer groups.
  arXiv  Detail & Related papers  (2023-07-25T17:27:40Z)
• Floquetifying the Colour Code [0.0]
  We use the ZX-calculus to create new Floquet codes that are in a definable sense equivalent to known stabilizer codes. This work shines a light on the relationship between'static' stabilizer and subsystem codes and 'dynamic' Floquet codes.
  arXiv  Detail & Related papers  (2023-07-20T17:01:16Z)
• 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)
• Implementing Clifford Gates on Stabilizer Codes via Measurement [0.0]
  We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code.<n>In subsystem stabilizer codes of distance at least $3$ the process can be implemented fault-tolerantly.<n>This is an alternative to the method proposed by [Paetznick and Reichardt, 2013] to generate a set of gates which is universal for quantum computing for this code.
  arXiv  Detail & Related papers  (2022-10-25T14:56:31Z)
• Encoding qubits in multimode grid states [0.0]
  We propose to encode logical qubits in grid states of an ensemble of harmonic oscillator modes. We show numerically that multimode grid codes have, compared to their single-mode counterpart, increased robustness against propagation of errors. We highlight some interesting links between multidimensional lattices and single-mode grid codesd with qubit codes.
  arXiv  Detail & Related papers  (2022-01-28T18:58:21Z)
• Engineering, control and longitudinal readout of Floquet qubits [105.9098786966493]
  Time-periodic Hamiltonians can be exploited to increase the dephasing time of qubits and to design protected one and two-qubit gates. Here, we use the framework of many-mode Floquet theory to describe approaches to robustly control Floquet qubits in the presence of multiple drive tones. Following the same approach, we introduce a longitudinal readout protocol to measure the Floquet qubit without the need of first adiabatically mapping back the Floquet states to the static qubit states.
  arXiv  Detail & Related papers  (2021-08-25T14:35:02Z)
• 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)
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes [63.62764375279861]
  We compare two leading FT implementations of the T gate in 2D color codes under circuit noise. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting.
  arXiv  Detail & Related papers  (2021-01-06T19:00:01Z)

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.