Generating randomness from a computable, non-random sequence of qubits

MaRDI QIDQ5020624zbMATH OpenFDO

Authors Tejas Bhojraj

Publication date 6 January 2022

Full work available at URL https://arxiv.org/abs/2005.00207, http://eptcs.web.cse.unsw.edu.au/paper.cgi?QPL2019.1

Mathematics Subject Classification ID

Quantum logic (03G12) Logical foundations of quantum mechanics; quantum logic (quantum-theoretic aspects) (81P10)

Recommendations

• Martin-Löf random quantum states
• Quantum algorithmic randomness
• Quantum randomness: from practice to theory and back
• Randomness: quantum versus classical
• Generating and using truly random quantum states in \texttt{Mathematica}

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• A quantum random number generator certified by value indefiniteness
• Algorithmic randomness and complexity.
• Computability and randomness
• Kolmogorov Complexity and Algorithmic Randomness
• Kronecker Products, Unitary Matrices and Signal Processing Applications
• Martin-Löf random quantum states
• On the Unpredictability of Individual Quantum Measurement Outcomes

Cited in

(5)

• Quantum algorithmic randomness
• Von Neumann entropy and quantum algorithmic randomness
• Prefix-free quantum Kolmogorov complexity
• Generating random bits from an arbitrary source: fundamental limits
• Generating Randomness from a Computable, Non-random Sequence of Qubits

This page was built for publication: Generating randomness from a computable, non-random sequence of qubits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5020624)