The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Usefulness of NMR Quantum Computing
Abstract
Quantum computing—the manipulation of a quantum mechanical system to do information processing—has attracted considerable recent attention, largely triggered by Shor's proposed algorithm for finding prime factors in polynomial instead of exponential time ([1][1]). The importance of this problem
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“The creation and preservation of high-fidelity spin entanglement are central to several quantum computing applications (30, 31) and are ideal for testing the performance of GENETICS-AI (32–35).”
From High-fidelity control of spin ensemble dynamics via artificial intelligence: from quantum computing to NMR spectroscopy and imaging (2022) · cites this paper as [32]
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
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
Geometrical Representation of the Schrödinger Equation for Solving Maser Problems
Feynman, R. P., Vernon, F. L., & Hellwarth, R. W. (1957) · Journal of Applied Physics · doi:10.1063/1.1722572 · Cited by 1,060
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Enhancement of Solution NMR and MRI with Laser-Polarized Xenon
Navon, G., Song, Y., Rõõm, T., et al. (1996) · Science · doi:10.1126/science.271.5257.1848 · Cited by 356
Resilient Quantum Computation: Error Models and Thresholds
Knill, E. H., Laflamme, R., & Zurek, W. H. (1997) · CERN Document Server (European Organization for Nuclear Research) · Cited by 296
Selective Excitation of Multiple-Quantum Coherence in Nuclear Magnetic Resonance
Warren, W. S., Sinton, S. W., Weitekamp, D. P., & Pines, A. (1979) · Physical Review Letters · doi:10.1103/physrevlett.43.1791 · Cited by 119
Self-citation
Cited by
A silicon-based nuclear spin quantum computer
Kane, B. E. (1998) · Nature · doi:10.1038/30156 · Cited by 3,779
A standard protocol for describing individual-based and agent-based models
Grimm, V., Berger, U., Bastiansen, F., Eliassen, S., Ginot, V., Giske, J., Goss-Custard, J., Grand, T., Heinz, S. K., Huse, G., et al. (2006) · Ecological Modelling · doi:10.1016/j.ecolmodel.2006.04.023 · Cited by 2,981
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154
Single-Shot Readout of a Single Nuclear Spin
Neumann, P., Beck, J., Steiner, M., Rempp, F., Fedder, H., Hemmer, P. R., Wrachtrup, J., & Jelezko, F. (2010) · Science · doi:10.1126/science.1189075 · Cited by 621
Experimental realization of a quantum algorithm
Chuang, I. L., Vandersypen, L. M. K., Zhou, X., Leung, D. W., & Lloyd, S. (1998) · Nature · doi:10.1038/30181 · Cited by 604
Metadata
- Authors
- Warren, W. S.
- Venue
- Science
- Published
- 1997-09-12
- Volume
- 277
- Issue
- 5332
- Pages
- 1688-1690
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1970207838
- Cited by
- 253
- References
- 7
- FWCI
- 18.07
- Type
- journal article
- Language
- en
- Open access
- closed
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.