Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Stark, Jalex"'
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a si
Externí odkaz:
http://arxiv.org/abs/1810.04233
Autor:
Coladangelo, Andrea, Stark, Jalex
Determining the relationship between quantum correlation sets is a long-standing open problem. The most well-studied part of the hierarchy is captured by the chain of inclusions $\mathcal C_q \subseteq \mathcal C_{qs} \subsetneq \mathcal C_{qa} \subs
Externí odkaz:
http://arxiv.org/abs/1804.05116
Autor:
Coladangelo, Andrea, Stark, Jalex
We study linear constraint system (LCS) games over the ring of arithmetic modulo $d$. We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram over binary alphabets, together with parallel repetitions of these) h
Externí odkaz:
http://arxiv.org/abs/1709.09267
Autor:
Coladangelo, Andrea, Stark, Jalex
Completely determining the relationship between quantum correlation sets is a long-standing open problem, known as Tsirelson's problem. Following recent progress by Slofstra [arXiv:1606.03140 (2016), arXiv:1703.08618 (2017)] only two instances of the
Externí odkaz:
http://arxiv.org/abs/1708.06522
Autor:
Coudron, Matthew1 (AUTHOR), Stark, Jalex2 (AUTHOR), Vidick, Thomas3 (AUTHOR) vidick@caltech.edu
Publikováno v:
Communications in Mathematical Physics. Feb2021, Vol. 382 Issue 1, p49-86. 38p.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.