The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Experimental demonstration of topological error correction
Open accessAbstract
Scalable quantum computing can be achieved only if quantum bits are manipulated in a fault-tolerant fashion. Topological error correction—a method that combines topological quantum computation with quantum error correction—has the highest known tolerable error rate for a local architecture. The technique makes use of cluster states with topological properties and requires only nearest-neighbour interactions. Here we report the experimental demonstration of topological error correction with an eight-photon cluster state. We show that a correlation can be protected against a single error on any quantum bit. Also, when all quantum bits are simultaneously subjected to errors with equal probability, the effective error rate can be significantly reduced. Our work demonstrates the viability of topological error correction for fault-tolerant quantum information processing.
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861 · cited 2×
“Note that a distinct and also important topological scheme has been proposed, in which quantum computation is driven by non-abelian anyons [18, 19] and fault tolerance is achieved via passive stabilization afforded by a ground-state energy gap.”
BackgroundQuantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306
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×
“To overcome this problem, quantum error correction has been invente”
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
O'Brien, J. L. (2007) · Science · doi:10.1126/science.1142892 · Cited by 1,221 · cited 1×
“The scalable construction of cluster states in the future will require further development of high-efficiency entanglement sources and single-photon detectors [35].”
BackgroundQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 1×
“The capstone result in QEC, the so-called threshold theorem [7, 8], states that as long as the error rate p per gate in a quantum computer is smaller than a threshold value pc, arbitrarily long and accurate quantum computation is efficiently possible.”
BackgroundFractional Statistics and Anyon Superconductivity
Wilczek, F. (1990) · Series on Directions in Condensed Matter Physics · doi:10.1142/0961 · Cited by 1,070
Entanglement of Atoms via Cold Controlled Collisions
Jaksch, D., Briegel, H.-J., Cirac, J. I., Gardiner, C. W., & Zoller, P. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1975 · Cited by 795 · cited 1×
“traps [41], cold atoms in optical lattices [42] and photonic modules [17].”
BackgroundTopological Quantum Distillation
Bombin, H., & Martin-Delgado, M. A. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.180501 · Cited by 700
Experimental Quantum Error Correction
Cory, D. G., Price, M. D., Maas, W., Knill, E., Laflamme, R., Zurek, W. H., Havel, T. F., & Somaroo, S. S. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.2152 · Cited by 581
Experimental Detection of Multipartite Entanglement using Witness Operators
Bourennane, M., Eibl, M., Kurtsiefer, C., Gaertner, S., Weinfurter, H., Gühne, O., Hyllus, P., Bruß, D., Lewenstein, M., & Sanpera, A. (2004) · Physical Review Letters · doi:10.1103/physrevlett.92.087902 · Cited by 522
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 · cited 1×
“Some simple QEC codes have been experimentally demonstrated in nuclear magnetic resonance [20, 21], ion traps [22, 23] and optical systems [24, 25].”
BackgroundHigh-threshold universal quantum computation on the surface code
Fowler, A. G., Stephens, A. M., & Groszkowski, P. (2009) · Physical Review A · doi:10.1103/physreva.80.052312 · Cited by 486
Self-citationObservation of eight-photon entanglement
Yao, X.-C., Wang, T.-X., Xu, P., Lu, H., Pan, G.-S., Bao, X.-H., Peng, C.-Z., Lu, C.-Y., Chen, Y.-A., & Pan, J.-W. (2012) · Nature Photonics · doi:10.1038/nphoton.2011.354 · Cited by 433
Self-citationQuantum error-correcting codes associated with graphs
Schlingemann, D., & Werner, R. F. (2001) · Physical Review A · doi:10.1103/physreva.65.012308 · Cited by 406 · cited 1×
“state, the so-called cluster state |G〉 [27], which is specified by an interaction graph G and can be created from a product state via the pairwise Ising interaction over the edges in G.”
BackgroundVarnava, M., Browne, D. E., & Rudolph, T. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.060502 · Cited by 248 · cited 1×
“Recent results have shown that if the product of the number-resolving detector efficiency and the source efficiency is greater than two-thirds, efficient linear optical quantum computation is possibl”
BackgroundQuantum phase gate for photonic qubits using only beam splitters and postselection
Hofmann, H. F., & Takeuchi, S. (2002) · Physical Review A · doi:10.1103/physreva.66.024308 · Cited by 192
T-junction ion trap array for two-dimensional ion shuttling, storage, and manipulation
Hensinger, W. K., Olmschenk, S., Stick, D., Hucul, D., Yeo, M., Acton, M., Deslauriers, L., Monroe, C., & Rabchuk, J. (2006) · Applied Physics Letters · doi:10.1063/1.2164910 · Cited by 164
Quantum error correction beyond qubits
Aoki, T., Takahashi, G., Kajiya, T., Yoshikawa, J.-I., Braunstein, S. L., van Loock, P., & Furusawa, A. (2009) · Nature Physics · doi:10.1038/nphys1309 · Cited by 144
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
A Survey on quantum computing technology
Gyongyosi, L., & Imre, S. (2019) · Computer Science Review · doi:10.1016/j.cosrev.2018.11.002 · Cited by 646
High-dimensional one-way quantum processing implemented on d-level cluster states
Reimer, C., Sciara, S., Roztocki, P., Islam, M., Romero Cortés, L., Zhang, Y., Fischer, B., Loranger, S., Kashyap, R., Cino, A., et al. (2019) · Nature Physics · doi:10.1038/s41567-018-0347-x · Cited by 617
On-chip quantum interference between silicon photon-pair sources
Silverstone, J. W., Bonneau, D., Ohira, K., Suzuki, N., Yoshida, H., Iizuka, N., Ezaki, M., Natarajan, C. M., Tanner, M. G., Hadfield, R. H., et al. (2014) · Nature Photonics · doi:10.1038/nphoton.2013.339 · Cited by 504
Chen, M., Menicucci, N. C., & Pfister, O. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.120505 · Cited by 468
Metadata
- Authors
- Yao, X.-C., Wang, T.-X., Chen, H.-Z., Gao, W.-B., Fowler, A. G., Raussendorf, R., Chen, Z.-B., Liu, N.-L., Lu, C.-Y., Deng, Y.-J., Chen, Y.-A., & Pan, J.-W.
- Venue
- Nature
- Published
- 2012-02
- Volume
- 482
- Issue
- 7386
- Pages
- 489-494
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1986015465
- Cited by
- 208
- References
- 22
- FWCI
- 21.85
- Type
- journal article
- Language
- en
- Open access
- green
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.