Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation

Abstract

Matrix Product States (MPS) and Operators (MPO) have been proven to be a powerful tool to study quantum many-body systems but are restricted to moderately entangled states as the number of parameters scales exponentially with the entanglement entropy. While MPS can efficiently find ground states of 1D systems, their capacities are limited when simulating their dynamics, where the entanglement can increase ballistically with time. On the other hand, quantum devices appear as a natural platform to encode and perform the time evolution of correlated many-body states. However, accessing the regime of long-time dynamics is hampered by quantum noise. In this study we use the best of worlds: the short-time dynamics is efficiently performed by MPSs, compiled into short-depth quantum circuits, and is performed further in time on a quantum computer thanks to efficient MPO-optimized quantum circuits. We quantify the capacities of this hybrid classical-quantum scheme in terms of fidelities taking into account a noise model. We show that using classical knowledge in the form of tensor networks provides a way to better use limited quantum resources and lowers drastically the noise requirements to reach a practical quantum advantage. Finally we successfully demonstrate our approach with an experimental realization of the technique. Combined with efficient circuit transpilation we simulate a 10-qubit system on an actual quantum device over a longer time scale than low-bond-dimension MPSs and purely quantum Trotter evolution.

References in corpus (47)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• The density-matrix renormalization group in the age of matrix product states
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Characterizing Quantum Supremacy in Near-Term Devices
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Time-evolution methods for matrix-product states
• Efficient variational quantum simulator incorporating active error minimisation
• Noise tailoring for scalable quantum computation via randomized compiling
• Theory of variational quantum simulation
• Matrix product operator representations
• Sequential generation of entangled multi-qubit states
• Algorithms for entanglement renormalization
• Variational quantum algorithms for nonlinear problems
• Towards Quantum Machine Learning with Tensor Networks
• Simulating quantum many-body dynamics on a current digital quantum computer
• Entanglement dynamics after quantum quenches in generic integrable systems
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Scalable error mitigation for noisy quantum circuits produces competitive expectation values
• Real- and imaginary-time evolution with compressed quantum circuits
• Detecting crosstalk errors in quantum information processors
• What limits the simulation of quantum computers?
• Mitigating depolarizing noise on quantum computers with noise-estimation circuits
• Hardware-efficient variational quantum algorithms for time evolution
• Variational Quantum Eigensolver with Fewer Qubits
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Modelling and Simulating the Noisy Behaviour of Near-term Quantum Computers
• Crossing a topological phase transition with a quantum computer
• Parallel Quantum Simulation of Large Systems on Small Quantum Computers
• An efficient quantum algorithm for the time evolution of parameterized circuits
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• The Variational Power of Quantum Circuit Tensor Networks
• Classically optimized Hamiltonian simulation
• Quantum simulation with hybrid tensor networks
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Efficient tensor network simulation of IBM's largest quantum processors
• Optimal compression of quantum many-body time evolution operators into brickwall circuits
• Entanglement from tensor networks on a trapped-ion QCCD quantum computer
• Holographic simulation of correlated electrons on a trapped ion quantum processor
• Quantum-classical eigensolver using multiscale entanglement renormalization
• Mitigating crosstalk errors by randomized compiling: Simulation of the BCS model on a superconducting quantum computer
• Time Evolution of Uniform Sequential Circuits
• Entanglement entropy scaling of noisy random quantum circuits in two dimensions

Cited by in corpus (11)

• Quantum Magic and Multi-Partite Entanglement in the Structure of Nuclei
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Hybrid Tree Tensor Networks for quantum simulation
• Tensor-based quantum phase difference estimation for large-scale demonstration
• Riemannian quantum circuit optimization based on matrix product operators
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• Feasibility of performing quantum chemistry calculations on quantum computers
• A New Scaling Function for QAOA Tensor Network Simulations
• Exploring fixed points and eigenstates of quantum systems with reinforcement learning
• Tensor-based phase difference estimation on time series analysis
• Emulation of large-scale qubit registers with a phase-space approach