64-Qubit Quantum Circuit Simulation

Abstract

Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are several methods of simulation proposed by teams at Google and IBM. Here, we present a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56- and 42-qubit circuits on a single PC. We also estimate that a 72-qubit circuit of depth 23 can be simulated in about 16 h on a supercomputer identical to that used by the IBM team. Moreover, the simulation processes are exceedingly separable, hence parallelizable, involving just a few inter-process communications. Our work enables simulating more qubits with less hardware burden and provides a new perspective for classical simulations.

arXiv comment21 pages, 5 figures, 3 tables

References in corpus (15)

• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Characterizing Quantum Supremacy in Near-Term Devices
• Chaos in quantum channels
• Random Quantum Circuits are Approximate 2-designs
• Rapid high-fidelity multiplexed readout of superconducting qubits
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• qHiPSTER: The Quantum High Performance Software Testing Environment
• Convergence rates for arbitrary statistical moments of random quantum circuits
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Emergence of typical entanglement in two-party random processes
• Hypersensitivity to Perturbations in the Quantum Baker's Map
• Efficiency of Producing Random Unitary Matrices with Quantum Circuits
• Controlled Quantum Operations of a Semiconductor Three-Qubit System
• Hypersensitivity and chaos signatures in the quantum baker's maps

Cited by in corpus (67)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Validating quantum computers using randomized model circuits
• Simulating Large Quantum Circuits on a Small Quantum Computer
• QuEST and High Performance Simulation of Quantum Computers
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Semiconductor Quantum Computation
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• CutQC: Using Small Quantum Computers for Large Quantum Circuit Evaluations
• Computational advantage of quantum random sampling
• Full-State Quantum Circuit Simulation by Using Data Compression
• Qibo: a framework for quantum simulation with hardware acceleration
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• Massively parallel quantum computer simulator, eleven years later
• Intel Quantum Simulator: A cloud-ready high-performance simulator of quantum circuits
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Biology and medicine in the landscape of quantum advantages
• Calculation of the Green's function on near-term quantum computers
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Quantum Fast Poisson Solver: the algorithm and modular circuit design
• qTorch: The Quantum Tensor Contraction Handler
• Boundaries of quantum supremacy via random circuit sampling
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Neural-network states for the classical simulation of quantum computing
• GPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Verifying Random Quantum Circuits with Arbitrary Geometry Using Tensor Network States Algorithm
• An adaptive algorithm for quantum circuit simulation
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• A brief introduction to quantum algorithms
• Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method
• Quantum Supremacy Circuit Simulation on Sunway TaihuLight
• Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
• Chaos and Complexity from Quantum Neural Network: A study with Diffusion Metric in Machine Learning
• Quantum Simulations of SO(5) Many-Fermion Systems using Qudits
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation
• Networked Quantum Services
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams
• Qibolab: an open-source hybrid quantum operating system
• Clifford recompilation for faster classical simulation of quantum circuits
• Open source Matrix Product States: Exact diagonalization and other entanglement-accurate methods revisited in quantum systems
• Thermalization in the Quantum Ising Model - Approximations, Limits, and Beyond
• A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
• Simulation of Quantum Computing on Classical Supercomputers
• Explicit lower bounds on strong quantum simulation
• Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
• Simulation of Quantum Computers: Review and Acceleration Opportunities
• Memory-Efficient Quantum Circuit Simulation by Using Lossy Data Compression
• Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation
• Entanglement Scaling in Quantum Advantage Benchmarks
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Amplitude-Aware Lossy Compression for Quantum Circuit Simulation
• Variational Quantum Simulation of Valence-Bond Solids
• Supercomputer simulations of transmon quantum computers
• Efficient approximation of experimental Gaussian boson sampling
• Survey on Computational Applications of Tensor Network Simulations
• Efficient Mean-Field Simulation of Quantum Circuits Inspired by Density Functional Theory
• Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture
• Simulating quantum dynamics: Evolution of algorithms in the HPC context
• Quantum Computing for All: Online Courses Built Around Interactive Visual Quantum Circuit Simulator
• Hiperwalk: Simulation of Quantum Walks with Heterogeneous High-Performance Computing
• Speedup in Classical Simulation of Gaussian Boson Sampling
• Low Rank Approximation in Simulations of Quantum Algorithms
• Joint Cutting for Hybrid Schrödinger-Feynman Simulation of Quantum Circuits
• Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
• Quantum Coin Method for Numerical Integration
• High-performance parallel classical scheme for simulating shallow quantum circuits