Abstract
We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quantum proofs, each o...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have