Quantum interactive proofs with weak error bounds

Tsuyoshi Ito, H. K., & Watrous, J. (2010). Quantum interactive proofs with weak error bounds.

Type

Unclassified

Intellectual base

Unclassified

Year

2010

Link

no authoritative link yet

Cited by

1 citation across 1 artifact.

Domain-specific

• Interactive proof system
  • … observable transfers from In graph nonisomorphism, a verifier hides which graph it permuted and tests whether the prover can identify the source repeatedly. to A protocol states adversarial prover power, randomness, round count and amplification and does not confuse computational with information-theoretic soundness..

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:5059a828b2b7 · see in the full table