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 single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using a (classical or quantum) circuit of sub-logarithmic depth. This assumption contrasts with the locality assumption used for randomness certification based on Bell inequality violation and more recent proposals for randomness certification based on computational assumptions. Furthermore, to demonstrate randomness generation it is sufficient for a device to sample from the ideal output distribution within constant statistical distance.Our procedure is inspired by recent work of Bravyi et al. (Science 2018), who introduced a relational problem that can be solved by a constant-depth quantum circuit, but provably cannot be solved by any classical circuit of sub-logarithmic depth. We develop the discovery of Bravyi et al. into a framework for robust randomness expansion. Our results leads to a new proposal for a demonstrated quantum advantage that has some advantages compared to existing proposals. First, our proposal does not rest on any complexity-theoretic conjectures, but relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth. Second, success on our task can be easily verified in classical linear time. Finally, our task is more noise-tolerant than most other existing proposals that can only tolerate multiplicative error, or require additional conjectures from complexity theory; in contrast, we are able to allow a small constant additive error in total variation distance between the sampled and ideal distributions.

Bell's theorem, a landmark result in the foundations of physics, establishes that quantum mechanics is a non-local theory. It asserts, in particular, that two spatially separated, but entangled, quantum systems can be correlated in a way that cannot be mimicked by classical systems. A direct operational consequence of Bell's theorem is the existence of statistical tests which can detect the presence of entanglement. Remarkably, certain correlations not only witness entanglement, but they give quantitative bounds on the minimum dimension of quantum systems attaining them. In this work, we show that there exists a correlation which is not attainable by quantum systems of any arbitrary finite dimension, but is attained exclusively by infinite-dimensional quantum systems (such as infinite-level systems arising from quantum harmonic oscillators). This answers the long-standing open question about the existence of a finite correlation witnessing infinite entanglement.

Completely determining the relationship between quantum correlation sets is a long-standing open problem, known as Tsirelson's problem. Following recent progress by Slofstra [Slo16, Slo17], only two instances of the problem remain open. One of them is the question of whether the set of finite-dimensional quantum correlations is strictly contained in the set of infinite-dimensional ones (i.e. whether Cq = Cqs). The usual formulation of the question assumes finite question and answer sets. In this work, we show that, when one allows for either infinite answer sets (and finite question sets) or infinite question sets (and finite answer sets), there exist correlations that are achievable using an infinite-dimensional quantum strategy, but not a finite-dimensional one. For the former case, our proof exploits a recent result [CGS17], which shows self-testing of any pure bipartite entangled state of arbitrary local dimension d, using question sets of size 3 and 4 and answer sets of size d. For the latter case, a key step in our proof is to show a novel self-test, inspired by [CGS17], of all bipartite entangled states of any local dimension d, using question sets of size O(d), and answer sets of size 4 and 3 respectively.

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 single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using a (classical or quantum) circuit of sub-logarithmic depth. This assumption contrasts with the locality assumption used for randomness certification based on Bell inequality violation and more recent proposals for randomness certification based on computational assumptions. Furthermore, to demonstrate randomness generation it is sufficient for a device to sample from the ideal output distribution within constant statistical distance. Our procedure is inspired by recent work of Bravyi et al. (Science 362(6412):308–311, 2018), who introduced a relational problem that can be solved by a constant-depth quantum circuit, but provably cannot be solved by any classical circuit of sub-logarithmic depth. We develop the discovery of Bravyi et al. into a framework for robust randomness expansion. Our results lead to a new proposal for a demonstrated quantum advantage that has some advantages compared to existing proposals. First, our proposal does not rest on any complexity-theoretic conjectures, but relies on the physical assumption that the adversarial device being tested implements a circuit of sub-logarithmic depth. Second, success on our task can be easily verified in classical linear time. Finally, our task is more noise-tolerant than most other existing proposals that can only tolerate multiplicative error, or require additional conjectures from complexity theory; in contrast, we are able to allow a small constant additive error in total variation distance between the sampled and ideal distributions.