Zhengfeng Ji: Compression of quantum multi-prover interactive proofs
528
17.6
Microsoft Research334 тыс
Следующее
01.02.17 – 82937:30Популярные
82 дня – 1 52959:42
258 дней – 2 44140:43Опубликовано 1 февраля 2017, 0:31
"We present a protocol that transforms any quantum multi-prover
interactive proof into a nonlocal game in which questions consist of
logarithmic number of bits and answers of constant number of bits.
As a corollary, this proves that the promise problem corresponding to
the approximation of the nonlocal value to inverse polynomial accuracy
is complete for QMIP, and therefore NEXP-hard.
This establishes that nonlocal games are provably harder than
classical games without any complexity theory assumptions.
Our result also provides a strong negative evidence for the multi-prover
variant of the quantum PCP conjecture."
interactive proof into a nonlocal game in which questions consist of
logarithmic number of bits and answers of constant number of bits.
As a corollary, this proves that the promise problem corresponding to
the approximation of the nonlocal value to inverse polynomial accuracy
is complete for QMIP, and therefore NEXP-hard.
This establishes that nonlocal games are provably harder than
classical games without any complexity theory assumptions.
Our result also provides a strong negative evidence for the multi-prover
variant of the quantum PCP conjecture."
Свежие видео
5 дней – 137 14926:46
6 дней – 90 13610:40
16 дней – 2300:19
17 дней – 14 1780:13
18 дней – 23 9402:30
23 дня – 8300:59Случайные видео
248 дней – 1 3421:38
17.07.23 – 89710:24
29.05.23 – 165 5240:54
05.06.22 – 39 6935:38
28.12.20 – 13 5133:55
13.03.11 – 8914:29
3 дня – 7770:28
3 дня – 5480:49
5 дней – 23113:04
5 дней – 4504:50
6 дней – 30 05612:15
6 дней – 42024:48
15 часов – 818 22323:46