LDPC-cat codes for low-overhead quantum computing in 2D
Abstract The main obstacle to large scale quantum computing are the errors present in every physical qubit realization. Correcting these errors requires a large number of additional qubits. Two main avenues to reduce this overhead are (i) low-density parity check (LDPC) codes requiring very few addi...
Saved in:
Main Authors: | Diego Ruiz, Jérémie Guillaud, Anthony Leverrier, Mazyar Mirrahimi, Christophe Vuillot |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Nature Communications |
Online Access: | https://doi.org/10.1038/s41467-025-56298-8 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes With Overcomplete Check Matrices
by: Sisi Miao, et al.
Published: (2025-01-01) -
High-rate quantum LDPC codes for long-range-connected neutral atom registers
by: Laura Pecorari, et al.
Published: (2025-01-01) -
The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes
by: Eric Psota, et al.
Published: (2010-01-01) -
Fault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons
by: Jaehak Lee, et al.
Published: (2024-08-01) -
On the Performance of Rate-Compatible LDPC Codes under All-Integer Quantization Decoding
by: Patinya Muangkammuen, et al.
Published: (2022-01-01)