Cylindrical and Möbius Quantum Codes for Asymmetric Pauli Errors

• URL: http://arxiv.org/abs/2502.19089v1
• Date: Wed, 26 Feb 2025 12:34:33 GMT
• Title: Cylindrical and Möbius Quantum Codes for Asymmetric Pauli Errors
• Authors: Lorenzo Valentini, Diego Forlivesi, Marco Chiani,
• Abstract summary: In quantum information systems, one type of Pauli error, such as phase-flip errors, may occur more frequently than others, like bit-flip errors.<n>For this reason, quantum error-correcting codes that handle asymmetric errors are critical to mitigating the impact of such impairments.<n>These include variants of surface codes like the XZZX and ZZZY surface codes, tailored to preserve quantum information in the presence of error asymmetries.
• Score: 8.62986288837424
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the implementation of quantum information systems, one type of Pauli error, such as phase-flip errors, may occur more frequently than others, like bit-flip errors. For this reason, quantum error-correcting codes that handle asymmetric errors are critical to mitigating the impact of such impairments. To this aim, several asymmetric quantum codes have been proposed. These include variants of surface codes like the XZZX and ZZZY surface codes, tailored to preserve quantum information in the presence of error asymmetries. In this work, we propose two classes of Calderbank, Shor and Steane (CSS) topological codes, referred to as cylindrical and M\"obius codes, particular cases of the fiber bundle family. Cylindrical codes maintain a fully planar structure, while M\"obius codes are quasi-planar, with minimal non-local qubit interactions. We construct these codes employing the algebraic chain complexes formalism, providing theoretical upper bounds for the logical error rate. Our results demonstrate that cylindrical and M\"obius codes outperform standard surface codes when using the minimum weight perfect matching (MWPM) decoder.

Related papers

• Existence and Characterisation of Coprime Bivariate Bicycle Codes [0.0]
  One of the holy grails of quantum error correction (QEC) codes is to construct codes with minimumally good parameters.<n>BB codes have emerged as a promising candidate for such compact memory.<n>In this Article, we explore these parameters by focusing on the subclass of coprime BB codes.
  arXiv  Detail & Related papers  (2025-02-24T11:04:15Z)
• 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)
• Linear-optical quantum computation with arbitrary error-correcting codes [0.0]
  High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers. We provide a linear-optical architecture with these properties, compatible with arbitrary codes and Gottesman-Kitaev-Preskill qubits on generic lattices.
  arXiv  Detail & Related papers  (2024-08-07T23:23:28Z)
• A family of permutationally invariant quantum codes [54.835469342984354]
  We show that codes in the new family correct quantum deletion errors as well as spontaneous decay errors. Our construction contains some of the previously known permutationally invariant quantum codes. For small $t$, these conditions can be used to construct new examples of codes by computer.
  arXiv  Detail & Related papers  (2023-10-09T02:37:23Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• 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)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• 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)
• Short Codes for Quantum Channels with One Prevalent Pauli Error Type [6.548580592686076]
  We investigate the design of stabilizer QECC able to correct a given number eg of generic Pauli errors, plus eZ Pauli errors of a specified type. These codes can be of interest when the quantum channel is asymmetric in that some types of error occur more frequently than others.
  arXiv  Detail & Related papers  (2021-04-09T13:51:51Z)
• Constructing quantum codes from any classical code and their embedding in ground space of local Hamiltonians [7.092674229752723]
  We introduce a framework that takes it any classical code and explicitly constructs the corresponding QEC code. A concrete advantage is that the desirable properties of a classical code are automatically incorporated in the design of the resulting quantum code.
  arXiv  Detail & Related papers  (2020-12-02T19:00:19Z)
• Trade-offs on number and phase shift resilience in bosonic quantum codes [10.66048003460524]
  One quantum error correction solution is to encode quantum information into one or more bosonic modes. We show that by using arbitrarily many modes, $g$-gapped multi-mode codes can yield good approximate quantum error correction codes.
  arXiv  Detail & Related papers  (2020-08-28T10:44:34Z)

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.