Algorithmic Pseudorandomness in Quantum Setups.

@article{Bendersky2016AlgorithmicPI,
  title={Algorithmic Pseudorandomness in Quantum Setups.},
  author={Ariel Bendersky and Gonzalo de la Torre and Gabriel Senno and Santiago Figueira and Antonio Ac{\'i}n},
  journal={Physical review letters},
  year={2016},
  volume={116 23},
  pages={
          230402
        }
}
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… 

Figures from this paper

Distinguishing computable mixtures of quantum states
In this article we extend results from our previous work [Bendersky et al., Phys. Rev. Lett. 116, 230402 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high
Randomness? What Randomness?
This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability,
Randomness and Non-Locality
The concepts of randomness and non-locality are intimately intertwined outcomes of randomly chosen measurements over entangled systems exhibiting non-local correlations are, if we preclude
3 0 Ju l 2 01 9 Randomness ? What randomness ?
This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability,
3 0 N ov 2 01 9 Randomness ? What randomness ?
This is a review of the issue of randomness in quantum mechanics, with special emphasis on its ambiguity; for example, randomness has different antipodal relationships to determinism, computability,
M ar 2 02 1 Indeterminism and Undecidability
The aim of this paper is to argue that the (alleged) indeterminism of quantum mechanics, claimed by adherents of the Copenhagen interpretation since Born (1926), can be proved from Chaitin’s
Algorithmic independence of initial condition and dynamical law in thermodynamics and causal inference
Wepostulate a principle stating that the initial condition of a physical system is typically algorithmically independent of the dynamical law.Wediscuss the implications of this principle and argue
Impossibility of memory in hidden-signaling models for quantum correlations
TLDR
This work considers a toy model for non-local quantum correlations in which nature resorts to some form of hidden signaling to generate correlations and shows that if such a model also had memory, the parties would be able to exploit the hidden-signaling and use it to send a message, achieving faster-than-light communication.
Indeterminism and Undecidability
The aim of this paper is to argue that the (alleged) indeterminism of quantum mechanics, claimed by adherents of the Copenhagen interpretation since Born (1926), can be proved from Chaitin's

References

SHOWING 1-10 OF 55 REFERENCES
Security of practical private randomness generation
TLDR
It is pointed out that in most real, practical situations, where the concept of device independence is used as a protection against unintentional flaws or failures of the quantum apparatuses, it is sufficient to show that the generated string is random with respect to an adversary that holds only classical side information; i.e., proving randomness against quantum side information is not necessary.
No extension of quantum theory can have improved predictive power
TLDR
This work says that no extension of quantum theory can give more information about the outcomes of future measurements than quantum theory itself, under the assumption that measurements can be chosen freely.
Effects of reduced measurement independence on Bell-based randomness expansion.
TLDR
A no-signaling model with reduced "free will" is considered and the adversary’s capabilities in the task of randomness expansion are bound.
Random numbers certified by Bell’s theorem
TLDR
It is shown that the non-local correlations of entangled quantum particles can be used to certify the presence of genuine randomness, and it is thereby possible to design a cryptographically secure random number generator that does not require any assumption about the internal working of the device.
The Physical Church-Turing Thesis and the Principles of Quantum Theory
TLDR
This approach exhibits a formal non-trivial interplay between theoretical physics symmetries and computability assumptions, and provides a quantum version of the Church-Turing theorem.
Generation of Fresh and Pure Random Numbers for Loophole-Free Bell Tests.
We demonstrate extraction of randomness from spontaneous-emission events less than 36 ns in the past, giving output bits with excess predictability below 10^{-5} and strong metrological randomness
How much measurement independence is needed to demonstrate nonlocality?
TLDR
A connection is demonstrated between models that weaken the assumption that measurement settings are freely chosen by the observers, allowing partial correlation, and models that allow classical communication between the distant parties, including models that exploit the detection loophole.
Quantum nonlocality, Bell inequalities, and the memory loophole
In the analysis of experiments designed to reveal violation of Bell-type inequalities, it is usually assumed that any hidden variables associated with the nth particle pair would be independent of
Experimental bound entanglement in a four-photon state.
TLDR
This work considers a one-parameter family of four-qubit Smolin states and experimentally produces these states in the polarization of four optical photons produced from parametric down-conversion, showing that they are entangled and undistillable, and thus bound entangled.
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
...
1
2
3
4
5
...