41 citations · 72 across the 4 of their papers we have counts for
4 papers
Trading locality for time: certifiable randomness from low-depth circuits
Matthew Coudron, Jalex Stark, Thomas Vidick
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propos…
Unconditional separation of finite and infinite-dimensional quantum correlations
Andrea Coladangelo, Jalex Stark
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 $\…
Robust self-testing for linear constraint system games
Andrea Coladangelo, Jalex Stark
We study linear constraint system (LCS) games over the ring of arithmetic modulo . We give a new proof that certain LCS games (the Mermin--Peres Magic Square and Magic Pentagram…
Separation of finite and infinite-dimensional quantum correlations, with infinite question or answer sets
Andrea Coladangelo, Jalex Stark
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…