Universal approximation of multi-copy states and universal quantum lossless data compression

DOI10.1007/S00220-009-0909-YMaRDI QIDQ981691zbMATH OpenOpenAlexFDO

Authors Masahito Hayashi

Publication date 2 July 2010

Published in Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.1091

zbMATH Keywords

data compressionquantum computing

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Quantum algorithms and complexity in the theory of computing (68Q12) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70)

Abstract: We have proven that there exists a quantum state approximating any multi-copy state universally when we measure the error by means of the normalized relative entropy. While the qubit case was proven by Krattenthaler and Slater (IEEE Trans. IT, 46, 801-819 (2000); quant-ph/9612043), the general case has been open for more than ten years. For a deeper analysis, we have solved the mini-max problem concerning `approximation error' up to the second order. Furthermore, we have applied this result to quantum lossless data compression, and have constructed a universal quantum lossless data compression.

Recommendations

• Universal quantum information compression and degrees of prior knowledge
• Quantum entropy-typical subspace and universal data compression
• Lossless quantum data compression and quantum Kolmogorov complexity
• On Lossless Quantum Data Compression With a Classical Helper
• Simple construction of quantum universal variable-length source coding

Cites work

• scientific article; zbMATH DE number 1560711 (Why is no real title available?)
• Asymptotic redundancies for universal quantum coding
• Filtering of Time Series with Unknown Mean Value
• Hall normalization constants for the Bures volumes of then-state quantum systems
• Information-theoretic asymptotics of Bayes methods
• Jeffreys' prior is asymptotically least favorable under entropy risk
• Mathematics of information and coding. Transl. from the Japanese by Joe Suzuki
• Quantum Cryptography Based on Split Transmission of One-Bit Information in Two Steps
• Simple construction of quantum universal variable-length source coding
• The rate of optimal purification procedures.
• Universal coding for classical-quantum channel

Cited in

(4)

• Efficient quantum information processing via quantum compressions
• Approximation of quantum assemblages
• Quantum compression relative to a set of measurements
• Quantum entropy-typical subspace and universal data compression

This page was built for publication: Universal approximation of multi-copy states and universal quantum lossless data compression

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