Exponents of quantum fixed-length pure state source coding

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.

LaTeX2e and revetx4 with aps,twocolumn,superscriptaddress,showpacs,pra,amssymb,amsmath. The previous version has a mistake

References in corpus (6)

• Separable states are more disordered globally than locally
• Estimating the spectrum of a density operator
• Quantum universal variable-length source coding
• Compressibility of Mixed-State Signals
• Variable length universal entanglement concentration by local operations and its application to teleportation and dense coding
• Optimal sequence of POVMs in the sense of Stein's lemma in quantum hypothesis testing

Cited by in corpus (25)

• Quantum Reverse Shannon Theorem
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
• Quantum universal variable-length source coding
• Applications of coherent classical communication and the Schur transform to quantum information theory
• Tight exponential analysis of universally composable privacy amplification and its applications
• No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
• Two quantum analogues of Fisher information from a large deviation viewpoint of quantum estimation
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Universal coding for classical-quantum channel
• Entropy of a quantum channel
• Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2
• Strong converse theorems using Rényi entropies
• Universal super-replication of unitary gates
• Determining eigenvalues of a density matrix with minimal information in a single experimental setting
• Universal approximation of multi-copy states and universal quantum lossless data compression
• Secure uniform random number extraction via incoherent strategies
• Moderate deviation expansion for fully quantum tasks
• A family of multipartite entanglement measures
• Second order asymptotics of visible mixed quantum source coding via universal codes
• Measuring quantum relative entropy with finite-size effect
• Two-Server Oblivious Transfer for Quantum Messages
• Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding
• Quantum certification of state set and unitary channel
• Quantum Private Information Retrieval for Quantum Messages