Quantum birthday problems: geometrical aspects of quantum random coding
From MaRDI portal
Publication:4544712
DOI10.1109/18.945283zbMath1001.94010WikidataQ120979510 ScholiaQ120979510MaRDI QIDQ4544712
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
quantum information theory; von Neumann entropy; birthday problem; quantum Renyi entropy; asymptotic orthogonality; quantum channel coding
81P68: Quantum computation
94A17: Measures of information, entropy
94A15: Information theory (general)
62B10: Statistical aspects of information-theoretic topics
Related Items
Comparison between the Cramer-Rao and the mini-max approaches in quantum channel estimation, Score operators of a qubit with applications