Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Certified Quantum Randomness

Serge Massar

Published Jan 1, 2017• 0 citations
OpenAlex

Abstract

Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.

Related papers

Security of practical private randomness generation

Stefano Pironio, Serge Massar

Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomness in a device-independent way, i.e., without making detailed assumptions about the internal working of the quantum devices used to generate the random numbers. Furthermore these numbers are also private; i.e., they appear random not only to the user but also to any adversary that might possess a perfect description of the devices. Since this process requires a small initial random seed to sample the behavior of the quantum devices and to extract uniform randomness from the raw outputs of the devices, one usually speaks of device-independent randomness expansion. The purpose of this paper is twofold. First, we point 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. Furthermore, the initial random seed does not need to be private with respect to the adversary, provided that it is generated in a way that is independent from the measured systems. The devices, however, will generate cryptographically secure randomness that cannot be predicted by the adversary, and thus one can, given access to free public randomness, talk about private randomness generation. The theoretical tools to quantify the generated randomness according to these criteria were already introduced in S. Pironio et al. [Nature (London) 464, 1021 (2010)], but the final results were improperly formulated. The second aim of this paper is to correct this inaccurate formulation and therefore lay out a precise theoretical framework for practical device-independent randomness generation.

arXiv:1111.6056•Physical Review A•Jan 30, 2013•169 citations

Genuine certifiable randomness from a black-box

Liam P. McGuinness

Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is truly random. However, existing demonstrations are not black-box, to avoid falsely certifying deterministic data, assumptions must be made on how the data was generated. Here we demonstrate genuine randomness certification in the black-box setting -- one in which no deterministic adversary, even with unlimited computational power, will succeed in getting their data certified. We use it to provably generate random numbers using only measurements on single particle states and without a random seed.

quant-pharXiv:2603.00401•Mar 3, 2026•0 citations

True randomness from realistic quantum devices

Daniela Frauchiger, Renato Renner, Matthias Troyer

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

arXiv:1311.4547•Nov 18, 2013•46 citations

Source-Independent Quantum Random Number Generation

Zhu Cao, Hongyi Zhou, Xiao Yuan +1 more

Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics.In general, a physical generator contains two parts-a randomness source and its readout.The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness.However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output.To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted.In our randomness analysis, we make no assumptions about the dimension of the source.For instance, multiphoton emissions are allowed in optical implementations.Our analysis takes into account the finite-key effect with the composable security definition.In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit.In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 × 10 3 bit=s.

arXiv:1508.04880•Physical Review X•Feb 25, 2016•153 citations

More Than One-bit Quantum Randomness Certification and Expansion

Amélie Piveteau, Alban Seguinard, Marcus Grünfeld +4 more

One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 23, 2025•0 citations

Quantum Information with Meaning Inside and Outside the Quantum

Alastair A. Abbott, Cristian S. Calude, Karl Svozil

