Algorithmic Pseudorandomness in Quantum Setups.

By A. Bendersky, Gonzalo de la Torre, Gabriel Senno, Santiago Figueira, Antonio Acín. 2014

12 citations recorded by the source corpus.

Many experimental setups in quantum physics use pseudorandomness in places where the theory requires randomness. In this Letter we show that the use of pseudorandomness instead of proper randomness in quantum setups has potentially observable consequences. First, we present a new loophole for Bell-like experiments: if some of the parties choose their measurements pseudorandomly, then the computational resources of the local model have to be limited in order to have a proper observation of nonlocality. Second, we show that no amount of pseudorandomness is enough to produce a mixed state by computably choosing pure states from some basis.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

In Computational Theory and Mathematics

Citations in the corpus

Bell Nonlocality (2013, background): “12If the process that is used to choose the inputs is pseudo-random, it is a finite-length algorithm and ultimately the players would be able to learn it (Bendersky et al., 2016).”