Related papers: Arithmetic sequences as quantum states
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
The issue of defining a random sequence of qubits is studied in the framework of Algorithmic Free Probability Theory.Its connection with Quantum Algorithmic Information Theory is shown
The correspondence principle plays a fundamental role in quantum mechanics, which naturally leads us to inquire whether it is possible to find or determine close classical analogs of quantum states in phase space -- a common meeting point…
We consider a generalized model of repeated quantum interactions, where a system $\mathcal{H}$ is interacting in a random way with a sequence of independent quantum systems $\mathcal{K}_n, n \geq 1$. Two types of randomness are studied in…
The quantum relative entropy is a fundamental quantity in quantum information science, characterizing the distinguishability between two quantum states. However, this quantity is not additive in general for correlated quantum states,…
Quantum information processing shows advantages in many tasks, including quantum communication and computation, comparing to its classical counterpart. The essence of quantum processing lies on the fundamental difference between classical…
Many quantum information measures can be written as an optimization of the quantum relative entropy between sets of states. For example, the relative entropy of entanglement of a state is the minimum relative entropy to the set of separable…
Quantum Martin-L\"of randomness (q-MLR) for infinite qubit sequences was introduced by Nies and Scholz. We define a notion of quantum Solovay randomness which is equivalent to q-MLR. The proof of this goes through a purely linear algebraic…
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)…
Optimal universal entanglement processes are discussed which entangle two quantum systems in an optimal way for all possible initial states. It is demonstrated that the linear character of quantum theory which enforces the peaceful…
For a system randomly prepared in a number of quantum states, we present a lower bound for the distinguishability of the quantum states, that is, the success probability of determining the states in the form of entropy. When the states are…
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of…
Randomness is a valuable resource in science, cryptography, engineering, and information technology. Quantum-mechanical sources of randomness are attractive because of the indeterminism of individual quantum processes. Here we consider the…
Measurement based (MB) quantum computation allows for universal quantum computing by measuring individual qubits prepared in entangled multipartite states, known as graph states. Unless corrected for, the randomness of the measurements…
The notion of {\em entanglement entropy} in quantum mechanical systems is an important quantity, which measures how much a physical state is entangled in a composite system. Mathematically, it measures how much the state vector is not…
An analysis of quantum measurement is presented that relies on an information-theoretic description of quantum entanglement. In a consistent quantum information theory of entanglement, entropies (uncertainties) conditional on measurement…
The irreversible motion of an open quantum system can be represented through an ensemble of state vectors following a stochastic dynamics with piecewise deterministic paths. It is shown that this representation leads to a natural definition…
Thevon Neumann entropy, named after John von Neumann, is an extension of the classical concept of entropy to the field of quantum mechanics. From a numerical perspective, von Neumann entropy can be computed simply by computing all…
We compute analytically the statistics of the Renyi and von Neumann entropies (standard measures of entanglement), for a random pure state in a large bipartite quantum system. The full probability distribution is computed by first mapping…