Pith. sign in

REVIEW 1 cited by

Two-message quantum interactive proofs are in PSPACE

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0905.1300 v1 pith:MYL2GYZ7 submitted 2009-05-08 cs.CC quant-ph

Two-message quantum interactive proofs are in PSPACE

Rahul Jain , Sarvagya Upadhyay , John Watrous This is my paper
classification cs.CC quant-ph
keywords classinteractivepspacequantumtwo-messagealgorithmapproximatelycertain
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient parallel algorithm, based on the multiplicative weights update method, for approximately solving a certain class of semidefinite programs.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A slightly improved upper bound for quantum statistical zero-knowledge

    quant-ph 2025-12 conditional novelty 5.0

    QSZK and its non-interactive variant NIQSZK stay inside QIP(2)∩co-QIP(2), now with an honest prover that runs in quantum linear space and single-exponential time.