High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
- URL: http://arxiv.org/abs/2406.14445v1
- Date: Thu, 20 Jun 2024 16:08:06 GMT
- Title: High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
- Authors: Thomas R. Scruby, Timo Hillmann, Joschka Roffe,
- Abstract summary: We present a new family of quantum low-density parity-check codes, which we call radial codes.
In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance.
Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
- Score: 0.6144680854063939
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers $(r,s)$ and have parameters $[\![2r^2s,2(r-1)^2,\leq2s]\!]$, with numerical studies suggesting average-case distance linear in $s$. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance while using approximately five times fewer physical qubits. This is true even when radial codes are decoded using a single-shot approach, which can allow for faster logical clock speeds and reduced decoding complexity. We describe an intuitive visual representation, canonical basis of logical operators and optimal-length stabiliser measurement circuits for these codes, and argue that their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
Related papers
- LDPC-cat codes for low-overhead quantum computing in 2D [3.9373541926236766]
Quantum low-density parity-check (qLDPC) codes are a promising construction for drastically reducing the overhead of fault-tolerant quantum computing.
An alternative approach to reduce the hardware overhead of fault-tolerance is to use bosonic cat qubits.
We propose an architecture based on cat qubits suppressed in classical LDPC codes for phase-flips.
arXiv Detail & Related papers (2024-01-17T19:00:05Z) - Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - 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) - Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes"
One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code.
At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
arXiv Detail & Related papers (2023-09-18T18:00:02Z) - 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) - Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
Person Re-Identification (ReID) matches pedestrians across disjoint cameras.
Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation.
We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
arXiv Detail & Related papers (2022-07-13T02:44:05Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - 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) - Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor
Codes [5.352699766206807]
We study a next step - fault-tolerantly implementing quantum circuits.
We compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model.
We see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end.
arXiv Detail & Related papers (2021-08-04T14:24:14Z) - 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) - Describing quantum metrology with erasure errors using weight
distributions of classical codes [9.391375268580806]
We consider using quantum probe states with a structure that corresponds to classical $[n,k,d]$ binary block codes of minimum distance.
We obtain bounds on the ultimate precision that these probe states can give for estimating the unknown magnitude of a classical field.
arXiv Detail & Related papers (2020-07-06T16:22:40Z)
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.