Cited by 43Quantum Mechanics and ApplicationsQuantum Information and CryptographyQuantum Computing Algorithms and Architecture

Local Realistic Model for the Dynamics of Bulk-Ensemble NMR Information Processing

Open access
Menicucci, N. C., Caves, Carlton M.·2002·Physical Review Letters

Abstract

We construct a local realistic hidden-variable model that describes the states and dynamics of bulk-ensemble NMR information processing up to about 12 nuclear spins. The existence of such a model rules out violation of any Bell inequality, temporal or otherwise, in present high-temperature, liquid-state NMR experiments. The model does not provide an efficient description in that the number of hidden variables grows exponentially with the number of nuclear spins.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.88.167901

Cites

25 of 25 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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 liquid NMR demonstration, because the qubits are at all times in a highly mixed state and the dynamics can be fully modelled classically, neither the entanglement nor the coherent control at the core of Shor's algorithm can be implemented or verified.

    “However, since the qubits are at all times in a highly mixed state [15], and the dynamics can be fully modelled classically [16], neither the entanglement nor the coherent control at the core of Shor's algorithm can be implemented or verified.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 4

  1. [2][2] D. G. Cory, A. F. Fahmy, and T. F. Havel, Proc. Natl. Acad. Sci. U.S.A. 94 , 1634 (1997). -
  2. [12][12] A. Ekert and R. Jozsa, Phil. Trans. Roy. Soc. London A 356 , 1769 (1998). The authors argue that entanglement is the 'essential non-classical feature providing the computational speed-up in the known quantum algorithms.' -
  3. [14][14] D. Poulin, unpublished, arXiv.org e-print quant-ph/0108102 . - · arXiv
  4. [20][20] D. G. Cory, M. D. Price, and T. F. Havel, Physica D 120 , 82 (1998); I. L. Chuang, N. Gershenfeld, M. G. Kubinec, and D. W. Leung, Proc. Roy. Soc. London A 454 , 447 (1998); E. Knill, I. Chuang, and R. Laflamme, Phys. Rev. A 57 , 3348 (1998). -

Cited by

Sorted by citations

Authors
Menicucci, N. C., & Caves, C. M.
Affiliations
University of New Mexico (US)
Venue
Physical Review Letters
Published
2002-04-04
Volume
88
Issue
16
Pages
167901-167901
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1968756365
Cited by
43
References
25
Citations by year
2026: 1 · 2025: 1 · 2024: 3 · 2023: 1 · 2021: 1 · 2020: 2 · 2019: 2 · 2018: 1 · 2017: 2 · 2015: 1 · 2014: 1 · 2013: 5 · 2012: 4
FWCI
1.34
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
local realistic models, hidden variable models, Bell inequality violation, quantum state dynamics, nuclear spin ensembles, quantum foundations

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