Exponents of quantum fixed-length pure state source coding
Masahito Hayashi
Abstract
We derive the optimal exponent of the error probability of the quantum fixed-length pure state source coding in both cases of blind coding and visible coding. The optimal exponent is universally attained by Jozsa et al. (PRL, 81, 1714 (1998))'s universal code. In the direct part, a group representation theoretical type method is essential. In the converse part, Nielsen and Kempe (PRL, 86, 5184 (2001))'s lemma is essential.
Create a lesson
Related papers
Gaussian entanglement and quantum communication: geodesic optimization and multimode bounds
Hemant K. Mishra, Mark M. Wilde
On the coincidence of discrete and continuous definitions of Entanglement of Formation
Haobo Ma, Maksim E. Shirokov, Wenlin Zhang
EFI1PRS
Rishabh Batra
Relative-Entropy Geometry and Convergence in Nonconvex Wiretap Optimization
Farzin Salek, Masahito Hayashi
Deterministic and programmable generation of mechanical multipartite entangled states
Isabelle Franzen, Max-Emanuel Kern, Q. Rumman Rahman et al.
Quantum-enhanced mechanical sensing with machine-learning estimation
Finn Müßigbrodt, Andraž Omahen, Q. Rumman Rahman et al.