Related papers: Binary Quantum Random Number Generator Based on Va…
A generalized Kochen-Specker theorem is proved. It is shown that there exist sets of $n$ projection operators, representing $n$ yes-no questions about a quantum system, such that none of the $2^n$ possible answers is compatible with sum…
A new notion of controllability, eigenstate controllability, is defined for finite-dimensional bilinear quantum mechanical systems which are neither strongly completely controllably nor completely controllable. And a quantum control…
In the paper it is argued that the Kochen-Specker theorem necessitates a conclusion that for a quantum system it is possible to find a set of projection operators which is not truth-value bivalent; that is, a bivalent truth-value assignment…
Random numbers represent an indispensable resource for many applications. A recent remarkable result is the realization that non-locality in quantum mechanics can be used to certify genuine randomness through Bell's theorem, producing…
We give a constructive and exhaustive definition of Kochen-Specker (KS) vectors in a Hilbert space of any dimension as well as of all the remaining vectors of the space. KS vectors are elements of any set of orthonormal states, i.e.,…
Quantum random number generators (QRNGs) harness quantum mechanical unpredictability to produce true randomness, which is crucial for cryptography and secure communications. Among various QRNGs, source-independent QRNGs (SI-QRNGs) relax the…
We prove that the algebra of observables of a certain gauge model is generated by unbounded elements in the sense of Woronowicz. The generators are constructed from the classical generators of invariant polynomials by means of geometric…
Random numbers are commonly used in many different fields, ranging from simulations in fundamental science to security applications. In some critical cases, as Bell's tests and cryptography, the random numbers are required to be both secure…
The question whether indeterminism in quantum measurement outcomes is fundamental or is there a possibility of constructing a finer theory underlying quantum mechanics that allows no such indeterminism, has been debated for a long time. We…
Quantum devices offer a highly useful function - that is generating random numbers in a non-deterministic way since the measurement of a quantum state is not deterministic. This means that quantum devices can be constructed that generate…
Traditional quantum random number generators can produce only one type of random number, while the optimal distribution of random numbers for different applications is usually distinct. The typical solution to this challenge is either using…
As computability implies value definiteness, certain sequences of quantum outcomes cannot be computable.
The prototype quantum random number (random bit) generators (QRNG) consists of one photon at a time falling on a $50:50$ beam splitter followed by random detection in one or the other other output beams due to the irreducible probabilistic…
The concept of randomness plays an important role in many disciplines. On one hand, the question of whether random processes exist is fundamental for our understanding of nature. On the other hand, randomness is a resource for cryptography,…
Self-testing and Semi-Device Independent protocols are becoming the preferred choice for quantum technologies, being able to certify their quantum nature with few assumptions and simple experimental implementations. In particular for…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming…
Quantum theory allows for randomness generation in a device-independent setting, where no detailed description of the experimental device is required. Here we derive a general upper bound on the amount of randomness that can be generated in…
Quantum contextuality turns out to be a necessary resource for universal quantum computation and also has applications in quantum communication. Thus it becomes important to generate contextual sets of arbitrary structure and complexity to…
Random numbers are at the heart of diverse fields, ranging from simulations of stochastic processes to classical and quantum cryptography. The requirement for true randomness in these applications has motivated various proposals for…
The generation of random numbers is a task of paramount importance in modern science. A central problem for both classical and quantum randomness generation is to estimate the entropy of the data generated by a given device. Here we present…