CoChat

Quantum computing and polynomial equations over Z_2

Dawson, C.M., Haselgrove, H.L., Hines, A.P., Mortimer, D., Nielsen, M.A., Osborne, T.J. · 2005 · Quantum Information and Computation
Cited by 25

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

Abstract

What is the computational power of a quantum computer? We show that determining the output of a quantum computation is equivalent to counting the number of solutions to an easily computed set of polynomials defined over the finite field Z_2. This connection allows simple proofs to be given for two known relationships between quantum and classical complexity classes, namely BQP/P/\#P and BQP/PP.

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.26421/qic5.2-2

Cites

6 of 6 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 6 references

Cited by

See all 25

Metadata

Authors
Dawson, C. M., Haselgrove, H. L., Hines, A. P., Mortimer, D., Nielsen, M. A., & Osborne, T. J.
Venue
Quantum Information and Computation
Publisher
Rinton Press
Published
2005-05
Volume
5
Issue
2
Pages
102-112
ISSN
1533-7146 (ISSN-L)
OpenAlex
W3147651060
Cited by
25
References
6
FWCI
1.72
Type
journal article
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: Quantum computing and polynomial equations over Z_2. https://app.cochat.ai/papers/10.26421/qic5.2-2
The paper
Dawson, C. M., Haselgrove, H. L., Hines, A. P., Mortimer, D., Nielsen, M. A., & Osborne, T. J. (2005). Quantum computing and polynomial equations over Z_2. Quantum Information and Computation. https://doi.org/10.26421/qic5.2-2

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.