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

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

Limit on the Speed of Quantum Computation in Determining Parity

Open access
Farhi, Edward, Goldstone, Jeffrey, Gutmann, Sam, Sipser, Michael · 1998 · Physical Review Letters

Abstract

Consider a function $f$ which is defined on the integers from 1 to $N$ and takes the values $\ensuremath{-}1$ and $+1$. The parity of $f$ is the product over all $x$ from 1 to $N$ of $f(x)$. With no further information about $f$, to classically determine the parity of $f$ requires $N$ calls of the function $f$. We show that any quantum algorithm capable of determining the parity of $f$ contains at least $N/2$ applications of the unitary operator which evaluates $f$. Thus, for this problem, quantum computers cannot outperform classical computers.

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.1103/physrevlett.81.5442

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

Cited by

See all 181

Metadata

Authors
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M.
Venue
Physical Review Letters
Published
1998-12-14
Volume
81
Issue
24
Pages
5442-5444
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1980669364
Cited by
181
References
4
FWCI
12.25
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: Limit on the Speed of Quantum Computation in Determining Parity. https://app.cochat.ai/papers/10.1103/physrevlett.81.5442
The paper
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (1998). Limit on the Speed of Quantum Computation in Determining Parity. Physical Review Letters. https://doi.org/10.1103/physrevlett.81.5442

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.