thomas vidick - the computational complexity of multiple entangled provers
Published 12 years ago • 1.5K plays • Length 48:22Download video MP4
Download video MP3
Similar videos
-
57:45
thomas vidick- the complexity of entangled games
-
7:12
what is a qubit? - a beginner's guide to quantum computing
-
54:18
qip2021 | tsirelson's problem and mip*=re (thomas vidick)
-
45:26
thomas vidick: connes embedding problem, tsirelson’s problem, and mip^{∗} = re
-
57:03
thomas vidick - rigorous rg algorithms and area laws for low energy eigenstates in 1d
-
9:42
how the portal illusion works
-
9:59
quantum computers, explained with quantum physics
-
1:03:48
quantum computing - the qubit technology revolution
-
1:03:47
invited talk - thomas vidick
-
45:06
icpcu by henry yuen: a tale of turing machines, quantum-entangled particles, and operator algebras
-
1:32:58
quantum protocols i - thomas vidick
-
48:51
thomas vidick: a multiprover interactive proof system for the local hamiltonian problem
-
59:51
"testing quantum systems in the high-complexity regime", presented by thomas vidick, caltech
-
1:03:32
anand natarajan: neexp ⊆ mip*
-
28:29
thomas vidick - cs physics - alumni college 2016
-
59:24
quantum protocol iii. (thomas vidick)
-
56:30
mip* = re
-
0:48
unravel the complexity of quantum computing with classiq
-
8:49
what does it mean to be fast? -- quantum computing