The complexity of promise problems with applications to public-key cryptography
Information and Control
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Probabilistic quantifiers vs. distrustful adversaries
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science - Algorithms,automata, complexity and games
Succinct quantum proofs for properties of finite groups
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Classical and Quantum Computation
Classical and Quantum Computation
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Computational Complexity
The detectability lemma and quantum gap amplification
Proceedings of the forty-first annual ACM symposium on Theory of computing
Zero-Knowledge against Quantum Attacks
SIAM Journal on Computing
Both Toffoli and controlled-NOT need little help to do universal quantum computing
Quantum Information & Computation
Quantum Information & Computation
On perfect completeness for QMA
Quantum Information & Computation
Another proof that BPP ⊆ PH (and more)
Studies in complexity and cryptography
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Achieving perfect completeness in classical-witness quantum merlin-arthur proof systems
Quantum Information & Computation
Hi-index | 0.00 |
This paper presents stronger methods of achieving perfect completeness in quantum interactive proofs. First, it is proved that any problem in QMA has a two-message quantum interactive proof system of perfect completeness with constant soundness error, where the verifier has only to send a constant number of halves of EPR pairs. This in particular implies that the class QMA is necessarily included by the class QIP1(2)} of problems having two-message quantum interactive proofs of perfect completeness, which gives the first nontrivial upper bound for QMA in terms of quantum interactive proofs. It is also proved that any problem having an $m$-message quantum interactive proof system necessarily has an ${(m+1)}$-message quantum interactive proof system of perfect completeness. This improves the previous result due to Kitaev and Watrous, where the resulting system of perfect completeness requires ${m+2}$ messages if not using the parallelization result.