|
You are here |
algassert.com | ||
| | | | |
quantumcomputinginc.com
|
|
| | | | | ||
| | | | |
www.kuniga.me
|
|
| | | | | NP-Incompleteness: Introduction to quantum computing and the Deutsch-Jozsa Algorithm | |
| | | | |
barghouthi.github.io
|
|
| | | | | ||
| | | | |
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.) | ||