Scalable projected entangled-pair state representation of random quantum circuit states
arXiv:2504.04769 · doi:10.1103/rzgm-cywf
Abstract
Classical simulation of a programmable quantum processor is crucial in identifying the threshold of a quantum advantage. We demonstrate the simple update of projected entangled-pair states (PEPSs) in the Vidal gauge that represent random quantum circuit states, which center around recent quantum advantage claims. Applied to square lattices of qubits akin to state-of-the-art superconducting processors, the PEPS representation is exact for circuit depths less than = , where is the maximum bond dimension and depends on the choice of two-qubit gates, independent of the qubit number . We find the universal scaling behaviors of the state fidelity by treating large-scale circuits of , using on a conventional CPU. Our method has a polynomial scaling of computational costs with for circuit depth and is more advantageous than matrix product state approaches if is large. This work underscores PEPSs as a scalable tool for benchmarking quantum algorithms with future potential for sampling applications using advanced contraction techniques.
References in corpus (62)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- The density-matrix renormalization group in the age of matrix product states
- Area laws for the entanglement entropy - a review
- Efficient classical simulation of slightly entangled quantum computations
- 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
- Efficient simulation of one-dimensional quantum many-body systems
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Characterizing Quantum Supremacy in Near-Term Devices
- Classical simulation of infinite-size quantum lattice systems in one spatial dimension
- Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Contextuality supplies the magic for quantum computation
- Stripe order in the underdoped region of the two-dimensional Hubbard model
- Tensor networks for complex quantum systems
- Accurate determination of tensor network state of quantum lattice models in two dimensions
- Prethermalization
- Simulating quantum computation by contracting tensor networks
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Simulation of strongly correlated fermions in two spatial dimensions with fermionic Projected Entangled-Pair States
- The computational complexity of PEPS
- Algorithms for finite Projected Entangled Pair States
- What limits the simulation of quantum computers?
- Hyper-optimized tensor network contraction
- Loop optimization for tensor network renormalization
- Preparing random states and benchmarking with many-body quantum chaos
- Computational advantage of quantum random sampling
- Solving the sampling problem of the Sycamore quantum circuits
- Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
- Isometric Tensor Network States in Two Dimensions
- Unifying Projected Entangled Pair States contractions
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Phase transition in Random Circuit Sampling
- Renormalization of tensor networks using graph independent local truncations
- Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
- Efficient simulation of infinite tree tensor network states on the Bethe lattice
- General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Optimized Decimation of Tensor Networks with Super-orthogonalization for Two-Dimensional Quantum Lattice Models
- Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
- Fast convergence of imaginary time evolution tensor network algorithms by recycling the environment
- Efficient tensor network simulation of IBM's largest quantum processors
- Benchmarking highly entangled states on a 60-atom analog quantum simulator
- Isometric Tensor Network representation of string-net liquids
- Tight bounds on the convergence of noisy random circuits to the uniform distribution
- Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
- Fate of the cluster state on the square lattice in a magnetic field
- Conversion of projected entangled pair states into a canonical form
- Efficient Simulation of Dynamics in Two-Dimensional Quantum Spin Systems with Isometric Tensor Networks
- Gauging tensor networks with belief propagation
- Variational methods for contracting projected entangled-pair states
- The computational power of random quantum circuits in arbitrary geometries
- A beginner's guide to non-abelian iPEPS for correlated fermions
- Three-dimensional isometric tensor networks
- Nuclear norm regularized loop optimization for tensor network
- Anticoncentration and state design of random tensor networks
- Scaling dimensions from linearized tensor renormalization group transformations
- Isometric tensor network representations of two-dimensional thermal states
- Efficient Representation of Minimally Entangled Typical Thermal States in two dimensions via Projected Entangled Pair States
- Measurement-induced entanglement and complexity in random constant-depth 2D quantum circuits
- Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
- Efficient optimization and conceptual barriers in variational finite Projected Entangled-Pair States