Efficient tensor network simulation of IBM's largest quantum processors

Abstract

We show how quantum-inspired 2d tensor networks can be used to efficiently and accurately simulate the largest quantum processors from IBM, namely Eagle (127 qubits), Osprey (433 qubits) and Condor (1121 qubits). We simulate the dynamics of a complex quantum many-body system -- specifically, the kicked Ising experiment considered recently by IBM in Nature 618, p. 500-505 (2023) -- using graph-based Projected Entangled Pair States (gPEPS), which was proposed by some of us in PRB 99, 195105 (2019). Our results show that simple tensor updates are already sufficient to achieve very large unprecedented accuracy with remarkably low computational resources for this model. Apart from simulating the original experiment for 127 qubits, we also extend our results to 433 and 1121 qubits, and for evolution times around 8 times longer, thus setting a benchmark for the newest IBM quantum machines. We also report accurate simulations for infinitely-many qubits. Our results show that gPEPS are a natural tool to efficiently simulate quantum computers with an underlying lattice-based qubit connectivity, such as all quantum processors based on superconducting qubits.

7 pages, 8 figures, revised version

References in corpus (5)

• Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
• Accurate determination of tensor network state of quantum lattice models in two dimensions
• Algorithms for finite Projected Entangled Pair States
• Efficient tensor network simulation of IBM's Eagle kicked Ising experiment
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance

Cited by in corpus (43)

• Beyond-classical computation in quantum simulation
• Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
• Classically estimating observables of noiseless quantum circuits
• Real-time operator evolution in two and three dimensions via sparse Pauli dynamics
• Tensor networks for quantum computing
• Tensor Network Decoding Beyond 2D
• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval
• Experimental sample-efficient quantum state tomography via parallel measurements
• Noise-induced shallow circuits and absence of barren plateaus
• Simulating quantum dynamics in two-dimensional lattices with tensor network influence functional belief propagation
• Projected Entangled Pair States with flexible geometry
• Unveiling clean two-dimensional discrete time crystals on a digital quantum computer
• Optimal-order Trotter-Suzuki decomposition for quantum simulation on noisy quantum computers
• Spectral gaps of two- and three-dimensional many-body quantum systems in the thermodynamic limit
• Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• State-dependent mobility edge in kinetically constrained models
• Quantum-inspired clustering with light
• Finite temperature tensor network algorithm for frustrated two-dimensional quantum materials
• Survey on Computational Applications of Tensor Network Simulations
• Tensor Network for Anomaly Detection in the Latent Space of Proton Collision Events at the LHC
• Toolchain for Faster Iterations in Quantum Software Development
• PAC-learning of free-fermionic states is NP-hard
• Scalable projected entangled-pair state representation of random quantum circuit states
• Digitized counterdiabatic quantum critical dynamics
• Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
• Tight-Binding Energy-Phase Calculation for Topological Josephson Junction Nanowire Architecture
• Efficient Online Quantum Circuit Learning with No Upfront Training
• Qiskit-Torch-Module: Fast Prototyping of Quantum Neural Networks
• The statistical mechanics and machine learning of the $\alpha$-Rényi ensemble
• NordIQuEst: the Nordic-Estonian Quantum Computing e-Infrastructure Quest
• Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
• Implementation of Tensor Network Simulation TN-Sim under NWQ-Sim
• Variational decision diagrams for quantum-inspired machine learning applications
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
• Tensor Network Loop Cluster Expansions for Quantum Many-Body Problems
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
• Learning Minimal Representations of Fermionic Ground States