Related papers: Quantum algorithmic randomness
Different ensembles of the same density matrix are indistinguishable within the modern Kolmogorov probability measure theory of quantum random phenomena. We find that changing the framework from the Kolmogorov one to a frequentist-inspired…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
We define a natural ensemble of trace preserving, completely positive quantum maps and present algorithms to generate them at random. Spectral properties of the superoperator Phi associated with a given quantum map are investigated and a…
The law of large numbers is one of the fundamental properties which algorithmically random infinite sequences ought to satisfy. In this paper, we show that the law of large numbers can be effectivized for an arbitrary Schnorr random…
Random matrix ensembles (RME) of quantum statistical Hamiltonian operators, {\em e.g.} Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), found applications in literature in study of following quantum…
In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an…
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…
The nRules are empirical regularities that were discovered in macroscopic situations where the outcome is known. When they are projected theoretically into the microscopic domain they predict a novel ontology including the frequent collapse…
The random matrix ensembles (RME) of quantum statistical Hamiltonian operators, {\em e.g.} Gaussian random matrix ensembles (GRME) and Ginibre random matrix ensembles (Ginibre RME), are applied to following quantum statistical systems:…
The random matrix ensembles are applied to the quantum chaotic systems. The quantum systems are studied using the finite dimensional real, complex and quaternion Hilbert spaces of the eigenfunctions. The linear operators describing the…
The mathematics of classical probability theory was subsumed into classical measure theory by Kolmogorov in 1933. Quantum theory as nonclassical probability theory was incorporated into the beginnings of noncommutative measure theory by von…
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…
Modern machine learning (ML) systems excel in recognising and classifying images with remarkable accuracy. However, like many computer software systems, they can fail by generating confusing or erroneous outputs or by deferring to human…
This is a review article in which we will introduce, in a unifying fashion and with more intermediate steps in some difficult calculations, two infinite-dimensional Lie algebras of quantum matrix models, one for the open string sector and…
We review the development of random-matrix theory (RMT) during the last decade. We emphasize both the theoretical aspects, and the application of the theory to a number of fields. These comprise chaotic and disordered systems, the…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
In this work we introduce the randomness which is truly quantum mechanical in nature arising as an act of measurement. For a composite classical system we have the joint entropy to quantify the randomness present in the total system and…
Quantum computing's promise lies in its intrinsic complexity, with entanglement initially heralded as its hallmark. However, the quest for quantum advantage extends beyond entanglement, encompassing the realm of nonstabilizer (magic)…
New insight into the correspondence between Quantum Chaos and Random Matrix Theory is gained by developing a semiclassical theory for the autocorrelation function of spectral determinants. We study in particular the unitary operators which…
One of the main lines of research in algorithmic randomness is that of lowness notions. Given a randomness notion R, we ask for which sequences A does relativization to A leave R unchanged (i.e., R^A = R)? Such sequences are call low for R.…