High-performance repetition cat code using fast noisy operations
Open accessThe DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Abstract
Bosonic cat qubits stabilized by two-photon driven dissipation benefit from exponential suppression of bit-flip errors and an extensive set of gates preserving this protection. These properties make them promising building blocks of a hardware-efficient and fault-tolerant quantum processor. In this paper, we propose a performance optimization of the repetition cat code architecture using fast but noisy CNOT gates for stabilizer measurements. This optimization leads to high thresholds for the physical figure of merit, given as the ratio between intrinsic single-photon loss rate of the bosonic mode and the engineered two-photon loss rate, as well as an improved scaling below threshold of the required overhead, to reach an expected level of logical error rate. Relying on the specific error models for cat qubit operations, this optimization exploits fast parity measurements, using accelerated low-fidelity CNOT gates, combined with fast ancilla parity-check qubits. The significant enhancement in the performance is explained by: 1- the highly asymmetric error model of cat qubit CNOT gates with a major component on control (ancilla) qubits, and 2- the robustness of the repetition cat code error correction performance in presence of the leakage induced by fast operations. In order to demonstrate these performances, we develop a method to sample the repetition code under circuit-level noise that also takes into account cat qubit state leakage.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“At the same time, various proposals have been put forward to further scale bosonic QEC by concatenating it with an outer code across multiple bosonic modes6,8–16,18,40, leveraging the protection offered in each bosonic mode to reduce the overall resource overhead for QEC.”
From Hardware-efficient quantum error correction via concatenated bosonic qubits (2025) · cites this paper as [16]
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
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Improved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2001) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,485
Dynamically protected cat-qubits: a new paradigm for universal quantum computation
Mirrahimi, M., Leghtas, Z., Albert, V. V., Touzard, S., Schoelkopf, R. J., Jiang, L., & Devoret, M. H. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045014 · Cited by 639
Self-citationDynamically protected cat-qubits: a new paradigm for universal quantum computationPreprint
Mirrahimi, M., Leghtas, Z., Albert, V. V., Schoelkopf, R. J., Jiang, L., & Michel, H. (2016) · Cited by 552
Self-citationBlossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 414 · cited 1×
“Then, calling Dijkstra’s shortest path algorithm for each pair of detection events gives the complete subgraph to feed to the matching algorithm, a Blossom V implementation of MWPM algorithm [30, 31, 20].”
MethodMethod for Direct Measurement of the Wigner Function in Cavity QED and Ion Traps
Lutterbach, L. G., & Davidovich, L. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2547 · Cited by 394
Exponential suppression of bit or phase errors with cyclic error correction
Google Quantum, A. I., Chen, Z., Satzinger, K. J., Atalaya, J., Korotkov, A. N., Dunsworth, A., Sank, D., Quintana, C., McEwen, M., Barends, R., et al. (2021) · Nature · doi:10.1038/s41586-021-03588-y · Cited by 393
Cited by
Superconducting Cavity Qubit with Tens of Milliseconds Single-Photon Coherence Time
Milul, O., Guttel, B., Goldblatt, U., Hazanov, S., Joshi, L. M., Chausovsky, D., Kahn, N., Çiftyürek, E., Lafont, F., & Rosenblum, S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.030336 · Cited by 167
Hardware-efficient quantum error correction via concatenated bosonic qubits
Putterman, H., Noh, K., Hann, C. T., MacCabe, G. S., Aghaeimeibodi, S., Patel, R. N., Lee, M., Jones, W. M., Moradinejad, H., Rodriguez, R., et al. (2025) · Nature · doi:10.1038/s41586-025-08642-7 · Cited by 108
LDPC-cat codes for low-overhead quantum computing in 2D
Ruiz, D., Guillaud, J., Leverrier, A., Mirrahimi, M., & Vuillot, C. (2025) · Nature Communications · doi:10.1038/s41467-025-56298-8 · Cited by 90
“It has been recently theoretically demonstrated [59, 93, 94] that the scaling of the exponential suppression of bit-flips increases with the squeezing parameter, O ( e − γ ( r )¯ n ), where γ (0) ≈ 2 for cat states and γ ( r ) > 2 for squeezed cat states ( r > 0).”
InfluentialSelf-citationAutoparametric Resonance Extending the Bit-Flip Time of a Cat Qubit up to 0.3 s
Marquet, A., Essig, A., Cohen, J., Cottet, N., Murani, A., Albertinale, E., Dupouy, S., Bienfait, A., Peronnin, T., Jézouin, S., et al. (2024) · Physical Review X · doi:10.1103/physrevx.14.021019 · Cited by 35
“4 predicted in case of pure dephasing alone (solid line) [24].”
BackgroundInfluentialFault-Tolerant Quantum Computation by Hybrid Qubits with Bosonic Cat Code and Single Photons
Lee, J., Kang, N., Lee, S.-H., Jeong, H., Jiang, L., & Lee, S.-W. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030322 · Cited by 47
Metadata
- Authors
- Régent, F.-M. L., Berdou, C., Leghtas, Z., Guillaud, J., & Mirrahimi, M.
- Affiliations
- Alice&Bob, 53 boulevard du Général Martial Valin, 75015 Paris
- Centre National de la Recherche Scientifique (FR)
- Alice & Bob (France) (FR)
- Venue
- Quantum
- Published
- 2023-12-06
- Volume
- 7
- Pages
- 1198
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W4312122816
- Cited by
- 15
- References
- 35
- Citations by year
- 2025: 6 · 2024: 7 · 2023: 2
- FWCI
- 1.33
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- Quantum (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University) (cc-by)
- Funders
- Plan France 2030 (ANR-22-PETQ-0006)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- cat qubits, parity measurement, fault-tolerant quantum computing, bosonic qubits
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: High-performance repetition cat code using fast noisy operations. https://app.cochat.ai/papers/10.22331/q-2023-12-06-1198
- The paper
- Régent, F.-M. L., Berdou, C., Leghtas, Z., Guillaud, J., & Mirrahimi, M. (2023). High-performance repetition cat code using fast noisy operations. Quantum. https://doi.org/10.22331/q-2023-12-06-1198
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.