CoChat

The quantum challenge to structural complexity theory

Berthiaume, A., Brassard, G. · 2003 · [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
Cited by 73

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

Abstract

A nontechnical survey of recent quantum-mechanical discoveries that challenge generally accepted complexity-theoretic versions of the Church-Turing thesis is presented. In particular, the authors construct an oracle relative to which there exists a set that can be recognized in quantum polynomal time (QP), yet any Turing machine that recognizes it would require exponential time even if allowed to be probabilistic, provided that errors are not tolerated. In particular, QP is not contained in or equal to ZPP relative to this oracle. Furthermore, there are cryptographic tasks that are demonstrably impossible to implement with unlimited computing power probabilistic interactive turning machines, yet they can be implemented even in practice by quantum mechanical apparatus.>

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.1109/sct.1992.215388

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.

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

Cited by

See all 73

Metadata

Authors
Berthiaume, A., & Brassard, G.
Venue
[1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference
Published
2003-01-02
Pages
132-137
OpenAlex
W2156313614
Cited by
73
References
4
FWCI
2.21
Type
conference paper
Language
en
Open access
closed

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: The quantum challenge to structural complexity theory. https://app.cochat.ai/papers/10.1109/sct.1992.215388
The paper
Berthiaume, A., & Brassard, G. (2003). The quantum challenge to structural complexity theory. [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference. https://doi.org/10.1109/sct.1992.215388

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.