Quantum Compression of Tensor Network States
arXiv:1904.06772 · doi:10.1088/1367-2630/ab7a34
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.
arXiv comment30 pages, 16 figures. Improved language and fixed typos
References in corpus (47)
- Fault-tolerant quantum computation by anyons
- Persistent entanglement in arrays of interacting particles
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Quantum principal component analysis
- An Area Law for One Dimensional Quantum Systems
- A class of quantum many-body states that can be efficiently simulated
- Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
- Matrix product states represent ground states faithfully
- Optimal Quantum Cloning Machines
- Criticality, the area law, and the computational power of PEPS
- Classical simulation of quantum many-body systems with a tree tensor network
- Optimal Universal and State-Dependent Quantum Cloning
- Experimental Demonstration of Blind Quantum Computing
- Renormalization and tensor product states in spin chains and lattices
- Tomography of Quantum Operations
- Entanglement spectrum and boundary theories with projected entangled-pair states
- Tensor network states and algorithms in the presence of a global U(1) symmetry
- Tensor network decompositions in the presence of a global symmetry
- Measurement-based quantum computation beyond the one-way model
- Quantum Tomography
- 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
- Functional renormalization for spontaneous symmetry breaking in the Hubbard model
- Nonlinear quantum metrology of many-body open systems
- Universal Quantum Information Compression
- Ergodic and Mixing Quantum Channels in Finite Dimensions
- Limits for compression of quantum information carried by ensembles of mixed states
- Quantum Data Compression of a Qubit Ensemble
- Efficient compression of quantum information
- The Generalized Lyapunov Theorem and its Application to Quantum Channels
- On quantum coding for ensembles of mixed states
- Optimal compression for identically prepared qubit states
- Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
- Compressed quantum simulation of the Ising model
- Universal super-replication of unitary gates
- Quantum Max-flow/Min-cut
- Quantum Coding Theorem for Mixed States
- Many-body effects in quantum metrology
- Quantum Stopwatch: How To Store Time in a Quantum Memory
- Universal Quantum Emulator
- Holographic codes
- Compressed Simulation of evolutions of the XY-model
- Compression for quantum population coding
- Compressed simulation of thermal and excited states of the 1-D XY-model
- Single-shot holographic compression from the area law