Quantum Compression of Tensor Network States

Abstract

We design quantum compression algorithms for parametric families of tensor network states. We first establish an upper bound on the amount of memory needed to store an arbitrary state from a given state family. The bound is determined by the minimum cut of a suitable flow network, and is related to the flow of information from the manifold of parameters that specify the states to the physical systems in which the states are embodied. For given network topology and given edge dimensions, our upper bound is tight when all edge dimensions are powers of the same integer. When this condition is not met, the bound is optimal up to a multiplicative factor smaller than 1.585. We then provide a compression algorithm for general state families, and show that the algorithm runs in polynomial time for matrix product states.

30 pages, 16 figures. Improved language and fixed typos

References in corpus (19)

• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• A class of quantum many-body states that can be efficiently simulated
• Matrix product states represent ground states faithfully
• Criticality, the area law, and the computational power of PEPS
• Tensor network states and algorithms in the presence of a global U(1) symmetry
• Measurement-based quantum computation beyond the one-way model
• Efficient Distributed Quantum Computing
• Quantum fidelity and quantum phase transitions in matrix product states
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Attaining the ultimate precision limit in quantum state estimation
• Nonlinear quantum metrology of many-body open systems
• Quantum Data Compression of a Qubit Ensemble
• The Generalized Lyapunov Theorem and its Application to Quantum Channels
• Universal super-replication of unitary gates
• Many-body effects in quantum metrology
• Quantum Stopwatch: How To Store Time in a Quantum Memory
• Holographic codes
• Compression for quantum population coding
• Single-shot holographic compression from the area law

Cited by in corpus (2)

• Implementation of quantum compression on IBM quantum computers
• Quantum Causal Unravelling