CoChat

Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy

Open access
Fenner, Stephen, Green, Frederic, Homer, Steven, Pruim, Randall · 1999 · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Cited by 68

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

Abstract

It is shown that determining whether a quantum computation has a non–zero probability of accepting is at least as hard as the polynomial–time hierarchy. This hardness result also applies to determining in general whether a given quantum basis state appears with non–zero amplitude in a superposition, or whether a given quantum bit has positive expectation value at the end of a quantum computation. This result is achieved by showing that the complexity class NQP (a quantum analogue of NP) of Adleman, Demarrais and Huang, is equal to the counting class coC=P.

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.1098/rspa.1999.0485

Cites

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

Cited by

Metadata

Authors
Fenner, S., Green, F., Homer, S., & Pruim, R.
Venue
Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
Published
1999-11-08
Volume
455
Issue
1991
Pages
3953-3966
ISSN
  • 1364-5021 (ISSN-L)
  • 1471-2946
OpenAlex
W2111166346
Cited by
68
References
8
FWCI
6.51
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

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.