Publication | Closed Access
Two-Message Quantum Interactive Proofs Are in PSPACE
45
Citations
42
References
2009
Year
Unknown Venue
Mathematical ProgrammingQuantum ScienceQuantum CryptographyQuantum SecurityCertain ClassQuantum ComputingEngineeringSemidefinite ProgramsAutomated ReasoningQuantum Optimization AlgorithmPost-quantum CryptographyEfficient Parallel AlgorithmQuantum AlgorithmComputational ComplexityComputer ScienceDiscrete MathematicsQuantum EntanglementQuantum Algorithms
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 matrix multiplicative weights update method, for approximately solving a certain class of semidefinite programs.
| Year | Citations | |
|---|---|---|
Page 1
Page 1