Simulating quantum circuits using the multi-scale entanglement renormalization ansatz

Abstract

Understanding the limiting capabilities of classical methods in simulating complex quantum systems is of paramount importance for quantum technologies. Although many advanced approaches have been proposed and recently used to challenge quantum advantage experiments, novel efficient methods for the approximate simulation of complex quantum systems are still in high demand. Here we propose a scalable technique for approximate simulations of intermediate-size quantum circuits on the basis of the multi-scale entanglement renormalization ansatz (MERA) and Riemannian optimization. The MERA is a tensor network, whose geometry together with orthogonality constraints imposed on its tensors allow approximating many-body quantum states lying beyond the area-law scaling of the entanglement entropy. We benchmark the proposed technique for brick-wall quantum circuits of up to 243 qubits with various depths up to 20 layers. Our approach paves a way to exploring efficient simulation techniques for quantum many-body systems.

8 pages, 9 figures

References in corpus (28)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Efficient classical simulation of slightly entangled quantum computations
• Quantum computational advantage using photons
• Solving the Quantum Many-Body Problem with Artificial Neural Networks
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Strong quantum computational advantage using a superconducting quantum processor
• Entanglement renormalization
• Boson sampling with 20 input photons in 60-mode interferometers at $10^{14}$ state spaces
• Quantum Natural Gradient
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Algorithms for entanglement renormalization
• Tensor network states and geometry
• Differentiable Programming Tensor Networks
• Localization and Glassy Dynamics Of Many-Body Quantum Systems
• What limits the simulation of quantum computers?
• Hyper-optimized tensor network contraction
• Entanglement renormalization in two spatial dimensions
• Solving the sampling problem of the Sycamore quantum circuits
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Riemannian optimization of isometric tensor networks
• Simulation of time evolution with the MERA
• Scaling of entanglement entropy in the (branching) multi-scale entanglement renormalization ansatz
• Probabilistic Simulation of Quantum Circuits with the Transformer
• Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies
• QGOpt: Riemannian optimization for quantum technologies
• Fractal states of the Schwinger model

Cited by in corpus (2)

• Tensor networks for quantum computing
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm