Improved rate-distance trade-offs for quantum codes with restricted
connectivity
- URL: http://arxiv.org/abs/2307.03283v1
- Date: Thu, 6 Jul 2023 20:38:34 GMT
- Title: Improved rate-distance trade-offs for quantum codes with restricted
connectivity
- Authors: Nou\'edyn Baspin, Venkatesan Guruswami, Anirudh Krishna, Ray Li
- Abstract summary: 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.
- Score: 34.95121779484252
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: For quantum error-correcting codes to be realizable, it is important that the
qubits subject to the code constraints exhibit some form of limited
connectivity. The works of Bravyi & Terhal (BT) and Bravyi, Poulin & Terhal
(BPT) established that geometric locality constrains code properties -- for
instance $[[n,k,d]]$ quantum codes defined by local checks on the
$D$-dimensional lattice must obey $k d^{2/(D-1)} \le O(n)$. Baspin and Krishna
studied the more general question of how the connectivity graph associated with
a quantum code constrains the code parameters. These trade-offs apply to a
richer class of codes compared to the BPT and BT bounds, which only capture
geometrically-local codes. We extend and improve this work, establishing a
tighter dimension-distance trade-off as a function of the size of separators in
the connectivity graph. We also obtain a distance bound that covers all
stabilizer codes with a particular separation profile, rather than only LDPC
codes.
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) - Creating entangled logical qubits in the heavy-hex lattice with topological codes [0.0]
In this work we show how this bug can be turned into a feature.
We demonstrate entanglement between logical qubits with code distance up to $d = 4$.
We verify the violation of Bell's inequality for both the $d=2$ case with post selection featuring a fidelity of $94%$.
arXiv Detail & Related papers (2024-04-24T17:02:35Z) - Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - 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) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Quantum Tanner codes [0.38073142980732994]
We prove a theorem that simultaneously gives a growing minimum distance for the quantum code and recovers the local testability of the Dinur et al. code.
arXiv Detail & Related papers (2022-02-28T09:35:31Z) - Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate.
We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z) - 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) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Connectivity constrains quantum codes [0.06091702876917279]
We study the limitations of quantum LDPC codes associated with local graphs in $D$-dimensional hyperbolic space.
We find that unless the connectivity graph contains an expander, the code is severely limited.
As an application, we present novel bounds on quantum LDPC codes associated with local graphs in $D$-dimensional hyperbolic space.
arXiv Detail & Related papers (2021-06-01T20:03:16Z)
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.