Topological error correcting processes from fixed-point path integrals

• URL: http://arxiv.org/abs/2303.16405v3
• Date: Tue, 12 Mar 2024 21:28:11 GMT
• Title: Topological error correcting processes from fixed-point path integrals
• Authors: Andreas Bauer
• Abstract summary: We analyze and construct topological quantum error correcting codes as dynamical circuits of geometrically local channels and measurements. We derive two new error-correcting codes, namely a Floquet version of the $3+1$-dimensional toric code using only 2-body measurements, and a dynamic code based on the double-semion string-net path integral.
• Score: 0.7873629568804646
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We propose a unifying paradigm for analyzing and constructing topological quantum error correcting codes as dynamical circuits of geometrically local channels and measurements. To this end, we relate such circuits to discrete fixed-point path integrals in Euclidean spacetime, which describe the underlying topological order: If we fix a history of measurement outcomes, we obtain a fixed-point path integral carrying a pattern of topological defects. As an example, we show that the stabilizer toric code, subsystem toric code, and CSS Floquet code can be viewed as one and the same code on different spacetime lattices, and the honeycomb Floquet code is equivalent to the CSS Floquet code under a change of basis. We also use our formalism to derive two new error-correcting codes, namely a Floquet version of the $3+1$-dimensional toric code using only 2-body measurements, as well as a dynamic code based on the double-semion string-net path integral.

Related papers

• The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime [1.453022747359034]
  We present a formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code. We benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments.
  arXiv  Detail & Related papers  (2024-07-11T14:56:26Z)
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases [0.7873629568804646]
  We propose a family of explicit geometrically local circuits on a 2-dimensional planar grid of qudits. These circuits are constructed from measuring 1-form symmetries in discrete fixed-point path integrals. We prove fault tolerance under arbitrary local (including non-Pauli) noise for a very general class of topological circuits.
  arXiv  Detail & Related papers  (2024-03-18T18:00:00Z)
• Error Correction in Dynamical Codes [1.6317061277457001]
  We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. We develop an algorithm that tracks information about the error syndromes through the protocol and put that together to determine the distance of a dynamical code.
  arXiv  Detail & Related papers  (2024-03-07T02:47:21Z)
• Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code [0.0]
  Non-orientable geometry provides a new way the emergent symmetry acts on the code space. We find that the dynamics of the honeycomb Floquet code is precisely described by a condensation operator of the $mathbbZ$ gauge theory.
  arXiv  Detail & Related papers  (2023-10-10T18:12:56Z)
• Measurement Quantum Cellular Automata and Anomalies in Floquet Codes [3.1170271760249806]
  We investigate the evolution of quantum information under Pauli measurement circuits. We define local reversibility in context of measurement circuits. We prove that the Hastings-Haah honeycomb code belongs to a class with such obstruction.
  arXiv  Detail & Related papers  (2023-04-03T18:10:59Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Quantum Error Correction with Gauge Symmetries [69.02115180674885]
  Quantum simulations of Lattice Gauge Theories (LGTs) are often formulated on an enlarged Hilbert space containing both physical and unphysical sectors. We provide simple fault-tolerant procedures that exploit such redundancy by combining a phase flip error correction code with the Gauss' law constraint.
  arXiv  Detail & Related papers  (2021-12-09T19:29:34Z)
• Surface Code Design for Asymmetric Error Channels [55.41644538483948]
  We introduce a surface code design based on the fact that bit flip and phase flip errors in quantum systems are asymmetric. We show that, compared to symmetric surface codes, our asymmetric surface codes can provide almost double the pseudo-threshold rates. As the asymmetry of the surface code increases, the advantage in the pseudo-threshold rates begins to saturate for any degree of asymmetry in the channel.
  arXiv  Detail & Related papers  (2021-11-02T10:41:02Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)
• Cellular automaton decoders for topological quantum codes with noisy measurements and beyond [68.8204255655161]
  We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes. For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold. We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
  arXiv  Detail & Related papers  (2020-04-15T18: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.