Compression for quantum population coding

Abstract

We study the compression of n quantum systems, each prepared in the same state belonging to a given parametric family of quantum states. For a family of states with f independent parameters, we devise an asymptotically faithful protocol that requires a hybrid memory of size (f/2)log(n), including both quantum and classical bits. Our construction uses a quantum version of local asymptotic normality and, as an intermediate step, solves the problem of compressing displaced thermal states of n identically prepared modes. In both cases, we show that (f/2)log(n) is the minimum amount of memory needed to achieve asymptotic faithfulness. In addition, we analyze how much of the memory needs to be quantum. We find that the ratio between quantum and classical bits can be made arbitrarily small, but cannot reach zero: unless all the quantum states in the family commute, no protocol using only classical bits can be faithful, even if it uses an arbitrarily large number of classical bits.

arXiv comment14 Pages, 4 Figures + Appendix

References in corpus (20)

• Classifying quantum phases using Matrix Product States and PEPS
• Quantum cloning
• Coding Theorem and Strong Converse for Quantum Channels
• Entropy scaling and simulability by Matrix Product States
• Universal cloning of continuous quantum variables
• Fidelity for displaced squeezed states and the oscillator semigroup
• Local asymptotic normality for finite dimensional quantum systems
• Local asymptotic normality for qubit states
• Local asymptotic normality in quantum statistics
• Quantum Data Compression of a Qubit Ensemble
• Efficient compression of quantum information
• Optimal compression for identically prepared qubit states
• Hellinger distance as a measure of Gaussian discord
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Compressed quantum simulation of the Ising model
• Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states
• Quantum Coding Theorem for Mixed States
• Compressed Simulation of evolutions of the XY-model
• Compressed simulation of thermal and excited states of the 1-D XY-model
• Quantum hypothesis testing for quantum Gaussian states: Quantum analogues of chi-square, t and F tests

Cited by in corpus (9)

• Attaining the ultimate precision limit in quantum state estimation
• Optimal universal programming of unitary gates
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Efficient algorithms for quantum information bottleneck
• Communication Cost of Quantum Processes
• Quantum Compression of Tensor Network States
• Heisenberg scaling based on population coding
• Compression for Qubit Clocks
• Compression of quantum shallow-circuit states