The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Topological quantum computing with a very noisy network and local error rates approaching one percent
Open accessAbstract
A scalable quantum computer could be built by networking together many simple processor cells, thus avoiding the need to create a single complex structure. The difficulty is that realistic quantum links are very error prone. A solution is for cells to repeatedly communicate with each other and so purify any imperfections; however prior studies suggest that the cells themselves must then have prohibitively low internal error rates. Here we describe a method by which even error-prone cells can perform purification: groups of cells generate shared resource states, which then enable stabilization of topologically encoded data. Given a realistically noisy network (≥10% error rate) we find that our protocol can succeed provided that intra-cell error rates for initialisation, state manipulation and measurement are below 0.82%. This level of fidelity is already achievable in several laboratory systems. One approach to build a scalable quantum computer is to connect many smaller cells into a larger whole, but for realistic systems this quickly becomes prone to errors. Nickerson et al. present a noisy network protocol that can withstand high error rates within each cell but still perform stable purification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 · cited 2×
“This depends on the frequency of such errors; estimates of the threshold error rate are 0.75–1.4% depending on the model 3–5 .”
InfluentialEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
Heralded entanglement between solid-state qubits separated by three metres
Bernien, H., Hensen, B., Pfaff, W., Koolstra, G., Blok, M. S., Robledo, L., Taminiau, T. H., Markham, M., Twitchen, D. J., Childress, L., et al. (2013) · Nature · doi:10.1038/nature12016 · Cited by 1,187
Entanglement of single-atom quantum bits at a distance
Moehring, D. L., Maunz, P., Olmschenk, S., Younge, K. C., Matsukevich, D. N., Duan, L.-M., & Monroe, C. (2007) · Nature · doi:10.1038/nature06118 · Cited by 820
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
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 2×
“However it is generally accepted that the threshold for full computation will be very similar to that for successful information storage, because the stabilizer measurements required for simple preservation of the encoded state are very similar to those required for computation 3,20 .”
Cited by
Quantum technologies with optically interfaced solid-state spins
Awschalom, D. D., Hanson, R., Wrachtrup, J., & Zhou, B. B. (2018) · Nature Photonics · doi:10.1038/s41566-018-0232-2 · Cited by 1,059
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
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
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
A ten-qubit solid-state spin register with quantum memory up to one minute
Bradley, C. E., Randall, J., Abobeih, M. H., Berrevoets, R. C., Degen, M. J., Bakker, M. A., Markham, M., Twitchen, D. J., & Taminiau, T. H. (2019) · Physical Review X · doi:10.1103/physrevx.9.031045 · Cited by 546
Unconditional quantum teleportation between distant solid-state quantum bits
Pfaff, W., Hensen, B. J., Bernien, H., van Dam, S. B., Blok, M. S., Taminiau, T. H., Tiggelman, M. J., Schouten, R. N., Markham, M., Twitchen, D. J., et al. (2014) · Science · doi:10.1126/science.1253512 · Cited by 528
Universal control and error correction in multi-qubit spin registers in diamond
Taminiau, T. H., Cramer, J., van der Sar, T., Dobrovitski, V. V., & Hanson, R. (2014) · Nature Nanotechnology · doi:10.1038/nnano.2014.2 · Cited by 429
The germanium quantum information route
Scappucci, G., Kloeffel, C., Zwanenburg, F. A., Loss, D., Myronov, M., Zhang, J.-J., De Franceschi, S., Katsaros, G., & Veldhorst, M. (2020) · Nature Reviews Materials · doi:10.1038/s41578-020-00262-z · Cited by 382
Why I am optimistic about the silicon-photonic route to quantum computing
Rudolph, T. (2017) · APL Photonics · doi:10.1063/1.4976737 · Cited by 350
The future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Distributed quantum sensing in a continuous-variable entangled network
Guo, X., Breum, C. R., Borregaard, J., Izumi, S., Larsen, M. V., Gehring, T., Christandl, M., Neergaard-Nielsen, J. S., & Andersen, U. L. (2020) · Nature Physics · doi:10.1038/s41567-019-0743-x · Cited by 333
Multiparameter Estimation in Networked Quantum Sensors
Proctor, T. J., Knott, P. A., & Dunningham, J. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.080501 · Cited by 318
“More formally, a QSN is any MPE problem in which the total Hilbert space H may be decomposed as H = H1 ⊗ · · · ⊗ Hs for some {Hk}, and the unitary evolution may be decomposed as Uφ = U1(φ[1]) ⊗ U2(φ[2]) ⊗ · · · ⊗ Us(φ[s]), where φ[k] denotes the dk-dimensional sub-vector of φ encoded onto the k sensor by the unitary U…”
BackgroundDeterministic teleportation of a quantum gate between two logical qubits
Chou, K. S., Blumoff, J. Z., Wang, C. S., Reinhold, P. C., Axline, C. J., Gao, Y. Y., Frunzio, L., Devoret, M. H., Jiang, L., & Schoelkopf, R. J. (2018) · Nature · doi:10.1038/s41586-018-0470-y · Cited by 272
Co-designing a scalable quantum computer with trapped atomic ions
Brown, K. R., Kim, J., & Monroe, C. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.34 · Cited by 250
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
A photonic platform for donor spin qubits in silicon
Morse, K. J., Abraham, R. J. S., DeAbreu, A., Bowness, C., Richards, T. S., Riemann, H., Abrosimov, N. V., Becker, P., Pohl, H.-J., Thewalt, M. L. W., et al. (2017) · Science Advances · doi:10.1126/sciadv.1700930 · Cited by 105
Low-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
The ZX calculus is a language for surface code lattice surgery
de Beaudrap, N., & Horsman, D. (2020) · Quantum · doi:10.22331/q-2020-01-09-218 · Cited by 83
Metadata
- Authors
- Nickerson, N. H., Li, Y., & Benjamin, S. C.
- Venue
- Nature Communications
- Published
- 2013-04-23
- Volume
- 4
- Issue
- 1
- Pages
- 1756-1756
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W1973267088
- Cited by
- 222
- References
- 6
- FWCI
- 14.36
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.