Quantum birthday problems: geometrical aspects of quantum random coding

DOI10.1109/18.945283MaRDI QIDQ4544712zbMATH OpenOpenAlexWikidataFDO

Authors Akio Fujiwara

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/49ec9cdf3bd5deb3ee3180e01a8b33db0abd65c7

zbMATH Keywords

asymptotic orthogonalitybirthday problemquantum channel codingquantum information theoryquantum Renyi entropyvon Neumann entropy

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Quantum computation (81P68) Information theory (general) (94A15) Measures of information, entropy (94A17)

Recommendations

• Random quantum channels. II: Entanglement of random subspaces, Rényi entropy estimates and additivity problems
• On quantum Rényi entropies: a new generalization and some properties
• Random quantum channels. I: Graphical calculus and the Bell state phenomenon
• Random matrix techniques in quantum information theory
• Quantum sources and a quantum coding theorem

Cited in

(2)

• Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation
• Score operators of a qubit with applications

This page was built for publication: Quantum birthday problems: geometrical aspects of quantum random coding

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