verifying quantum proofs with entangled games
Published Streamed 6 years ago • 967 plays • Length 1:03:49Download video MP4
Download video MP3
Similar videos
-
1:52:15
the power of unentangled quantum proofs with non-negative amplitudes | quantum colloquium
-
1:06:22
compiled nonlocal games: from chsh to bqp verification
-
32:33
parallel repetition of entangled games with exponential decay via the superposed information cost
-
1:02:30
the role of proofs in mip* = re | quantum colloquium
-
55:19
a tale of turing machines, quantum-entangled particles, and operator algebras
-
28:49
does quantum entanglement allow for faster-than-light communication?
-
52:43
peter shor - quantum computing - green family lecture at ipam at ucla
-
2:17:07
scott aaronson: the greatest unsolved problem in math
-
55:57
self-testing as an approach to certifying quantum systems
-
49:23
forcing trust: nonlocal games and untrusted-device cryptography
-
39:24
blind and verifiable quantum computation
-
44:51
classical verification of quantum computational advantage
-
1:10:10
mip* = re part 1: the quantum low-degree test
-
29:03
a parallel repetition theorem for entangled two-player one-round games under product distributions
-
35:36
from photonic quantum cloud computing to interactive proofs
-
31:40
beating classical impossibility of position verification
-
1:01:16
cross-platform verification of intermediate scale quantum devices with randomized measurements
-
45:16
non-interactive verifiable computation via non-signaling
-
28:59
parallel repetition for entangled games via fast quantum search
-
44:53
panel discussion on the role of proofs in mip* = re | quantum colloquium