4 citations · 5 across the 5 of their papers we have counts for
6 papers · 1 filter
A commuting operator self-test for exact entanglement embezzlement
Connor Paddock, Simon Schmidt
We show that the optimal commuting operator correlation for a variant of Coladangelo's two-player generalized nonlocal game, based on the embezzlement of entanglement, is a commuti…
The NPA hierarchy does not always attain the commuting operator value
Marco Fanizza, Larissa Kroell, Arthur Mehta +4
We show that it is undecidable to determine whether the commuting operator value of a nonlocal game is strictly greater than 1/2. Specifically, there is a computable mapping from T…
Quantitative Quantum Soundness for Bipartite Compiled Bell Games via the Sequential NPA Hierarchy
Igor Klep, Connor Paddock, Marc-Olivier Renou +4
Compiling Bell games under cryptographic assumptions replaces the need for physical separation, allowing nonlocality to be probed with a single untrusted device. While Kalai et al.…
A bound on the quantum value of all compiled nonlocal games
Alexander Kulpe, Giulio Malavolta, Connor Paddock +2
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 com…
Self-testing in the compiled setting via tilted-CHSH inequalities
Arthur Mehta, Connor Paddock, Lewis Wooltorton
This work investigates the family of extended tilted-CHSH inequalities in the single-prover cryptographic compiled setting. In particular, we show that a quantum polynomial-time pr…
A Computational Tsirelson's Theorem for the Value of Compiled XOR Games
David Cui, Giulio Malavolta, Arthur Mehta +5
Nonlocal games are a foundational tool for understanding entanglement and constructing quantum protocols in settings with multiple spatially separated quantum devices. In this work…