Deep Circuit Compression for Quantum Dynamics via Tensor Networks
arXiv:2409.16361 · doi:10.22331/q-2025-07-09-1789
Abstract
Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth beyond prior work, and we present circuit compilations of up to 64 layers of gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.
9+1 pages, 6 figures; updating with Quantum template
References in corpus (35)
- Quantum Computing in the NISQ era and beyond
- The density-matrix renormalization group in the age of matrix product states
- Variational Quantum Algorithms
- Barren plateaus in quantum neural network training landscapes
- A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
- A Theory of Trotter Error
- Generalization in quantum machine learning from few training data
- From density-matrix renormalization group to matrix product states
- Quantum-assisted quantum compiling
- Algorithms for entanglement renormalization
- Time-evolving a matrix product state with long-ranged interactions
- Minimally Entangled Typical Thermal State Algorithms
- Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Barren Plateaus in Variational Quantum Computing
- Real- and imaginary-time evolution with compressed quantum circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Classically optimized Hamiltonian simulation
- Out-of-distribution generalization for learning quantum dynamics
- Towards adiabatic quantum computing using compressed quantum circuits
- Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
- Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies
- Variational Hamiltonian simulation for translational invariant systems via classical pre-processing
- Quantum dynamics simulations beyond the coherence time on NISQ hardware by variational Trotter compression
- Optimal compression of quantum many-body time evolution operators into brickwall circuits
- Dynamical simulation via quantum machine learning with provable generalization
- A semi-agnostic ansatz with variable structure for quantum machine learning
- Local variational quantum compilation of a large-scale Hamiltonian dynamics
- Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
- QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
- Automatic quantum circuit encoding of a given arbitrary quantum state
- Riemannian quantum circuit optimization for Hamiltonian simulation
- Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits
- Tensor Network enhanced Dynamic Multiproduct Formulas
- Optimal compression of constrained quantum time evolution