Classical model for bulk-ensemble NMR quantum computation
Open accessAbstract
We present a classical model for bulk-ensemble NMR quantum computation: the quantum state of the NMR sample is described by a probability distribution over the orientations of classical tops, and quantum gates are described by classical transition probabilities. All NMR quantum computing experiments performed so far with three quantum bits can be accounted for in this classical model. After a few entangling gates, the classical model suffers an exponential decrease of the measured signal, whereas there is no corresponding decrease in the quantum description. We suggest that for small numbers of quantum bits, the quantum nature of NMR quantum computation lies in the ability to avoid an exponential signal decrease.
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
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.
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?
The seven spins in the molecule are remarkably well separated in frequency and interact pairwise via J-coupling.
“All seven spins in this molecule are remarkably well separated in frequency ω i / 2 π , and interact pairwise via the J -coupling, described by H J = ∑ i<j 2 π ¯ hJ ij I zi I zj [17].”
From Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance (2001) · cites this paper as [17]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
The citation lists haven’t been fetched yet
References 30 · Cited by 76
Research works printed but not linked: 7
- [1][1] D. G. Cory, A. F. Fahmy, and T. F. Havel, Proc. Nat. Acad. Sci. USA 94 , 1634 (1997). -
- [6][6] R. Laflamme, E. Knill, W. H. Zurek, P. Catasti, and S. V. S. Mariappan, Phil. Trans. Roy. Soc. London A 356 , 1941 (1998). -
- [9][9] J. A. Jones and M. Mosca, unpublished, e-print quant-ph/9808056 . - · arXiv
- [11][11] I. L. Chuang, N. Gershenfeld, M. G. Kubinec, and D. W. Leung, Proc. Roy. Soc. London A 454 , 447 (1998). -
- [22][22] D. P. DiVincenzo, review of [30] in Quick Reviews in Quantum Computation and Information, http://quickreviews.org -
- [23][23] S. L. Braunstein et al. , unpublished, e-print quant-ph/9811018 . - · arXiv
- [24][24] That entanglement is the 'essential non-classical feature providing the computational speed-up in the known quantum algorithms' is argued forcefully by A. Ekert and R. Jozsa, Phil. Trans. Roy. Soc. London A 356 , 1769 (1998). -
- Authors
- Schack, R., & Caves, C. M.
- Affiliations
- University of New Mexico (US)
- ORCID
- Caves, Carlton M.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1999-12-01
- Volume
- 60
- Issue
- 6
- Pages
- 4354-4362
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2084941651
- Cited by
- 76
- References
- 30
- Citations by year
- 2024: 1 · 2023: 1 · 2020: 2 · 2019: 1 · 2018: 2 · 2016: 2 · 2012: 2
- FWCI
- 12.83
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Engineering and Physical Sciences Research Council
- Office of Naval Research
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum gates, entangling gates, signal decay, three-qubit systems, quantum-classical distinction
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
