Related papers: Quantum algorithmic randomness
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…
We introduce the notions of algorithmic mutual information and rarity of quantum states. These definitions enjoy conservation inequalities over unitary transformations and partial traces. We show that a large majority of pure states have…
The $k$-means algorithm (Lloyd's algorithm) is a widely used method for clustering unlabeled data. A key bottleneck of the $k$-means algorithm is that each iteration requires time linear in the number of data points, which can be expensive…
The notion of probability plays a crucial role in quantum mechanics. It appears in quantum mechanics as the Born rule. In modern mathematics which describes quantum mechanics, however, probability theory means nothing other than measure…
A seminal theorem due to Weyl states that if (a_n) is any sequence of distinct integers, then, for almost every real number x, the sequence (a_n x) is uniformly distributed modulo one. In particular, for almost every x in the unit interval,…
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very…
Randomness in the sense of Martin-L\"of can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on the even bits (the first one)…
The random matrix ensembles are applied to the quantum statistical two-dimensional systems of electrons. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The…
This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…
It is shown how to map the quantum states of a system of free scalar particles one-to-one onto the states of a completely deterministic model. It is a classical field theory with a large (global) gauge group. The mapping is now also applied…
Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…
The concept of $\e$-randomizing quantum channels has been introduced by Hayden, Leung, Shor and Winter in connection with approximately encrypting quantum states. They proved using a discretization argument that sets of roughly $d \log d$…
In this paper, we show an interesting connection between a quantum sampling technique and quantum uncertainty. Namely, we use the quantum sampling technique, introduced by Bouman and Fehr, to derive a novel entropic uncertainty relation…
The interpretation of the squared norm as probability and the apparent stochastic nature of observation in quantum mechanics are derived from the strong law of large numbers and the algebraic properties of infinite sequences of simultaneous…
Quantum machine learning (QML) is a promising early use case for quantum computing. There has been progress in the last five years from theoretical studies and numerical simulations to proof of concepts. Use cases demonstrated on…
Non-linearity of a Boolean function indicates how far it is from any linear function. Despite there being several strong results about identifying a linear function and distinguishing one from a sufficiently non-linear function, we found a…
We present a quantum-like (QL) model in that contexts (complexes of e.g. mental, social, biological, economic or even political conditions) are represented by complex probability amplitudes. This approach gives the possibility to apply the…
Quantum coherence serves as a fundamental resource for generating intrinsic randomness, yet the quantification of randomness in quantum random number generators (QRNGs) based on spontaneous emission has remained largely phenomenological.…
A quantum random number generator (QRNG) can generate true randomness by exploiting the fundamental indeterminism of quantum mechanics. Most approaches to QRNG employ single-photon detection technologies and are limited in speed. Here, we…