Quantum algorithmic randomness

August 08, 2020 Β· Declared Dead Β· πŸ› Journal of Mathematics and Physics

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Tejas Bhojraj arXiv ID 2008.03584 Category quant-ph: Quantum Computing Cross-listed cs.IT, cs.LO Citations 2 Venue Journal of Mathematics and Physics Last Checked 5 months ago
Abstract
Quantum Martin-LΓΆf 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 result about approximating density matrices by subspaces. We then show that random states form a convex set. Martin-LΓΆf absolute continuity is shown to be a special case of q-MLR. Quantum Schnorr randomness is introduced. A quantum analogue of the law of large numbers is shown to hold for quantum Schnorr random states.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted