thomas vidick: connes embedding problem, tsirelson’s problem, and mip^{∗} = re
Published Streamed 2 years ago • 682 plays • Length 45:26Download video MP4
Download video MP3
Similar videos
-
1:08:16
connes embedding problem, kirchberg's conjecture and tsirelson's problem - thomas vidick
-
54:18
qip2021 | tsirelson's problem and mip*=re (thomas vidick)
-
51:05
william slofstra:tsirelson’s problem & an embedding theorem for groups arising from non-local games
-
59:49
mip* = re
-
46:56
hari bercovici: conjectures related to the connes embedding problem
-
4:49
conne's embedding conjecture disproved|latest news you might have missed
-
1:05:09
from nonlocal games to undecidability - thomas vidick
-
40:15
cynthia dwork: the mathematics of privacy
-
18:03
dr. mathias sonnleitner | entropy numbers of finite-dimensional lorentz space embeddings
-
26:55
sebastian paeckel | from wheels to qubits: geometrically tuning the error rate
-
36:22
circuit-to-hamiltonian from tensor networks and fault tolerance
-
48:51
thomas vidick: a multiprover interactive proof system for the local hamiltonian problem
-
45:41
amit sahai, huijia (rachel) lin: the mathematics of hiding secrets in software
-
1:03:32
anand natarajan: neexp ⊆ mip*
-
43:06
junfeng li: the global well posedness for 3 d kadomtsev petviashvili ii problem
-
59:51
"testing quantum systems in the high-complexity regime", presented by thomas vidick, caltech
-
48:22
thomas vidick - the computational complexity of multiple entangled provers
-
58:03
quantum computing tutorials part 2: qubos and embedding