Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm

Abstract

The ability to efficiently simulate random quantum circuits using a classical computer is increasingly important for developing Noisy Intermediate-Scale Quantum devices. Here we present a tensor network states based algorithm specifically designed to compute amplitudes for random quantum circuits with arbitrary geometry. Singular value decomposition based compression together with a two-sided circuit evolution algorithm are used to further compress the resulting tensor network. To further accelerate the simulation, we also propose a heuristic algorithm to compute the optimal tensor contraction path. We demonstrate that our algorithm is up to $2$ orders of magnitudes faster than the Sch$\ddot{\text{o}}$dinger-Feynman algorithm for verifying random quantum circuits on the $53$-qubit Sycamore processor, with circuit depths below $12$. We also simulate larger random quantum circuits up to $104$ qubits, showing that this algorithm is an ideal tool to verify relatively shallow quantum circuits on near-term quantum computers.

5 pages, 3 figures, 1 table

References in corpus (28)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Supervised learning with quantum enhanced feature spaces
• Quantum Convolutional Neural Networks
• Characterizing Quantum Supremacy in Near-Term Devices
• Randomized Benchmarking of Quantum Gates
• Quantum Computational Supremacy
• Hartree-Fock on a superconducting qubit quantum computer
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Criticality, the area law, and the computational power of PEPS
• Scalable Noise Estimation with Random Unitary Operators
• Simulating quantum computation by contracting tensor networks
• A blueprint for demonstrating quantum supremacy with superconducting qubits
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Superconducting Quantum Computing: A Review
• Average-case complexity versus approximate simulation of commuting quantum computations
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Massive Parallel Quantum Computer Simulator
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• 64-Qubit Quantum Circuit Simulation
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
• Variational Quantum Circuits for Quantum State Tomography
• Validating Quantum-Classical Programming Models with Tensor Network Simulations
• Simulating the Dynamics of Single Photons in BosonSampling Devices with Matrix Product States

Cited by in corpus (16)

• Strong quantum computational advantage using a superconducting quantum processor
• Hybrid Quantum-Classical Convolutional Neural Networks
• Computational advantage of quantum random sampling
• Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Recovering single precision accuracy from Tensor Cores while surpassing the FP32 theoretical peak performance
• Tensor networks for interpretable and efficient quantum-inspired machine learning
• Q${}^2$Chemistry: A quantum computation platform for quantum chemistry
• Validating quantum-supremacy experiments with exact and fast tensor network contraction
• Noise-Resistant Quantum State Compression Readout
• Simulating quantum circuits using efficient tensor network contraction algorithms with subexponential upper bound
• QFactor: A Domain-Specific Optimizer for Quantum Circuit Instantiation
• Identification of topological phases using classically-optimized variational quantum eigensolver
• Evaluating the Resilience of Variational Quantum Algorithms to Leakage Noise
• Improved real-space parallelizable matrix-product state compression and its application to unitary quantum dynamics simulation
• State of practice: evaluating GPU performance of state vector and tensor network methods