The ability to transfer information securely is essential in the modern world we live in. While the field of cryptography has long researched ways to do this, events over the last couple of years have brought the issues of secure information transfer squarely into the public eye. As a consequence, security and cryptography have quickly become issues of social and political importance, sparking debates about the values of privacy and the role of government. An essential ingredient of modern cryptography is the generation of randomness: cryptographic techniques are built on the premise that one has access to random bits. It is well known, however, that computers cannot produce algorithmically random sequences – that is, sequences with maximal algorithmic information content – but are doomed to produce ‘pseudorandomness’. This lack of randomness can be, and has been, exploited to compromise security, see [4]. The active field of quantum information theory has proposed approaches to provide supposedly ‘unbreakable’ security by exploiting various quantum phenomena. This security unfortunately relies on assumptions about the nature of quantum measurements and their ability to generate random bits. Anton Zeilinger summarises this by postulating that the simplest quantum systems, qubit, can hold only one bit of classical information [6]. This foundational principle is in line with a wider paradigm shift to view quantum information as an extension of classical information, but it is nonetheless unsatisfying to simply postulate this principle, given its importance in determining the practical advantages of quantum information theory. In order to understand better how quantum mechanics can help generate meaningful information, we instead look to relate the outcomes of quantum measurements to formal properties of the system based on more fundamental assumptions. Indeed, we have shown that a) some of the postulated properties of quantum information follow from the formal structure of the theory and b) a purely formal notion of information within a quantum world can generate, via measurement, meaningful and useful information in the macroscopic world (for example, in cryptography). The indeterminism of quantum measurements can be formalised via the notion of value indefiniteness. To explain this concept, let us consider an arbitrary quantum system and ask whether the outcome of a measurement of any observable quantity A (such as the energy of the system, its angular momentum (spin), etc.) is determined prior to the measurement. If this is the case, then we say the observable is value definite with value v(A); otherwise, the observable is value indefinite and v(A) is undefined. Mathematically, one can reduce all observable quantities to so-called projection observables, which can only take the values 0 or 1. Thus, the question of whether the outcome of several measurements can be simultaneously determined in advance can be rephrased in terms of the information ‘carried’ by a particular system in a definite quantum state. Classically, one expects that all quantities are determined in advance, and hence all observables are value definite. Quantum mechanically, however, the belief is that this is not the case, and the information content of quantum systems is limited. Formulating carefully the notion of value indefiniteness allows us to formalise the notion of (quantum) indeterminism; however, this doesn’t help clarify whether quantum systems are indeed value indefinite or not. Staying in this formal framework, the Kochen-Specker theorem [5] provides a first positive result, showing that at least some observables must be value indefinite if one makes the assumption known as non-contextuality, which states that any definite values that exist must be independent of other compatible measurements that may or may not be performed on the system. Under the same assumption, this theorem can be strengthened to show that only one single observable can have the definite value 1 (see [2]). Furthermore, only observables that can be measured simultaneously with this single one can have the definite value 0; the rest must all be value indefinite. Since the preparation of a system involves precisely ensuring that, usually via measurement, the system is in a definite state with respect to some desired observable, this result shows that no other incompatible observable can be value definite. That is, preparing a system in a definite state by making the ‘preparation’ observable value definite specifies completely the information content of the quantum system. This is an example of syntactical quantum information acquiring meaning at the level of the quantum itself. Can the syntactical information at the level of the quantum generate meaning outside the quantum, that is, at the macroscopic level? The results cited above hold in the Hilbert-space framework of quantum mechanics and are formulated only in terms of a syntactical notion of information. Their real importance becomes evident when one interprets them in the context of quantum measurements. Specifically, if we prepare a quantum system in a known state, they allow us to ‘locate’ observables which we can measure, but which are value indefinite; that is, observables whose measurement results are not specified by any pre-existing property of the quantum system. Furthermore, with respect to a mathematical model of unpredictability which we developed in [3], the results of these measurements can be shown to be absolutely unpredictable. In this way we get a mathematical explanation and justification of the largely accepted intuition that quantum mechanics is inherently unpredictable, and that this unpredictability arises from the phenomenon of indefiniteness within the quantum world. Furthermore, if one considers a hypothetical infinite sequence generated by the repeated measurement of a quantum value indefinite observable, one can prove that these sequences must be strongly incomputable, technically ‘bi-immune’ [1]. Such sequences cannot be generated by any Turing machine or classical computer, showing that value indefiniteness leads to a clear classical/quantum split in a purely algorithmic context. Importantly, bi-immunity is a property of observed, macroscopic quantities, quite separate from the quantum framework in which the value indefiniteness is formalised. This form of macroscopic meaning created from the lack of syntactic information is precisely the scenario that quantum random number generators try to create, and which is essential for the development and certification of quantum cryptographic systems. The fact that the macroscopic information created goes beyond anything classically obtainable serves as a valuable practical resource, outside of and removed from the quantum formalism. To conclude, quantum information creates meaning within the quantum and via measure- ment, the lack of information within the quantum, creates meaning and valuable information at the macroscopic level. Acknowledgments The second author thanks Prof. S. Marcus for useful conversations on quantum information theory. This work was supported in part by Marie Curie FP7-PEOPLE-2010-IRSES Grant RANPHYS. References and Notes Abbott, A.A.; Calude, C.S.; Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. Physical Review A 2012, 86, 062109. Abbott, A.A.; Calude, C.S.; Svozil, K. Value-indefinite observables are almost everywhere. Physical Review A 2013, 89, 032109. Abbott, A.A.; Calude, C.S.; Svozil, K. On the unpredictability of individual quantum measurement outcomes. CDMTCS Research Report 2014, 458. Calude, C.S. Quantum randomness & cryptology. CyberTalk 2013, 3, 42–43. Kochen, S.; Specker, E. The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics 1967, 17, 59–87. Zeilinger, A. A foundational principle for quantum mechanics. Foundations of Physics 1999, 29(4),631–643.

