Compression of quantum shallow-circuit states

Abstract

Shallow quantum circuits feature not only computational advantages over their classical counterparts but also cutting-edge applications. Storing quantum information generated by shallow circuits is a fundamental question of both theoretical and practical importance that remained largely unexplored. In this work, we show that $N$ copies of an unknown $n$-qubit state generated by a fixed-depth circuit can be compressed into a hybrid memory of $O(n{\log }_{2}N)$ (qu)bits, which achieves the optimal scaling of memory cost. Our work shows that the computational complexity of resources can significantly impact the rate of quantum information processing, offering a unique and unified view of quantum Shannon theory and quantum computing.

arXiv commentClose to published version

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• Advances in Quantum Metrology
• Quantum-enhanced measurements: beating the standard quantum limit
• Quantum metrology
• Quantum principal component analysis
• Predicting Many Properties of a Quantum System from Very Few Measurements
• Parameterized quantum circuits as machine learning models
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• A quantum network of clocks
• Optimal Quantum Cloning Machines
• Quantum cloning
• Optimal Cloning of Pure States
• From Classical to Quantum Shannon Theory
• Quantum advantage with shallow circuits
• Programmable quantum gate arrays
• Layerwise learning for quantum neural networks
• Multi-parameter estimation in networked quantum sensors
• Tomography of Quantum Operations
• Optimal universal quantum cloning and state estimation
• Continuity of quantum conditional information
• Distributed Quantum Metrology and the Entangling Power of Linear Networks
• Optimal metrology with programmable quantum sensors
• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
• Distributed quantum phase estimation with entangled photons
• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum advantage with noisy shallow circuits in 3D
• Local asymptotic normality for finite dimensional quantum systems
• Attaining the ultimate precision limit in quantum state estimation
• Local asymptotic normality for qubit states
• Local asymptotic normality in quantum statistics
• Optimal probabilistic storage and retrieval of unitary channels
• Quantum Data Compression of a Qubit Ensemble
• Schumacher's quantum data compression as a quantum computation
• Efficient compression of quantum information
• An efficient high dimensional quantum Schur transform
• Optimal universal programming of unitary gates
• Optimal compression for identically prepared qubit states
• Learning quantum states and unitaries of bounded gate complexity
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Resource Quantification for the No-Programming Theorem
• Quantum-enhanced metrology with network states
• Quantum Metrological Power of Continuous-Variable Quantum Networks
• Quantum Stopwatch: How To Store Time in a Quantum Memory
• Compression for quantum population coding