Experimental demonstration of a graph state quantum error-correction code
Open accessThe DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Abstract
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum computing. However, recently a family of entangled resources known as graph states has emerged as a versatile alternative for protecting quantum information. Depending on the graph’s structure, errors can be detected and corrected in an efficient way using measurement-based techniques. Here we report an experimental demonstration of error correction using a graph state code. We use an all-optical setup to encode quantum information into photons representing a four-qubit graph state. We are able to reliably detect errors and correct against qubit loss. The graph we realize is setup independent, thus it could be employed in other physical settings. Our results show that graph state codes are a promising approach for achieving scalable quantum information processing. Noise and decoherence are serious problems for scalable quantum computing schemes. Using an all-optical approach, Bell et al.explore the use of four-qubit graph states for encoding quantum information, and show that they can reliably detect and correct errors against loss.
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
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
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
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
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 2×
“For the maximally entangled qubit pairs in the logical encoding of the probe state |þ yi, we use the following entanglement witness on qubit pair (1,2) and pair (4,5)”
BackgroundMethodO'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388
James, D. F. V., Kwiat, P. G., Munro, W. J., & White, A. G. (2001) · Physical Review A · doi:10.1103/physreva.64.052312 · Cited by 2,176
Measurement-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
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Experimental one-way quantum computing
Walther, P., Resch, K. J., Rudolph, T., Schenck, E., Weinfurter, H., Vedral, V., Aspelmeyer, M., & Zeilinger, A. (2005) · Nature · doi:10.1038/nature03347 · Cited by 1,273
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
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×
“Here, on the right hand side of equations (12) and (13), we represent the logical operations by assigning the local operators to each qubit’s spatial location in the graph, as shown in Fig.”
BackgroundPreskill, 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
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
Experimental entanglement of six photons in graph states
Lu, C.-Y., Zhou, X.-Q., Gühne, O., Gao, W.-B., Zhang, J., Yuan, Z.-S., Goebel, A., Yang, T., & Pan, J.-W. (2007) · Nature Physics · doi:10.1038/nphys507 · Cited by 683
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
Realization of quantum error correction
Chiaverini, J., Leibfried, D., Schaetz, T., Barrett, M. D., Blakestad, R. B., Britton, J., Itano, W. M., Jost, J. D., Knill, E., Langer, C., et al. (2004) · Nature · doi:10.1038/nature03074 · Cited by 517
Demonstration of Blind Quantum Computing
Barz, S., Kashefi, E., Broadbent, A., Fitzsimons, J. F., Zeilinger, A., & Walther, P. (2012) · Science · doi:10.1126/science.1214707 · Cited by 475
Quantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406
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
High-speed linear optics quantum computing using active feed-forward
Prevedel, R., Walther, P., Tiefenbacher, F., Böhi, P., Kaltenbaek, R., Jennewein, T., & Zeilinger, A. (2007) · Nature · doi:10.1038/nature05346 · Cited by 373
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346
Experimental Analysis of a Four-Qubit Photon Cluster State
Kiesel, N., Schmid, C., Weber, U., Tóth, G., Gühne, O., Ursin, R., & Weinfurter, H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.210502 · Cited by 284
Greenberger-Horne-Zeilinger-state analyzer
Pan, J.-W., & Zeilinger, A. (1998) · Physical Review A · doi:10.1103/physreva.57.2208 · Cited by 213
Experimental Realization of One-Way Quantum Computing with Two-Photon Four-Qubit Cluster States
Chen, K., Li, C.-M., Zhang, Q., Chen, Y.-A., Goebel, A., Chen, S., Mair, A., & Pan, J.-W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.120503 · Cited by 204
Loss Tolerance in One-Way Quantum Computation via Counterfactual Error Correction
Varnava, M., Browne, D. E., & Rudolph, T. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.120501 · Cited by 203
Realization and Characterization of a Two-Photon Four-Qubit Linear Cluster State
Vallone, G., Pomarico, E., Mataloni, P., De Martini, F., & Berardi, V. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.180502 · Cited by 132
Experimental Realization of Deutsch’s Algorithm in a One-Way Quantum Computer
Tame, M. S., Prevedel, R., Paternostro, M., Böhi, P., Kim, M. S., & Zeilinger, A. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.140501 · Cited by 124
Self-citationActive One-Way Quantum Computation with Two-Photon Four-Qubit Cluster States
Vallone, G., Pomarico, E., De Martini, F., & Mataloni, P. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.160502 · Cited by 98
Experimental realization of the Deutsch-Jozsa algorithm with a six-qubit cluster state
Vallone, G., Donati, G., Bruno, N., Chiuri, A., & Mataloni, P. (2010) · Physical Review A · doi:10.1103/physreva.81.050302 · Cited by 26
Cited by
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 repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Converting Coherence to Quantum Correlations
Ma, J., Yadin, B., Girolami, D., Vedral, V., & Gu, M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.160407 · Cited by 408
Repeated quantum error detection in a surface code
Andersen, C. K., Remm, A., Lazar, S., Krinner, S., Lacroix, N., Norris, G. J., Gabureac, M., Eichler, C., & Wallraff, A. (2020) · Nature Physics · doi:10.1038/s41567-020-0920-y · Cited by 337
Experimental Demonstration of Fault-Tolerant State Preparation with Superconducting Qubits
Takita, M., Cross, A. W., Córcoles, A. D., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180501 · Cited by 228
Metadata
- Authors
- Bell, B. A., Herrera-Martí, D. A., Tame, M. S., Markham, D., Wadsworth, W. J., & Rarity, J. G.
- Venue
- Nature Communications
- Published
- 2014-04-22
- Volume
- 5
- Issue
- 1
- Pages
- 3658-3658
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2068917496
- Cited by
- 122
- References
- 33
- FWCI
- 9.24
- Type
- journal article
- Language
- en
- Open access
- bronze
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.