CoChat

Polynomial-Time Simulation of Pairing Models on a Quantum Computer

Open access
Wu, L.-A., Byrd, M. S., Lidar, D. A. · 2002 · Physical Review Letters
Cited by 108

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

Abstract

We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between the ground and the first excited states and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultrasmall metallic grains.

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.

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

Integrity signals

Registry

Crossref · 10.1103/physrevlett.89.057904

Cites

10 of 10 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.

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.

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 10 references

Cited by

See all 108

Metadata

Authors
Wu, L.-A., Byrd, M. S., & Lidar, D. A.
Venue
Physical Review Letters
Published
2002-07-16
Volume
89
Issue
5
Pages
057904-057904
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2061741118
Cited by
108
References
10
FWCI
3.68
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: Polynomial-Time Simulation of Pairing Models on a Quantum Computer. https://app.cochat.ai/papers/10.1103/physrevlett.89.057904
The paper
Wu, L.-A., Byrd, M. S., & Lidar, D. A. (2002). Polynomial-Time Simulation of Pairing Models on a Quantum Computer. Physical Review Letters. https://doi.org/10.1103/physrevlett.89.057904

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.