The geometry of Bloch space in the context of quantum random access codes
From MaRDI portal
Publication:2107101
Recommendations
- \(n\rightarrow 1\) quantum random access codes using single 3-level systems
- Optimal bounds for parity-oblivious random access codes
- scientific article
- Unbounded-Error One-Way Classical and Quantum Communication Complexity
- Bitwise Quantum Min-Entropy Sampling and New Lower Bounds for Random Access Codes
Cites work
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- Dense quantum coding and a lower bound for 1-way quantum automata
- Dense quantum coding and quantum finite automata
- Geometry of the set of mixed quantum states: an apophatic approach
- The Bloch-Vector Space for N-Level Systems: the Spherical-Coordinate Point of View
- Unbounded-Error One-Way Classical and Quantum Communication Complexity
Cited in
(3)
This page was built for publication: The geometry of Bloch space in the context of quantum random access codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107101)