Quantum randomness and value indefiniteness
نویسندگان
چکیده
As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable.
منابع مشابه
A quantum random number generator certified by value indefiniteness
In this paper we propose a quantum random number generator (QRNG) which utilises an entangled photon pair in a Bell singlet state, and is certified explicitly by value indefiniteness. While “true randomness” is a mathematical impossibility, the certification by value indefiniteness ensures the quantum random bits are incomputable in the strongest sense. This is the first QRNG setup in which a p...
متن کاملOn the Unpredictability of Individual Quantum Measurement Outcomes
We develop a general, non-probabilistic model of prediction which is suitable for assessing the (un)predictability of individual physical events. We use this model to provide, for the first time, a rigorous proof of the unpredictability of a class of individual quantum measurement outcomes, a well-known quantum attribute postulated or claimed for a long time. We prove that quantum indeterminism...
متن کاملCDMTCS Research Report Series Bertlmann’s chocolate balls and quantum type cryptography
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This featur...
متن کاملCryptography with quanta and chocolate balls
Some quantum cryptographic protocols can be implemented with specially prepared chocolate balls, others protected by value indefiniteness cannot. Similarities and differences of cryptography with quanta and chocolate are discussed. Motivated by these considerations it is proposed to certify quantum random number generators and quantum cryptographic protocols by value indefiniteness. This featur...
متن کاملNon-contextual chocolate ball versus value indefinite quantum cryptography
Some quantum cryptographic protocols can be implemented with specially prepared metaphorical chocolate balls representing local hidden variables, others protected by value indefiniteness cannot. This latter feature, which follows from Belland Kochen-Specker type arguments, is only present in systems with three or more mutually exclusive outcomes. Conversely, there exist local hidden variable mo...
متن کامل