Simulating Noisy Quantum Circuits with Matrix Product Density Operators

Abstract

Simulating quantum circuits with classical computers requires resources growing exponentially in terms of system size. Real quantum computer with noise, however, may be simulated polynomially with various methods considering different noise models. In this work, we simulate random quantum circuits in 1D with Matrix Product Density Operators (MPDO), for different noise models such as dephasing, depolarizing, and amplitude damping. We show that the method based on Matrix Product States (MPS) fails to approximate the noisy output quantum states for any of the noise models considered, while the MPDO method approximates them well. Compared with the method of Matrix Product Operators (MPO), the MPDO method reflects a clear physical picture of noise (with inner indices taking care of the noise simulation) and quantum entanglement (with bond indices taking care of two-qubit gate simulation). Consequently, in case of weak system noise, the resource cost of MPDO will be significantly less than that of the MPO due to a relatively small inner dimension needed for the simulation. In case of strong system noise, a relatively small bond dimension may be sufficient to simulate the noisy circuits, indicating a regime that the noise is large enough for an `easy' classical simulation. Moreover, we propose a more effective tensor updates scheme with optimal truncations for both the inner and the bond dimensions, performed after each layer of the circuit, which enjoys a canonical form of the MPDO for improving simulation accuracy. With truncated inner dimension to a maximum value $\kappa$ and bond dimension to a maximum value $\chi$, the cost of our simulation scales as $\sim ND{\kappa }^3{\chi }^3$, for an $N$-qubit circuit with depth $D$.

arXiv comment14 pages, 13 figures

References in corpus (27)

• Supplementary information for "Quantum supremacy using a programmable superconducting 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
• Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
• Multiple Particle Interference and Quantum Error Correction
• Characterizing Quantum Supremacy in Near-Term Devices
• Matrix Product Density Operators: Simulation of finite-T and dissipative systems
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Efficient quantum key distribution over a collective noise channel
• Matrix product operator representations
• Random Quantum Circuits are Approximate 2-designs
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• Average-case complexity versus approximate simulation of commuting quantum computations
• Decoherence-Free Subspaces and Subsystems
• QuEST and High Performance Simulation of Quantum Computers
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• What limits the simulation of quantum computers?
• A positive tensor network approach for simulating open quantum many-body systems
• Overview and Comparison of Gate Level Quantum Software Platforms
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Efficient Generation of Generic Entanglement
• Massively parallel quantum computer simulator, eleven years later
• qHiPSTER: The Quantum High Performance Software Testing Environment
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Experimental exploration of five-qubit quantum error correcting code with superconducting qubits
• Quantum Commuting Circuits and Complexity of Ising Partition Functions
• Efficient description of many-body systems with Matrix Product Density Operators

Cited by in corpus (27)

• Characterizing a non-equilibrium phase transition on a quantum computer
• Simulating Noisy Variational Quantum Algorithms: A Polynomial Approach
• Quantum variational learning for quantum error-correcting codes
• TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era
• Tensor networks for quantum computing
• Efficient sampling of noisy shallow circuits via monitored unraveling
• Atomic Quantum Technologies for Quantum Matter and Fundamental Physics Applications
• Locally Purified Density Operators for Symmetry-Protected Topological Phases in Mixed States
• Quantum State Tomography with Locally Purified Density Operators and Local Measurements
• Coexistence of multiuser entanglement distribution and classical light in optical fiber network with a semiconductor chip
• Locally purified density operators for noisy quantum circuits
• Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
• Simulating photonic devices with noisy optical elements
• Unveiling quantum phase transitions from traps in variational quantum algorithms
• Noisy induced entanglement transition in one-dimensional random quantum circuits
• Prolonging a discrete time crystal by quantum-classical feedback
• Large-scale stochastic simulation of open quantum systems
• Limitations of Noisy Quantum Devices in Computational and Entangling Power
• Analog simulation of noisy quantum circuits
• Macroproperties vs. Microstates in the Classical Simulation of Critical Phenomena in Quench Dynamics of 1D Ising Models
• Tomography-assisted noisy quantum circuit simulator using matrix product density operators
• A Riemannian Approach to the Lindbladian Dynamics of a Locally Purified Tensor Network
• Gauge-Fixing Quantum Density Operators At Scale
• Quantum Neural Network Training of a Repeater Node
• Learning mixed quantum states in large-scale experiments
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
• Efficient Quantum Circuit Simulation by Tensor Network Methods on Modern GPUs