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
- 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) - Long-range-enhanced surface codes [0.0]
The surface code is a quantum error-correcting code for one logical qubit.
We show that storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits.
Long-range-enhanced surface codes outperform conventional surface codes using hundreds of physical qubits.
arXiv Detail & Related papers (2023-09-21T01:39:31Z) - 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) - Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code.
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) - 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) - Quantifying nonlocality: how outperforming local quantum codes is
expensive [0.06091702876917279]
Quantum low-density parity-check (LDPC) codes are a promising avenue to reduce the cost of constructing scalable quantum circuits.
We show that quantum LDPC codes implemented through local interactions obey restrictions on their dimension $k$ and distance $d$.
In particular, in 2D we show that a quantum LDPC with distance $n1/2 + epsilon$ code requires $Omega(n1/2 + epsilon)$ interactions of length $widetildeOmega(nepsilon)$.
arXiv Detail & Related papers (2021-09-22T18:55:45Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - 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.