Related papers: Generating Randomness from a Computable, Non-rando…
We analyze mean fidelity between random density matrices of size N, generated with respect to various probability measures in the space of mixed quantum states: Hilbert-Schmidt measure, Bures (statistical) measure, the measures induced by…
Suppose you receive a sequence of qubits where each qubit is guaranteed to be in one of two pure states, but you do not know what those states are. Your task is to determine the states. This can be viewed as a kind of quantum state learning…
We generalise the randomness test definitions in the literature for both the Martin-L\"of and Schnorr randomness of a series of binary outcomes, in order to allow for interval-valued rather than merely precise forecasts for these outcomes,…
We prove two theorems related to the Central Limit Theorem (CLT) for Martin-L\"of Random (MLR) sequences. Martin-L\"of randomness attempts to capture what it means for a sequence of bits to be "truly random". By contrast, CLTs do not make…
Intrinsic quantum randomness is produced when a projective measurement on a given basis is implemented on a pure state that is not an element of the basis. The prepared state and implemented measurement are perfectly known, yet the measured…
The Born's rule introduces intrinsic randomness to the outcomes of a measurement performed on a quantum mechanical system. But, if the system is prepared in the eigenstate of an observable then the measurement outcome of that observable is…
Entanglement is a quantum resource, in some ways analogous to randomness in classical computation. Inspired by recent work of Gheorghiu and Hoban, we define the notion of "pseudoentanglement'', a property exhibited by ensembles of…
Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given…
When an experimentalist measures a time series of qubits, the outcomes generate a classical stochastic process. We show that measurement induces high complexity in these processes in two specific senses: they are inherently unpredictable…
We demonstrate that the task of determining an unknown quantum state can be accomplished efficiently by making a sequential measurement of two observables $\hat{A}$ and $\hat{B}$, provided that the two observables are chosen in such a way…
A non-relativistic quantum mechanical theory is proposed that describes the universe as a continuum of worlds whose mutual interference gives rise to quantum phenomena. A logical framework is introduced to properly deal with propositions…
Random numbers are central to cryptography and various other tasks. The intrinsic probabilistic nature of quantum mechanics has allowed us to construct a large number of quantum random number generators (QRNGs) that are distinct from the…
In quantum metrology, one of the major applications of quantum technologies, the ultimate precision of estimating an unknown parameter is often stated in terms of the Cram\'er-Rao bound. Yet, the latter is no longer guaranteed to carry an…
The rates at which a user can generate device-independent quantum random numbers from a Bell-type experiment depend on the measurements that he performs. By numerically optimising over these measurements, we present lower bounds on the…
We develop Monte Carlo methods for sampling random states and corresponding bit strings in qubit systems. To this end, we derive exact probability density functions that yield the Porter-Thomas distribution in the limit of large systems. We…
Van Lambalgen's theorem states that a pair $(\alpha,\beta)$ of bitsequences is Martin-L\"of random if and only if $\alpha$ is Martin-L\"of random and $\beta$ is Martin-L\"of random relative to $\alpha$. In [Information and Computation 209.2…
Reimann and Slaman initiated the study of sequences that are Martin-L\"of random with respect to a continuous measure, establishing fundamental facts about NCR, the collection of sequences that are not Martin-L\"of random with respect to…
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a…
I provide a simple derivation of the Born rule as giving a classical probability, that is, the ratio of the measure of favorable states of the system to the measure of its total possible states. In classical systems, the probability is due…
The notion of Schnorr randomness refers to computable reals or computable functions. We propose a version of Schnorr randomness for subcomputable classes and characterize it in different ways: by Martin L\"of tests, martingales or measure…