Efficient classical simulation of slightly entangled quantum computations

2003/01/31 by Guifre Vidal · 18 citations
Physics and Astronomy · #quant-ph

paper · pdf · doi:10.1103/physrevlett.91.147902

published as Phys. Rev. Lett. 91, 147902 (2003) · 4 pages. Major changes. Significantly improved simulation scheme

arxiv created 2003/02/26 · arxiv updated 2016/09/08

Abstract

We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted. The evolution of a pure state of n qubits can be simulated by using computational resources that grow linearly in n and exponentially in the entanglement. We show that a pure-state quantum computation can only yield an exponential speed-up with respect to classical computations if the entanglement increases with the size n of the computation, and gives a lower bound on the required growth.

Cited by

• GPU-First Heisenberg-Picture Tensor Network Dynamics for the 2D Transverse-Field Ising Model
• Modelling Emotional Memory in Children with Tensor Networks
• Clifford disentanglers for entanglement reduction in molecular electronic structure simulations
• Non-variational supervised quantum kernel methods: a review
• LogosQ: A High-Performance and Type-Safe Quantum Computing Library in Rust
• EAQGA: A Quantum-Enhanced Genetic Algorithm with Novel Entanglement-Aware Crossovers
• Computing-heightened low-cost high-dimensional controlled-SUM gates
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• Comparative Benchmarking of Utility-Scale Quantum Emulators
• Realizing string breaking dynamics in a Z₂ lattice gauge theory on quantum hardware
• Finding periodic orbits in projected quantum many-body dynamics
• ScarFinder: a detector of optimal scar trajectories in quantum many-body dynamics
• Quantum Error Management in Practice: A Cross-Stack Benchmark
• Nonlocal nonstabilizerness for slightly entangled quantum many-body states
• Three-flavor supernova neutrino simulation using a hybrid quantum-classical algorithm with qutrits
• A Quantum-Inspired Algorithm for Wave Simulation Using Tensor Networks
• Experimental Implementation of a Qubit-Efficient Variational Quantum Eigensolver with Analog Error Mitigation on a Superconducting Quantum Processor