|
You are here |
users.cms.caltech.edu | ||
| | | | |
simons.berkeley.edu
|
|
| | | | | This workshop will focus on quantum interactive proofs and entangled quantum games. It will include recent advances in our understanding of the complexity class QMIP of multiple entangled provers, as well as QPIP, quantum polynomial time bounded provers. The workshop will also address quantum PCP from an interactive proof perspective. Enquiries may be sent to the organizers workshop_qhc1 [at] lists.simons.berkeley.edu (at this address.) | |
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | March Edition For our next favorite theorem, we look at the surprising power of provers who share entangled bits. If you can prove something... | |
| | | | |
mycqstate.wordpress.com
|
|
| | | | | In a previous post I reported on the beautiful recent result by Natarajan and Wright showing the astounding power of multi-prover interactive proofs with quantum provers sharing entanglement: in letters, $latex {\text{NEEXP} \subseteq \text{MIP}^\star}&fg=000000$. In this post I want to report on follow-up work with Ji, Natarajan, Wright, and Yuen, that we just posted to... | |
| | | | |
thomasbandt.com
|
|
| | | Analyzing quantum computing's impact on cryptography, this post briefly discusses challenges in encryption and advances in post-quantum cryptography, emphasizing the race for quantum-resistant security. | ||