Entanglement entropy scaling of noisy random quantum circuits in two dimensions
arXiv:2205.13999 · doi:10.1103/PhysRevA.106.052430
Abstract
Whether noisy quantum devices without error correction can provide quantum advantage over classical computers is a critical issue of current quantum computation. In this work, the random quantum circuits, which are used as the paradigm model to demonstrate quantum advantage, are simulated with depolarizing noise on experiment relevant two-dimensional architecture. With comprehensive numerical simulation and theoretical analysis, we find that the maximum achievable operator entanglement entropy, which indicates maximal simulation cost, has area law scaling with the system size for constant noise rate. On the other hand, we also find that the maximum achievable operator entanglement entropy has power law scaling with the noise rate for fixed system size, and the volume law scaling can be obtained only if the noise rate decreases when system size increase.
References in corpus (37)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Simulation
- Efficient classical simulation of slightly entangled quantum computations
- Efficient simulation of one-dimensional quantum many-body systems
- Average Entropy of a Subsystem
- Characterizing Quantum Supremacy in Near-Term Devices
- Strong quantum computational advantage using a superconducting quantum processor
- Matrix product states represent ground states faithfully
- Quantum Entanglement Growth Under Random Unitary Dynamics
- Mixed-state dynamics in one-dimensional quantum lattice systems: a time-dependent superoperator renormalization algorithm
- Tensor renormalization group approach to 2D classical lattice models
- Entanglement Tsunami: Universal Scaling in Holographic Thermalization
- Digital quantum simulation of fermionic models with a superconducting circuit
- The computational complexity of PEPS
- Entanglement of Quantum Evolutions
- Symmetrised Characterisation of Noisy Quantum Processes
- Simulation methods for open quantum many-body systems
- Operator space entanglement entropy in transverse Ising chain
- Average Entropy of a Subsystem
- What limits the simulation of quantum computers?
- Entanglement spreading in a minimal model of maximal many-body quantum chaos
- Hyper-optimized tensor network contraction
- A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
- Efficient classical simulation of random shallow 2D quantum circuits
- Solving the sampling problem of the Sycamore quantum circuits
- Topological order in PEPS: Transfer operator and boundary Hamiltonians
- Efficient classical simulation of noisy random quantum circuits in one dimension
- Classical Simulation of Quantum Supremacy Circuits
- Emergence of typical entanglement in two-party random processes
- Complexity of thermal states in quantum spin chains
- Gradient optimization of finite projected entangled pair states
- Contracting projected entangled pair states is average-case hard
- Classical simulation of lossy boson sampling using matrix product operators
- Direct sampling of projected entangled-pair states
- Simulating noisy quantum protocols with quantum trajectories
- Efficient classical simulation of noisy quantum computation
Cited by in corpus (5)
- Simulating lossy Gaussian boson sampling with matrix product operators
- Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
- Locally purified density operators for noisy quantum circuits
- Accelerating Quantum Eigensolver Algorithms With Machine Learning
- Measurement-induced entanglement in noisy 2D random circuits