2016/06/30 by Yuxiang Yang, Giulio Chiribella, Masahito Hayashi · 32 citations
Computer Science · Mathematics · Physics and Astronomy · #Cloning (programming) #Combinatorics #Compression (physics) #Computer science #Independent and identically distributed random variables #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum information #Quantum mechanics #Qubit #Random variable #Statistical physics #Statistics #Thermodynamics #Topology (electrical circuits) #cs.IT #math-ph #math.IT #math.MP #quant-ph
paper · pdf · doi:10.1103/physrevlett.117.090502
published in Physical Review Letters 117(9), 090502 (American Physical Society) · 5+ 12 pages, 3 figures. Published version.A few typos corrected
openalex publication_date 2016/08/25 · arxiv created 2016/12/01 · arxiv updated 2016/12/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We establish the ultimate limits to the compression of sequences of identically prepared qubits. The limits are determined by Holevo's information quantity and are attained through use of the optimal universal cloning machine, which finds here a novel application to quantum Shannon theory.