The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Recipes for spin-based quantum computing
Open accessAbstract
Technological growth in the electronics industry has historically been measured by the number of transistors that can be crammed onto a single microchip. Unfortunately, all good things must come to an end; spectacular growth in the number of transistors on a chip requires spectacular reduction of the transistor size. For electrons in semiconductors, the laws of quantum mechanics take over at the nanometre scale, and the conventional wisdom for progress (transistor cramming) must be abandoned. This realization has stimulated extensive research on ways to exploit the spin (in addition to the orbital) degree of freedom of the electron, giving birth to the field of spintronics . Perhaps the most ambitious goal of spintronics is to realize complete control over the quantum mechanical nature of the relevant spins. This prospect has motivated a race to design and build a spintronic device capable of complete control over its quantum mechanical state, and ultimately, performing computations: a quantum computer. In this tutorial we summarize past and very recent developments which point the way to spin-based quantum computing in the solid state. After introducing a set of basic requirements for any quantum computer proposal, we offer a brief summary of some of the many theoretical proposals for solid-state quantum computers. We then focus on the Loss–DiVincenzo proposal for quantum computing with the spins of electrons confined to quantum dots. There are many obstacles to building such a quantum device. We address these, and survey recent theoretical, and then experimental progress in the field. To conclude the tutorial, we list some as-yet unrealized experiments, which would be crucial for the development of a quantum dot quantum computer.
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
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
Quantum computation with quantum dots
Loss, D., & DiVincenzo, D. P. (1998) · Physical Review A · doi:10.1103/physreva.57.120 · Cited by 6,840
Self-citationQuantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Quantum 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
Strong coupling of a single photon to a superconducting qubit using circuit quantum electrodynamics
Wallraff, A., Schuster, D. I., Blais, A., Frunzio, L., Huang, R. S., Majer, J., Kumar, S., Girvin, S. M., & Schoelkopf, R. J. (2004) · Nature · doi:10.1038/nature02851 · Cited by 3,796
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733
Growth of nanowire superlattice structures for nanoscale photonics and electronics
Gudiksen, M. S., Lauhon, L. J., Wang, J., Smith, D. C., & Lieber, C. M. (2002) · Nature · doi:10.1038/415617a · Cited by 2,709
Metadata
- Authors
- Cerletti, V., Coish, W. A., Gywat, O., & Loss, D.
- Venue
- Nanotechnology
- Publisher
- IOP Publishing
- Published
- 2005-02-26
- Volume
- 16
- Issue
- 4
- Pages
- R27-R49
- ISSN
- 0957-4484 (ISSN-L)
- 1361-6528
- OpenAlex
- W2107715623
- Cited by
- 183
- References
- 16
- FWCI
- 15.98
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Recipes for spin-based quantum computing. https://app.cochat.ai/papers/10.1088/0957-4484/16/4/r01
- The paper
- Cerletti, V., Coish, W. A., Gywat, O., & Loss, D. (2005). Recipes for spin-based quantum computing. Nanotechnology. https://doi.org/10.1088/0957-4484/16/4/r01
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.