Simulating quantum correlations as a distributed sampling problem (9 pages)

Maciej Lewenstein, Norbert Lütkenhaus, Otfried Gühne +1 more

C. E. González-Guillén, C. H. Jiménez, C. Palazuelos +1 more

Julien Degorre, Sophie Laplante, Jérémie Roland

It is known that quantum correlations exhibited by a maximally entangled qubit pair can be simulated with the help of shared randomness, supplemented with additional resources, such as communication, postselection or nonlocal boxes. For instance, in the case of projective measurements, it is possible to solve this problem with protocols using one bit of communication or making one use of a nonlocal box. We show that this problem reduces to a distributed sampling problem. We give a new method to obtain samples from a biased distribution, starting with shared random variables following a uniform distribution, and use it to build distributed sampling protocols. This approach allows us to derive, in a simpler and unified way, many existing protocols for projective measurements, and extend them to positive operator value measurements. Moreover, this approach naturally leads to a local hidden variable model for Werner states.

Niyusha Hosseini, Maximilian P. E. Lock

The time-of-arrival problem asks for the probability distribution for when a quantum particle reaches a specified location. It has been the subject of decades of debate, exemplifying the lack of a self-adjoint time observable in quantum theory. In the Page-Wootters framework, time is a relational quantity, emerging from correlations between a system and a clock induced by a global Hamiltonian constraint. We construct a time-of-arrival distribution by inverting the Page-Wootters approach, asking what time a clock reads given that the particle arrives at some fixed position. The result coincides with a common approach to the time-of-arrival problem, suggesting a potential relational interpretation of the latter. In addition to providing a relational description of the time-of-arrival problem, this gives an application of the Page-Wootters formalism to a concrete physical problem, and reveals some complications with its canonical interpretation as a theory of conditional probabilities.

González Guillén, Carlos Eduardo, Jiménez Gómez, Carlos Hugo, Carlos Palazuelos +1 more

Anindya De, Elchanan Mossel, Joe Neeman

A basic problem in information theory is the following: Let P = (X, Y) be an arbitrary distribution where the marginals X and Y are (potentially) correlated. Let Alice and Bob be two players where Alice gets samples {xi}i≥1 and Bob gets samples {yi}i≥i and for all i, (xi,yi) ∼ P. What joint distributions Q can be simulated by Alice and Bob without any interaction? Classical works in information theory by Gács-Körner and Wyner answer this question when at least one of P or Q is the distribution Eq (Eq is defined as uniform over the points (0, 0) and (1, 1)). However, other than this special case, the answer to this question is understood in very few cases. Recently, Ghazi, Kamath and Sudan showed that this problem is decidable for Q supported on {0, 1} × {0, 1}. We extend their result to Q supported on any finite alphabet. Moreover, we show that If Q can be simulated, our algorithm also provides a (non-interactive) simulation protocol. We rely on recent results in Gaussian geometry (by the authors) as well as a new smoothing argument inspired by the method of boosting from learning theory and potential function arguments from complexity theory and additive combinatorics.