PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
PSPACE Has Constant-Round Quantum Interactive Proof Systems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
An application of quantum finite automata to interactive proof systems
Journal of Computer and System Sciences
Finite state verifiers with constant randomness
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
| Hi-index | 0.00 |