Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Paddock, Connor"'
A cryptographic compiler introduced by Kalai et al. (STOC'23) converts any nonlocal game into an interactive protocol with a single computationally bounded prover. Although the compiler is known to be sound in the case of classical provers and comple
Externí odkaz:
http://arxiv.org/abs/2408.06711
Quantum homomorphic encryption (QHE), allows a quantum cloud server to compute on private data as uploaded by a client. We provide a proof-of-concept software simulation for QHE, according to the "EPR" scheme of Broadbent and Jeffery, for universal q
Externí odkaz:
http://arxiv.org/abs/2406.16247
In a Bell scenario, a classical verifier interacts with two non-communicating provers, producing a correlation. Certain correlations allow the verifier to certify, or self-test, the underlying quantum state and measurements. Notably, the family of ti
Externí odkaz:
http://arxiv.org/abs/2406.04986
Autor:
Cui, David, Malavolta, Giulio, Mehta, Arthur, Natarajan, Anand, Paddock, Connor, Schmidt, Simon, Walter, Michael, Zhang, Tina
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work, we continue the study initiated by Kalai et al. (STOC '23) of compil
Externí odkaz:
http://arxiv.org/abs/2402.17301
Autor:
Paddock, Connor, Slofstra, William
Mermin and Peres showed that there are boolean constraint systems (BCSs) which are not satisfiable, but which are satisfiable with quantum observables. This has led to a burgeoning theory of quantum satisfiability for constraint systems, connected to
Externí odkaz:
http://arxiv.org/abs/2310.07901
Publikováno v:
Annales Henri Poincar\'e (2023)
We give a new definition of self-testing for correlations in terms of states on $C^*$-algebras. We show that this definition is equivalent to the standard definition for any class of finite-dimensional quantum models which is closed, provided that th
Externí odkaz:
http://arxiv.org/abs/2301.11291
The perfect quantum strategies of a linear system game correspond to certain representations of its solution group. We study the solution groups of graph incidence games, which are linear system games in which the underlying linear system is the inci
Externí odkaz:
http://arxiv.org/abs/2205.04645
Autor:
Paddock, Connor
We establish approximate rigidity results for boolean constraint system (BCS) nonlocal games. In particular, we show that near-perfect quantum strategies are approximate representations of the corresponding BCS algebra in the little Frobenius norm. L
Externí odkaz:
http://arxiv.org/abs/2203.02525
Autor:
Paddock, Connor, Chen, Jianxin
This paper provides a characterization for the set of antidegradable qubit channels. The characterization arises from the correspondence between the antidegradability of a channel and the symmetric extendibility of its Choi operator. Using an inequal
Externí odkaz:
http://arxiv.org/abs/1712.03399
Publikováno v:
Annales Henri Poincaré; Oct2024, Vol. 25 Issue 10, p4283-4319, 37p
