The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime

• URL: http://arxiv.org/abs/2407.08566v1
• Date: Thu, 11 Jul 2024 14:56:26 GMT
• Title: The XYZ ruby code: Making a case for a three-colored graphical calculus for quantum error correction in spacetime
• Authors: Julio C. Magdalena de la Fuente, Josias Old, Alex Townsend-Teague, Manuel Rispler, Jens Eisert, Markus Müller,
• Abstract summary: 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.
• Score: 1.453022747359034
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Analyzing and developing new quantum error-correcting schemes is one of the most prominent tasks in quantum computing research. In such efforts, introducing time dynamics explicitly in both analysis and design of error-correcting protocols constitutes an important cornerstone. In this work, we present a graphical formalism based on tensor networks to capture the logical action and error-correcting capabilities of any Clifford circuit with Pauli measurements. We showcase the formalism on new Floquet codes derived from topological subsystem codes, which we call XYZ ruby codes. Based on the projective symmetries of the building blocks of the tensor network we develop a framework of Pauli flows. Pauli flows allow for a graphical understanding of all quantities entering an error correction analysis of a circuit, including different types of QEC experiments, such as memory and stability experiments. We lay out how to derive a well-defined decoding problem from the tensor network representation of a protocol and its Pauli flows alone, independent of any stabilizer code or fixed circuit. Importantly, this framework applies to all Clifford protocols and encompasses both measurement- and circuit-based approaches to fault tolerance. We apply our method to our new family of dynamical codes which are in the same topological phase as the 2+1d color code, making them a promising candidate for low-overhead logical gates. In contrast to its static counterpart, the dynamical protocol applies a Z3 automorphism to the logical Pauli group every three timesteps. We highlight some of its topological properties and comment on the anyon physics behind a planar layout. Lastly, we benchmark the performance of the XYZ ruby code on a torus by performing both memory and stability experiments and find competitive circuit-level noise thresholds of 0.18%, comparable with other Floquet codes and 2+1d color codes.

Related papers

• Belief propagation for general graphical models with loops [45.29832252085144]
  We develop a unified view to make the generalized BP proposal by Kirkley et. al explicit on arbitrary graphical models. We derive BP schemes and provide inference equations for BP on loopy tensor networks and, more generally, loopy graphical models. We show that the tensor network message passing approach relies essentially on the same approximation as the method by Kirkley.
  arXiv  Detail & Related papers  (2024-11-07T18:32:42Z)
• Dynamically generated concatenated codes and their phase diagrams [0.0]
  We formulate code concatenation as the action of a unitary quantum circuit on an expanding tree geometry. In the presence of bulk errors, the coding phase is a type of spin glass, characterized by a distribution of failure probabilities.
  arXiv  Detail & Related papers  (2024-09-20T17:51:50Z)
• Automatically Identifying Local and Global Circuits with Linear Computation Graphs [45.760716193942685]
  We introduce our circuit discovery pipeline with Sparse Autoencoders (SAEs) and a variant called Transcoders. Our methods do not require linear approximation to compute the causal effect of each node. We analyze three kinds of circuits in GPT-2 Small: bracket, induction, and Indirect Object Identification circuits.
  arXiv  Detail & Related papers  (2024-05-22T17:50:04Z)
• Robustness and measurement-induced percolation of the surface code [0.0]
  We examine the robustness of a logical qubit in the planar surface code subject to'measurement-errors', i.e., to local Pauli measurements at known positions. This yields a measurement-only dynamics, which is driven by the competition between local Pauli measurements and stabilizer measurements. We argue that the loss of the logical qubit in this setting can still be understood by percolation theory and underpin our arguments with numerical simulations.
  arXiv  Detail & Related papers  (2023-11-24T08:27:36Z)
• Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors [0.0]
  Top color codes are widely acknowledged as promising candidates for fault-tolerant quantum computing. Top color codes can provide a universal gate set $$H, T, C$$, with the T-gate missing in the T-dimensional and the H-gate in the three-dimensional case. We construct resource-optimized deterministic and non-deterministic code switching protocols for two- and three-dimensional distance-three color codes.
  arXiv  Detail & Related papers  (2023-06-30T14:16:52Z)
• Topological error correcting processes from fixed-point path integrals [0.7873629568804646]
  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.
  arXiv  Detail & Related papers  (2023-03-29T02:32:18Z)
• 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)
• Non-Pauli Errors in the Three-Dimensional Surface Code [0.0]
  We show that logical non-Clifford operations can map Pauli errors to non-Pauli (Clifford) errors. In particular, the emergence of linking charge is a local effect rather than a non-local one. We use the relative simplicity of Clifford errors in this setting to simulate their effect on the performance of a single-shot magic state preparation process.
  arXiv  Detail & Related papers  (2022-02-11T16:34:57Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)

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.