High-Threshold Codes for Neutral-Atom Qubits with Biased Erasure Errors
Open accessThe DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Abstract
The requirements for fault-tolerant quantum error correction can be simplified by leveraging structure in the noise of the underlying hardware.In this work, we identify a new type of structured noise motivated by neutral-atom qubits, biased erasure errors, which arises when qubit errors are dominated by detectable leakage from only one of the computational states of the qubit.We study the performance of this model using gate-level simulations of the XZZX surface code.Using the predicted erasure fraction and bias of metastable 171 Yb qubits, we find a threshold of 8.2% for two-qubit gate errors, which is 1.9 times higher than the threshold for unbiased erasures and 7.5 times higher than the threshold for depolarizing errors.Surprisingly, the improved threshold is achieved without bias-preserving controlled-NOT gates and, instead, results from the lower noise entropy in this model.We also introduce an XZZX cluster state construction for measurement-based error correction, hybrid fusion, that is optimized for this noise model.By combining fusion operations and deterministic entangling gates, this construction preserves the intrinsic symmetry of the XZZX code, leading to a higher threshold of 10.3% and enabling the use of rectangular codes with fewer qubits.We discuss a potential physical implementation using a single plane of atoms and movable tweezers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“Quantum error correction (QEC) is essential to protect fragile quantum states during computation [1–3].”
BackgroundPersistent Entanglement in Arrays of Interacting Particles
Briegel, H. J., & Raussendorf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.910 · Cited by 1,950 · cited 1×
“Measurement-based error correction (MBEC) is an alternative approach to error correction based on performing local measurements on a many-body 3D entangled state called a fault-tolerant cluster state [47–51].”
MethodMeasurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · cited 1×
“[46] Robert Raussendorf, Daniel E Browne, and Hans J Briegel, “Measurement-based quantum computation on cluster states,” Physical Review A 68, 022312 (2003).”
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“To apply non-Clifford gates, we can inject noisy magic states and perform magic state distillation [72].”
MethodQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“The combined channel can be expressed by the Kraus operators: We obtain an effective Pauli channel using the identity j 1 ih 1 j ¼ ð I − Z Þ = 2 and the Pauli twirl approximation (PTA), which may be achieved in practice by inserting random single-qubit Pauli gates after atom replacement [41 – 43].”
Measurement-based quantum computation
Briegel, H. J., Browne, D. E., Dür, W., Raussendorf, R., & Van den Nest, M. (2009) · Nature Physics · doi:10.1038/nphys1157 · Cited by 1,090 · cited 1×
“Measurement-based error correction (MBEC) is an alternative approach to error correction based on performing local measurements on a many-body 3D entangled state called a fault-tolerant cluster state [47 – 51].”
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Atom-by-atom assembly of defect-free one-dimensional cold atom arrays
Endres, M., Bernien, H., Keesling, A., Levine, H., Anschuetz, E. R., Krajenbrink, A., Senko, C., Vuletic, V., Greiner, M., & Lukin, M. D. (2016) · Science · doi:10.1126/science.aah3752 · Cited by 863 · cited 1×
“The star denotes R e ¼ 98% , while the green square marks the percolation threshold corresponding to the decoding graph for R e ¼ 1 (see the text). tweezer sites [60,61], and coherent qubit transport has also been demonstrated [33,58].”
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Resource-Efficient Linear Optical Quantum Computation
Browne, D. E., & Rudolph, T. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.010501 · Cited by 790
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598 · cited 1×
“While in this work we focus on thresholds for quantum memory, we can apply Clifford gates using standard techniques such as braiding [52,53], lattice surgery [67,68], or other code deformations [69].”
Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
Graham, T. M., Song, Y., Scott, J., Poole, C., Phuttitarn, L., Jooya, K., Eichler, P., Jiang, X., Marra, A., Grinkemeyer, B., et al. (2022) · Nature · doi:10.1038/s41586-022-04603-6 · Cited by 518
Stim: a fast stabilizer circuit simulator
Gidney, C. (2021) · Quantum · doi:10.22331/q-2021-07-06-497 · Cited by 415 · cited 1×
“The stabilizer simulations and construction of the decoding graph are implemented with STIM [45], while the decoding is implemented with P y M atching [46].”
A fault-tolerant one-way quantum computer
Raussendorf, R., Harrington, J., & Goyal, K. (2006) · Annals of Physics · doi:10.1016/j.aop.2006.01.012 · Cited by 397
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374 · cited 1×
“The biased erasure model has more structure than the conventional erasure model, where observing an erasure yields no information about the prior state of the qubit [15–17, 19–21, 23].”
Capacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365 · cited 1×
“Indeed, the error rate at which the quantum capacity of such a channel becomes positive is twice that of the conventional erasure channel, indicating that error correction threshold for the biased-erasure channel can be much higher than that of the conventional erasure channel [24].”
BackgroundBuilding a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281 · cited 1×
“[10] Christopher Chamberland, Kyungjoo Noh, Patricio Arrangoiz-Arriola, Earl T Campbell, Connor T Hann, Joseph Iverson, Harald Putterman, Thomas C Bohdanowicz, Steven T Flammia, Andrew Keller, et al.”
Bonilla Ataides, J. P., Tuckett, D. K., Bartlett, S. D., Flammia, S. T., & Brown, B. J. (2021) · Nature Communications · doi:10.1038/s41467-021-22274-1 · Cited by 262 · cited 7×
“This amounts to using a thin, rectangular XZZX surface code, which becomes a repetition code when Re = 1 and the erasures are infinitely biased [13].”
InfluentialRepetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243
High-fidelity gates and mid-circuit erasure conversion in an atomic qubit
Ma, S., Liu, G., Peng, P., Zhang, B., Jandura, S., Claes, J., Burgers, A. P., Pupillo, G., Puri, S., & Thompson, J. D. (2023) · Nature · doi:10.1038/s41586-023-06438-1 · Cited by 228
Self-citationBias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201 · cited 1×
“Given the availability of bias-preserving gates [12], this can lead to significantly improved thresholds and lower overhead for the XZZX surface code, which has special symmetries facilitating decoding this type of noise [13,14].”
Self-citationTwo-dimensional transport and transfer of a single atomic qubit in optical tweezers
Beugnon, J., Tuchendler, C., Marion, H., Gaëtan, A., Miroshnychenko, Y., Sortais, Y. R. P., Lance, A. M., Jones, M. P. A., Messin, G., Browaeys, A., et al. (2007) · Nature Physics · doi:10.1038/nphys698 · Cited by 189
Random Decoupling Schemes for Quantum Dynamical Control and Error Suppression
Viola, L., & Knill, E. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.060502 · Cited by 180
Ytterbium Nuclear-Spin Qubits in an Optical Tweezer Array
Jenkins, A., Lis, J. W., Senoo, A., McGrew, W. F., & Kaufman, A. M. (2022) · Physical Review X · doi:10.1103/physrevx.12.021027 · Cited by 146
Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms
Cong, I., Levine, H., Keesling, A., Bluvstein, D., Wang, S.-T., & Lukin, M. D. (2022) · Physical Review X · doi:10.1103/physrevx.12.021049 · Cited by 144
Universal Gate Operations on Nuclear Spin Qubits in an Optical Tweezer Array of Yb 171 Atoms
Ma, S., Burgers, A. P., Liu, G., Wilson, J., Zhang, B., & Thompson, J. D. (2022) · Physical Review X · doi:10.1103/physrevx.12.021028 · Cited by 135
Self-citationA fault-tolerant non-Clifford gate for the surface code in two dimensions
Brown, B. J. (2020) · Science Advances · doi:10.1126/sciadv.aay4929 · Cited by 77
Practical Quantum Error Correction with the XZZX Code and Kerr-Cat Qubits
Darmawan, A. S., Brown, B. J., Grimsmo, A. L., Tuckett, D. K., & Puri, S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030345 · Cited by 2 · cited 4×
“We model these as depolarizing errors with total rate p p by drawing an operator from the set f I; X; Y; Z g ⊗ 2 nf I ⊗ I g with uniform probability p p = 15 .”
InfluentialSelf-citation
Cited by
High-fidelity parallel entangling gates on a neutral-atom quantum computer
Evered, S. J., Bluvstein, D., Kalinowski, M., Ebadi, S., Manovitz, T., Zhou, H., Li, S. H., Geim, A. A., Wang, T. T., Maskara, N., et al. (2023) · Nature · doi:10.1038/s41586-023-06481-y · Cited by 522
High-fidelity gates and mid-circuit erasure conversion in an atomic qubit
Ma, S., Liu, G., Peng, P., Zhang, B., Jandura, S., Claes, J., Burgers, A. P., Pupillo, G., Puri, S., & Thompson, J. D. (2023) · Nature · doi:10.1038/s41586-023-06438-1 · Cited by 228
“Subsequently transferring the other level and measuring the ground state population again would allow atom loss to be distinguished, which is also beneficial for error correction 29 .”
BackgroundSelf-citationRadnaev, A. G., Chung, W. C., Cole, D. C., Mason, D., Ballance, T. G., Bedalov, M. J., Belknap, D. A., Berman, M. R., Blakely, M., Bloomfield, I. L., et al. (2025) · PRX Quantum · doi:10.1103/66s8-jj18 · Cited by 54
Metadata
- Authors
- Sahay, K., Jin, J., Claes, J., Thompson, J. D., & Puri, S.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2023-10-24
- Volume
- 13
- Issue
- 4
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W4387908621
- Cited by
- 65
- References
- 30
- FWCI
- 5.71
- Type
- journal article
- Language
- en
- Open access
- gold
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.