The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Scalable architecture for a room temperature solid-state quantum information processor
Open accessAbstract
The realization of a scalable quantum information processor has emerged over the past decade as one of the central challenges at the interface of fundamental science and engineering. Here we propose and analyse an architecture for a scalable, solid-state quantum information processor capable of operating at room temperature. Our approach is based on recent experimental advances involving nitrogen-vacancy colour centres in diamond. In particular, we demonstrate that the multiple challenges associated with operation at ambient temperature, individual addressing at the nanoscale, strong qubit coupling, robustness against disorder and low decoherence rates can be simultaneously achieved under realistic, experimentally relevant conditions. The architecture uses a novel approach to quantum information transfer and includes a hierarchy of control at successive length scales. Moreover, it alleviates the stringent constraints currently limiting the realization of scalable quantum processors and will provide fundamental insights into the physics of non-equilibrium many-body quantum systems. Electron spins at nitrogen-vacancy centres in diamond are thought to be the most promising building blocks for practical realizations of quantum computers. Yaoet al. present a scalable architecture for a quantum information processor based on such vacancy centres that operates at room temperature.
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
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
�ber das Paulische �quivalenzverbot
Jordan, P., & Wigner, E. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01331938 · Cited by 2,597
On the product of semi-groups of operators
Trotter, H. F. (1959) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1959-0108732-6 · Cited by 2,282
Quantum register based on individual electronic and nuclear spin qubits in diamond
Dutt, M. V. G., Childress, L., Jiang, L., Togan, E., Maze, J., Jelezko, F., Zibrov, A. S., Hemmer, P. R., & Lukin, M. D. (2007) · Science · doi:10.1126/science.1139831 · Cited by 1,287
Self-citationSuzuki, M. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01609348 · Cited by 895
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Optimal Control at the Quantum Speed Limit
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., & Santoro, G. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240501 · Cited by 509
High-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 · cited 1×
“[44] Fowler AG, Stephens AM, Groszkowski P (2009) Highthreshold universal quantum computation on the surface code.”
BackgroundQuantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Fast and robust approach to long-distance quantum communication with atomic ensembles
Jiang, L., Taylor, J. M., & Lukin, M. D. (2007) · Physical Review A · doi:10.1103/physreva.76.012301 · Cited by 132
Self-citationBrokered graph-state quantum computation
Benjamin, S. C., Browne, D. E., Fitzsimons, J., & Morton, J. J. L. (2006) · New Journal of Physics · doi:10.1088/1367-2630/8/8/141 · Cited by 128
Cited by
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Room-Temperature Quantum Bit Memory Exceeding One Second
Maurer, P. C., Kucsko, G., Latta, C., Jiang, L., Yao, N. Y., Bennett, S. D., Pastawski, F., Hunger, D., Chisholm, N., Markham, M., et al. (2012) · Science · doi:10.1126/science.1220513 · Cited by 878
Self-citationQuantum error correction for beginners
Devitt, S. J., Munro, W. J., & Nemoto, K. (2013) · Reports on Progress in Physics · doi:10.1088/0034-4885/76/7/076001 · Cited by 759
Materials challenges and opportunities for quantum computing hardware
de Leon, N. P., Itoh, K. M., Kim, D., Mehta, K. K., Northup, T. E., Paik, H., Palmer, B. S., Samarth, N., Sangtawesin, S., & Steuerman, D. W. (2021) · Science · doi:10.1126/science.abb2823 · Cited by 710
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
Metadata
- Authors
- Yao, N. Y., Jiang, L., Gorshkov, A. V., Maurer, P. C., Giedke, G., Cirac, J. I., & Lukin, M. D.
- Venue
- Nature Communications
- Published
- 2012-04-24
- Volume
- 3
- Issue
- 1
- Pages
- 800-800
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2156280673
- Cited by
- 250
- References
- 12
- FWCI
- 10.57
- 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.