/explore
|
You are here 
|
users.cms.caltech.edu | ||
| | | | |
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... | |
| | | | |
quantumfrontiers.com
|
|
| | | | | Summer is a great time for academics. Imagine: three full months off! Hit the beach. Tune that golf pitch. Hike the sierras. Go on a cruise. Watch soccer with the brazilenos (there's been better years for that one). Catch the sunset by the Sydney opera house. Take a nap. Think that's outrageous? We have it... | |
| | | | |
barghouthi.github.io
|
|
| | | |||
