Proceedings of the forty-second ACM symposium on Theory of computing
Entangled Games Are Hard to Approximate
SIAM Journal on Computing
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
FOCS '12 Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
| Hi-index | 48.22 |
Researchers are making headway with one of quantum computing's major theoretical problems: multi-prover interactive proofs.