Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
Continuous-variable measurement-based quantum computation on cluster states has in recent years shown great potential for scalable, universal, and fault-tolerant quantum computation when combined with the Gottesman-Kitaev-Preskill (GKP) code and quantum error correction.However, no complete fault-tolerant architecture exists that includes everything from cluster-state generation with finite squeezing to gate implementations with realistic noise and error correction.In this work, we propose a simple architecture for the preparation of a cluster state in three dimensions in which gates can be efficiently implemented by gate teleportation.To accommodate scalability, we propose architectures that allow both spatial and temporal multiplexing, with the temporally encoded version requiring as little as two squeezed light sources.Because of its three-dimensional structure, the architecture supports topological qubit error correction, while GKP error correction is efficiently realized within the architecture by teleportation.To validate fault tolerance, the architecture is simulated using surface-GKP codes, including noise from GKP states as well as gate noise caused by finite squeezing in the cluster state.We find a fault-tolerant squeezing threshold of 12.7 dB, with room for further improvement.
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
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Raussendorf, R., & Briegel, H. J. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.5188 · Cited by 4,477
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 · cited 2×
“In the surface code, Clifford gates can be implemented by braiding [23] or lattice surgery [65] implemented by regulating the surface code syndrome measurements, while non-Clifford gates may be realized using magic states distilled from GKP qubits prepared in a magic state [62, 63] and injected into the surface code a…”
BackgroundMethodQuantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Edmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428 · cited 7×
“Minimum-weight perfect matching (MWPM) [53, 54] on these matching graphs is then used as the decoding al-gorithm to determine data qubit errors and the resulting error recovery.”
MethodInfluentialIntegrated photonic quantum technologies
Wang, J., Sciarrino, F., Laing, A., & Thompson, M. G. (2020) · Nature Photonics · doi:10.1038/s41566-019-0532-1 · Cited by 1,576
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“In practice, the error recovery is simply handled by using and updating a Pauli frame [55–58], similar to how feed-forward can be handled in MBQC by compensating for by-products in the following measurement outcomes [2, 3].”
MethodFault-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
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×
“In the surface code, Clifford gates can be implemented by braiding [25] or lattice surgery [81] implemented by regulating the surface code syndrome measurements, while non-Clifford gates may be realized using magic states distilled from GKP qubits prepared in a magic state [78, 79] and injected into…”
BackgroundGeneration of time-domain-multiplexed two-dimensional cluster state
Asavanant, W., Shiozawa, Y., Yokoyama, S., Charoensombutamon, B., Emura, H., Alexander, R. N., Takeda, S., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2019) · Science · doi:10.1126/science.aay2645 · Cited by 476 · cited 1×
“This has been proven by realizations of large-scale CV cluster states in both one dimension [4–6] and two dimensions [7,8].”
MethodMacroscopically distinct quantum-superposition states as a bosonic code for amplitude damping
Cochrane, P. T., Milburn, G. J., & Munro, W. J. (1999) · Physical Review A · doi:10.1103/physreva.59.2631 · Cited by 470 · cited 2×
“a cat-code [11], a binomial code [12], or the GottesmanKitaev-Preskill (GKP) code [13], the Gaussian noise can be corrected at the cost of being converted into Pauli errors on the encoded qubit.”
BackgroundDeterministic generation of a two-dimensional cluster state
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2019) · Science · doi:10.1126/science.aay4354 · Cited by 433 · cited 2×
“This has been proven by realizations of large-scale CV cluster states in both one dimension [4–6] and two dimensions [7,8].”
BackgroundMethodSelf-citationQuantum computations on a topologically encoded qubit
Nigg, D., Müller, M., Martinez, E. A., Schindler, P., Hennrich, M., Monz, T., Martin-Delgado, M. A., & Blatt, R. (2014) · Science · doi:10.1126/science.1253742 · Cited by 400
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
Encoding a qubit in a trapped-ion mechanical oscillator
Flühmann, C., Nguyen, T. L., Marinelli, M., Negnevitsky, V., Mehta, K., & Home, J. P. (2019) · Nature · doi:10.1038/s41586-019-0960-6 · Cited by 394
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Building 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
Self-citationYoshikawa, J.-I., Yokoyama, S., Kaji, T., Sornphiphatphong, C., Shiozawa, Y., Makino, K., & Furusawa, A. (2016) · APL Photonics · doi:10.1063/1.4962732 · Cited by 257 · cited 1×
“The scheme consists of parallel wires, each corresponding to temporally encoded one-dimensional cluster states [4,6] on which single-mode gates can be implemented by projective measurements using a beam splitter”
MethodTopological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223
Self-citationMagic State Distillation: Not as Costly as You Think
Litinski, D. (2019) · Quantum · doi:10.22331/q-2019-12-02-205 · Cited by 220
Optimal resources for topological two-dimensional stabilizer codes: Comparative study
Bombin, H., & Martin-Delgado, M. A. (2007) · Physical Review A · doi:10.1103/physreva.76.012305 · Cited by 178 · cited 1×
“Specifically, to compute logical X or Z error rates, we implement the simulation methods of [25] applied to the rotated surface code [41, 42].”
MethodAll-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
Baragiola, B. Q., Pantaleoni, G., Alexander, R. N., Karanjai, A., & Menicucci, N. C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200502 · Cited by 173
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Self-citationError correction of a logical grid state qubit by dissipative pumping
de Neeve, B., Nguyen, T.-L., Behrle, T., & Home, J. P. (2022) · Nature Physics · doi:10.1038/s41567-021-01487-7 · Cited by 152
Towards scalable bosonic quantum error correction
Terhal, B. M., Conrad, J., & Vuillot, C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab98a5 · Cited by 146
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Self-citationAnalog Quantum Error Correction with Encoding a Qubit into an Oscillator
Fukui, K., Tomita, A., & Okamoto, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180507 · Cited by 104
Bonneau, D., Lobino, M., Jiang, P., Natarajan, C. M., Tanner, M. G., Hadfield, R. H., Dorenbos, S. N., Zwiller, V., Thompson, M. G., & O’Brien, J. L. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.053601 · Cited by 99
Time-Domain-Multiplexed Measurement-Based Quantum Operations with 25-MHz Clock Frequency
Asavanant, W., Charoensombutamon, B., Yokoyama, S., Ebihara, T., Nakamura, T., Alexander, R. N., Endo, M., Yoshikawa, J.-I., Menicucci, N. C., Yonezawa, H., et al. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.034005 · Cited by 76 · cited 5×
“With a beamsplitter (marked with a red arrow) and two detectors for each wire, single-mode gates are implemented in each wire when feeding the resource preparation gadget with squeezed states, |0〉sq [9, 30].”
BackgroundMethodInfluentialDeterministic multi-mode gates on a scalable photonic quantum computing platform
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Nature Physics · doi:10.1038/s41567-021-01296-y · Cited by 4 · cited 5×
“Alternatively, we can consider the two-mode entangled states more generally as cluster-type states [32], here with edge weight 1, for which the implemented gate is independent of the squeezing r, which then affects only the gate noise [10].”
BackgroundMethodInfluentialSelf-citation
Cited by
Quantum computational advantage with a programmable photonic processor
Madsen, L. S., Laudenbach, F., Askarani, M. F., Rortais, F., Vincent, T., Bulmer, J. F. F., Miatto, F. M., Neuhaus, L., Helt, L. G., Collins, M. J., et al. (2022) · Nature · doi:10.1038/s41586-022-04725-x · Cited by 1,101
Jain, S. P., Iosue, J. T., Barg, A., & Albert, V. V. (2024) · Nature Physics · doi:10.1038/s41567-024-02496-y · Cited by 18
Deterministic multi-mode gates on a scalable photonic quantum computing platform
Larsen, M. V., Guo, X., Breum, C. R., Neergaard-Nielsen, J. S., & Andersen, U. L. (2021) · Nature Physics · doi:10.1038/s41567-021-01296-y · Cited by 4
Self-citation
Metadata
- Authors
- Larsen, M. V., Chamberland, C., Noh, K., Neergaard-Nielsen, J. S., & Andersen, U. L.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-08-11
- Volume
- 2
- Issue
- 3
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3118307118
- Cited by
- 99
- References
- 32
- FWCI
- 5.82
- 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.