Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 195

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Algorithmic cooling and scalable NMR quantum computers

Open access
Boykin, P. Oscar, Mor, Tal, Roychowdhury, Vwani, Vatan, Farrokh, Vrijen, Rutger·2002·Proceedings of the National Academy of Sciences

Abstract

We present here algorithmic cooling (via polarization heat bath)—a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by using a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented by using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Interestingly, the interaction with the environment, usually a most undesired interaction, is used here to our benefit, allowing a cooling mechanism. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in NMR experiments, and our “spin-refrigerating” method suggests that this is possible. The scaling of NMR ensemble computers is currently one of the main obstacles to building larger-scale quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

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.

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

Integrity signals

Registry

Crossref · 10.1073/pnas.241641898

Cites

4 of 4 references verified0 citation errors · 0 not checkable

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.

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

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

Show all 4 references

Research works printed but not linked: 11

  1. 10.1038/30687 · DOI · Paper page
  2. P O Boykin, T Mor, V Roychowdhury, F Vatan Algorithms on Ensemble Quantum Computers (Los Alamos National Laboratory, Los Alamos, NM, . (1999).
  3. L Grover Proc. 28th ACM Symp. Theor. Comput. (ACM Press, New York, , 212–219. (1996).
  4. 10.1126/science.277.5332.1688 · DOI · Paper page
  5. 10.1038/30094 · DOI
  6. 10.1103/PhysRevLett.83.1054 · DOI · Paper page
  7. 10.1063/1.125389 · DOI
  8. H Kurreck, B Kirste, W Lubitz Methods in Stereochemical Analysis, ed A P Marchand (VCH, New York, 1998).
  9. L J Schulman, U Vazirani Proc. 31st ACM Symp. Theor. Comput. (ACM Press, New York), pp. 322–329 (1999).
  10. R B Ash Information Theory (Dover, New York, 1990).
  11. 10.1002/0471200611 · DOI · Paper page

Cited by

See all 195

Metadata

Authors
Boykin, P. O., Mor, T., Roychowdhury, V., Vatan, F., & Vrijen, R.
Venue
Proceedings of the National Academy of Sciences
Published
2002-03-19
Volume
99
Issue
6
Pages
3388-3393
ISSN
  • 0027-8424 (ISSN-L)
  • 1091-6490
OpenAlex
W1993717653
Cited by
195
References
4
FWCI
5.69
Type
journal article
Language
en
Open access
green

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: Algorithmic cooling and scalable NMR quantum computers. https://app.cochat.ai/papers/10.1073/pnas.241641898
The paper
Boykin, P. O., Mor, T., Roychowdhury, V., Vatan, F., & Vrijen, R. (2002). Algorithmic cooling and scalable NMR quantum computers. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.241641898

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.