ISIS Summit: The Information Society at the Crossroads•Jun 23, 2015•0 citations
Randomness is a phenomena which we are confronted with all the time. Will it rain today? Will the train be on time? What present(s) will I receive at Christmas? But are such phenomena truly random?Good randomness is essential for many applications. For instance, cryptography, the art of hiding information from malicious parties, is only as good as the sources of randomness that underlie it. Quantum mechanics, the theory of microscopic phenomena, can only predict the probability of events. For instance quantum theory can only predict the probability that a radioactive nucleus will decay, not when the nucleus will decay. Does this mean that microscopic phenomena are truly random?By studying systems of two entangled particles, it can be shown both theoretically and experimentally that events at the microscopic scale are truly random, truly unpredictable. Beyond its philosophical implications, this result also has important potential applications. Indeed it implies that one can build random number generators whose output is random and certifies that the device works correctly. That is, if the random number generator malfunctions in some way, if the numbers it produces cease to be random, this will automatically be detected. By extending this idea, one could also build quantum cryptographic systems and quantum computers that certify that they work correctly. We discuss the perspectives for practical implementations.
Measurements on entangled quantum systems necessarily yield outcomes that are intrinsically unpredictable if they violate a Bell inequality. This property can be used to generate certified randomness in a device-independent way, i.e., without making detailed assumptions about the internal working of the quantum devices used to generate the random numbers. Furthermore these numbers are also private; i.e., they appear random not only to the user but also to any adversary that might possess a perfect description of the devices. Since this process requires a small initial random seed to sample the behavior of the quantum devices and to extract uniform randomness from the raw outputs of the devices, one usually speaks of device-independent randomness expansion. The purpose of this paper is twofold. First, we point 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. Furthermore, the initial random seed does not need to be private with respect to the adversary, provided that it is generated in a way that is independent from the measured systems. The devices, however, will generate cryptographically secure randomness that cannot be predicted by the adversary, and thus one can, given access to free public randomness, talk about private randomness generation. The theoretical tools to quantify the generated randomness according to these criteria were already introduced in S. Pironio et al. [Nature (London) 464, 1021 (2010)], but the final results were improperly formulated. The second aim of this paper is to correct this inaccurate formulation and therefore lay out a precise theoretical framework for practical device-independent randomness generation.
Randomness is intrinsic to quantum mechanics; the outcome of a measurement on a quantum state is a random variable. This feature has been applied to randomness certification, where one party must decide whether the data they receive is truly random. However, existing demonstrations are not black-box, to avoid falsely certifying deterministic data, assumptions must be made on how the data was generated. Here we demonstrate genuine randomness certification in the black-box setting -- one in which no deterministic adversary, even with unlimited computational power, will succeed in getting their data certified. We use it to provably generate random numbers using only measurements on single particle states and without a random seed.
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics.In general, a physical generator contains two parts-a randomness source and its readout.The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness.However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output.To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted.In our randomness analysis, we make no assumptions about the dimension of the source.For instance, multiphoton emissions are allowed in optical implementations.Our analysis takes into account the finite-key effect with the composable security definition.In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit.In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 × 10 3 bit=s.
One of the striking properties of quantum mechanics is the occurrence of the Bell-type non-locality. They are a fundamental feature of the theory that allows two parties that share an entangled quantum system to observe correlations stronger than possible in classical physics. In addition to their theoretical significance, non-local correlations have practical applications, such as device-independent randomness generation, providing private unpredictable numbers even when obtained using devices delivered by an untrusted vendor. Thus, determining the quantity of certifiable randomness that can be produced using a specific set of non-local correlations is of significant interest. First, we present an experimental realization of recent Bell-type operators designed to provide private random numbers that are secure against adversaries with quantum resources. We use semi-definite programming to give lower bounds on the generated randomness in terms of both min-entropy and von Neumann entropy in a device-independent scenario. Our results demonstrate the first experiment that certifies nearly two bits of randomness from binary measurements of two parties [1], [2]. Apart from single-round certification, we provide an analysis of finite-key protocol for quantum randomness expansion using the Entropy Accumulation Theorem. Second, we present an efficient and practical method for certifying quantum randomness using generalized measurements. Indeed, we have derived a method for self-testing the presence of POVMs. We present the certification of more than one bit of min-entropy from a single POVM on one of the qubits of an entangled state using a variant of the elegant Bell inequality. We also obtain more than one bit of randomness in a prepare and measure scenario of a similar structure with a POVM on a single qubit [3]. We provide numerical simulations to demonstrate the effectiveness of our randomness certification and expansion.
The ability to transfer information securely is essential in the modern world we live in. While the field of cryptography has long researched ways to do this, events over the last couple of years have brought the issues of secure information transfer squarely into the public eye. As a consequence, security and cryptography have quickly become issues of social and political importance, sparking debates about the values of privacy and the role of government. An essential ingredient of modern cryptography is the generation of randomness: cryptographic techniques are built on the premise that one has access to random bits. It is well known, however, that computers cannot produce algorithmically random sequences – that is, sequences with maximal algorithmic information content – but are doomed to produce ‘pseudorandomness’. This lack of randomness can be, and has been, exploited to compromise security, see [4]. The active field of quantum information theory has proposed approaches to provide supposedly ‘unbreakable’ security by exploiting various quantum phenomena. This security unfortunately relies on assumptions about the nature of quantum measurements and their ability to generate random bits. Anton Zeilinger summarises this by postulating that the simplest quantum systems, qubit, can hold only one bit of classical information [6]. This foundational principle is in line with a wider paradigm shift to view quantum information as an extension of classical information, but it is nonetheless unsatisfying to simply postulate this principle, given its importance in determining the practical advantages of quantum information theory. In order to understand better how quantum mechanics can help generate meaningful information, we instead look to relate the outcomes of quantum measurements to formal properties of the system based on more fundamental assumptions. Indeed, we have shown that a) some of the postulated properties of quantum information follow from the formal structure of the theory and b) a purely formal notion of information within a quantum world can generate, via measurement, meaningful and useful information in the macroscopic world (for example, in cryptography). The indeterminism of quantum measurements can be formalised via the notion of value indefiniteness. To explain this concept, let us consider an arbitrary quantum system and ask whether the outcome of a measurement of any observable quantity A (such as the energy of the system, its angular momentum (spin), etc.) is determined prior to the measurement. If this is the case, then we say the observable is value definite with value v(A); otherwise, the observable is value indefinite and v(A) is undefined. Mathematically, one can reduce all observable quantities to so-called projection observables, which can only take the values 0 or 1. Thus, the question of whether the outcome of several measurements can be simultaneously determined in advance can be rephrased in terms of the information ‘carried’ by a particular system in a definite quantum state. Classically, one expects that all quantities are determined in advance, and hence all observables are value definite. Quantum mechanically, however, the belief is that this is not the case, and the information content of quantum systems is limited. Formulating carefully the notion of value indefiniteness allows us to formalise the notion of (quantum) indeterminism; however, this doesn’t help clarify whether quantum systems are indeed value indefinite or not. Staying in this formal framework, the Kochen-Specker theorem [5] provides a first positive result, showing that at least some observables must be value indefinite if one makes the assumption known as non-contextuality, which states that any definite values that exist must be independent of other compatible measurements that may or may not be performed on the system. Under the same assumption, this theorem can be strengthened to show that only one single observable can have the definite value 1 (see [2]). Furthermore, only observables that can be measured simultaneously with this single one can have the definite value 0; the rest must all be value indefinite. Since the preparation of a system involves precisely ensuring that, usually via measurement, the system is in a definite state with respect to some desired observable, this result shows that no other incompatible observable can be value definite. That is, preparing a system in a definite state by making the ‘preparation’ observable value definite specifies completely the information content of the quantum system. This is an example of syntactical quantum information acquiring meaning at the level of the quantum itself. Can the syntactical information at the level of the quantum generate meaning outside the quantum, that is, at the macroscopic level? The results cited above hold in the Hilbert-space framework of quantum mechanics and are formulated only in terms of a syntactical notion of information. Their real importance becomes evident when one interprets them in the context of quantum measurements. Specifically, if we prepare a quantum system in a known state, they allow us to ‘locate’ observables which we can measure, but which are value indefinite; that is, observables whose measurement results are not specified by any pre-existing property of the quantum system. Furthermore, with respect to a mathematical model of unpredictability which we developed in [3], the results of these measurements can be shown to be absolutely unpredictable. In this way we get a mathematical explanation and justification of the largely accepted intuition that quantum mechanics is inherently unpredictable, and that this unpredictability arises from the phenomenon of indefiniteness within the quantum world. Furthermore, if one considers a hypothetical infinite sequence generated by the repeated measurement of a quantum value indefinite observable, one can prove that these sequences must be strongly incomputable, technically ‘bi-immune’ [1]. Such sequences cannot be generated by any Turing machine or classical computer, showing that value indefiniteness leads to a clear classical/quantum split in a purely algorithmic context. Importantly, bi-immunity is a property of observed, macroscopic quantities, quite separate from the quantum framework in which the value indefiniteness is formalised. This form of macroscopic meaning created from the lack of syntactic information is precisely the scenario that quantum random number generators try to create, and which is essential for the development and certification of quantum cryptographic systems. The fact that the macroscopic information created goes beyond anything classically obtainable serves as a valuable practical resource, outside of and removed from the quantum formalism. To conclude, quantum information creates meaning within the quantum and via measure- ment, the lack of information within the quantum, creates meaning and valuable information at the macroscopic level. Acknowledgments The second author thanks Prof. S. Marcus for useful conversations on quantum information theory. This work was supported in part by Marie Curie FP7-PEOPLE-2010-IRSES Grant RANPHYS. References and Notes Abbott, A.A.; Calude, C.S.; Svozil, K. Strong Kochen-Specker theorem and incomputability of quantum randomness. Physical Review A 2012, 86, 062109. Abbott, A.A.; Calude, C.S.; Svozil, K. Value-indefinite observables are almost everywhere. Physical Review A 2013, 89, 032109. Abbott, A.A.; Calude, C.S.; Svozil, K. On the unpredictability of individual quantum measurement outcomes. CDMTCS Research Report 2014, 458. Calude, C.S. Quantum randomness & cryptology. CyberTalk 2013, 3, 42–43. Kochen, S.; Specker, E. The problem of hidden variables in quantum mechanics. Journal of Mathematics and Mechanics 1967, 17, 59–87. Zeilinger, A. A foundational principle for quantum mechanics. Foundations of Physics 1999, 29(4),631–643.