Complexity Limitations on Quantum Computation

Lance Fortnow, J. D. R. (1651). Complexity Limitations on Quantum Computation.

Type

Unclassified

Intellectual base

Unclassified

Year

1651

DOI

10.1006/jcss.1999.1651

Link

https://doi.org/10.1006/jcss.1999.1651

Cited by

1 citation across 1 artifact.

Domain-specific

• AWPP
  • Almost Wide Probabilistic Polynomial-Time contains BQP and lies inside PP; definitions choose a GapP numerator and efficiently computable positive denominator whose ratio stays in separated intervals for yes and no instances.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:d637950f1641 · see in the full table