Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise

• URL: http://arxiv.org/abs/2110.11510v1
• Date: Thu, 21 Oct 2021 22:45:51 GMT
• Title: Local-dimension-invariant Calderbank-Shor-Steane Codes with an Improved Distance Promise
• Authors: Arun J. Moorthy, Lane G. Gunderman
• Abstract summary: We prove how to construct codes with parameters $[2N,2N-1-2N,geq 3]]_q$ for any choice of prime $q$ and natural number $N$. This is accomplished using the technique of local-dimension-invariant (LDI) codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computers will need effective error-correcting codes. Current quantum processors require precise control of each particle, so having fewer particles to control might be beneficial. Although traditionally quantum computers are considered as using qubits (2-level systems), qudits (systems with more than 2-levels) are appealing since they can have an equivalent computational space using fewer particles, meaning fewer particles need to be controlled. In this work we prove how to construct codes with parameters $[[2^N,2^N-1-2N,\geq 3]]_q$ for any choice of prime $q$ and natural number $N$. This is accomplished using the technique of local-dimension-invariant (LDI) codes. Generally LDI codes have the drawback of needing large local-dimensions to ensure the distance is at least preserved, and so this work also reduces this requirement by utilizing the structure of CSS codes, allowing for the aforementioned code family to be imported for any local-dimension choice.

Related papers

• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions [0.0]
  In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance-$2$ stabilizer subsystem codes we call trapezoid codes'' We identify a family of codes achieving the maximum code rate, and by slightly relaxing this constraint, uncover a broader range of codes with enhanced physical locality.
  arXiv  Detail & Related papers  (2024-12-09T18:36:38Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• 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)
• Flag Proxy Networks: Tackling the Architectural, Scheduling, and Decoding Obstacles of Quantum LDPC codes [1.870400753080051]
  In this paper, we consider two under-studied families of QLDPC codes: hyperbolic surface codes and hyperbolic color codes. degree-4 FPNs of the hyperbolic surface and color codes are respectively $2.9times$ and $5.5times$ more space-efficient than the $d = 5$ planar surface code. The hyperbolic codes also have error rates comparable to their planar counterparts.
  arXiv  Detail & Related papers  (2024-09-22T01:08:58Z)
• SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
  We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes. Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes. We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
  arXiv  Detail & Related papers  (2024-07-12T16:50:01Z)
• 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)
• Improved rate-distance trade-offs for quantum codes with restricted connectivity [34.95121779484252]
  We study how the connectivity graph associated with a quantum code constrains the code parameters. We establish a tighter dimension-distance trade-off as a function of the size of separators in the connectivity graph.
  arXiv  Detail & Related papers  (2023-07-06T20:38:34Z)
• 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)
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding [5.5165579223151795]
  We use QLDPC codes to distill GHZ states, as the resulting high-fidelity logical GHZ states can interact directly with the code used to perform distributed quantum computing. Our results apply to larger size GHZ states as well, where we extend our technical result about a measurement property of $3$-qubit GHZ states to construct a scalable GHZ purification protocol.
  arXiv  Detail & Related papers  (2022-10-25T16:42:32Z)
• Degenerate Local-dimension-invariant Stabilizer Codes and an Alternative Bound for the Distance Preservation Condition [0.0]
  We show that degenerate stabilizer codes can have their distance promised upon sufficiently large local-dimension. New bound on the local-dimension required to preserve the distance of local-dimension-invariant codes could be useful for error-corrected qudit quantum computers.
  arXiv  Detail & Related papers  (2021-10-28T16:36:04Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.