Tensor Network enhanced Dynamic Multiproduct Formulas

Abstract

Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We introduce a novel algorithm that combines tensor networks and quantum computation to produce results that are more accurate than what could be achieved by either method used in isolation. Our algorithm is based on multiproduct formulas (MPF) - a technique that linearly combines Trotter product formulas to reduce algorithmic error. Our algorithm uses a quantum computer to calculate the expectation values and tensor networks to calculate the coefficients used in the linear combination. We present a detailed error analysis of the algorithm and demonstrate the full workflow on a one-dimensional quantum simulation problem on $50$ qubits using two IBM quantum computers: $ibm\_torino$ and $ibm\_kyiv$.

References in corpus (28)

• The density-matrix renormalization group in the age of matrix product states
• Efficient classical simulation of slightly entangled quantum computations
• A bound on chaos
• Efficient simulation of one-dimensional quantum many-body systems
• Evolution of Entanglement Entropy in One-Dimensional Systems
• Time-dependent variational principle for quantum lattices
• Unifying time evolution and optimization with matrix product states
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Toward the first quantum simulation with quantum speedup
• A Theory of Trotter Error
• Multiple Shocks
• Dynamics of a two-dimensional quantum spin liquid: signatures of emergent Majorana fermions and fluxes
• The Future of Quantum Computing with Superconducting Qubits
• Time-evolving a matrix product state with long-ranged interactions
• Demonstration of fidelity improvement using dynamical decoupling with superconducting qubits
• Model-free readout-error mitigation for quantum expectation values
• Faster quantum simulation by randomization
• Dynamical decoupling for superconducting qubits: a performance survey
• Isometric Tensor Network States in Two Dimensions
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Gauge fixing, canonical forms and optimal truncations in tensor networks with closed loops
• Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment
• Suppressing quantum circuit errors due to system variability
• Gauging tensor networks with belief propagation
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Observing and braiding topological Majorana modes on programmable quantum simulators
• Problem specific classical optimization of Hamiltonian simulation
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach

Cited by in corpus (5)

• Dynamical simulations of many-body quantum chaos on a quantum computer
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Realization of Two-dimensional Discrete Time Crystals with Anisotropic Heisenberg Coupling
• Tensor-based phase difference estimation on time series analysis
• Time evolution of controlled many-body quantum systems with matrix product operators