Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits

Abstract

In a recent paper, we showed that secondary storage can extend the range of quantum circuits that can be practically simulated with classical algorithms. Here we refine those techniques and apply them to the simulation of Sycamore circuits with 53 and 54 qubits, with the entanglement pattern ABCDCDAB that has proven difficult to classically simulate with other approaches. Our analysis shows that on the Summit supercomputer at Oak Ridge National Laboratories, such circuits can be simulated with high fidelity to arbitrary depth in a matter of days, outputting all the amplitudes.

arXiv commentAdded full listing of the tensor operations for reproducibility; fixed some typos

References in corpus (12)

• Characterizing Quantum Supremacy in Near-Term Devices
• Simulating quantum computation by contracting tensor networks
• 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• 64-Qubit Quantum Circuit Simulation
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• Quantum Supremacy Circuit Simulation on Sunway TaihuLight

Cited by in corpus (47)

• Strong quantum computational advantage using a superconducting quantum processor
• The Variational Quantum Eigensolver: a review of methods and best practices
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• Towards a Distributed Quantum Computing Ecosystem
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quantum advantage with noisy shallow circuits in 3D
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
• Quantum Computational Advantage via High-Dimensional Gaussian Boson Sampling
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Biology and medicine in the landscape of quantum advantages
• Regimes of classical simulability for noisy Gaussian boson sampling
• Classical Simulation of Quantum Supremacy Circuits
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• NISQ Computers: A Path to Quantum Supremacy
• Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction
• Simulating Noisy Quantum Circuits with Matrix Product Density Operators
• Resource-Efficient Quantum Computing by Breaking Abstractions
• Depth optimization of CZ, CNOT, and Clifford circuits
• How to simulate quantum measurement without computing marginals
• Experimental demonstration of quantum advantage for NP verification with limited information
• Simulation of quantum optics by coherent state decomposition
• Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
• A quantum circuit simulator and its applications on Sunway TaihuLight supercomputer
• Minimal informationally complete measurements for probability representation of quantum dynamics
• Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
• Echoing the recent Google success: Foundational Roots of Quantum Supremacy
• A game of quantum advantage: linking verification and simulation
• Quantum Circuit Parameters Learning with Gradient Descent Using Backpropagation
• Fast simulation of planar Clifford circuits
• On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids
• Gaussian boson sampling with partial distinguishability
• Non-Randomness of Google's Quantum Supremacy Benchmark
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Quantum-enhanced algorithms for classical target detection in complex environments
• ArsoNISQ: Analyzing Quantum Algorithms on Near-Term Architectures
• The Argument against Quantum Computers, the Quantum Laws of Nature, and Google's Supremacy Claims
• HybridQ: A Hybrid Simulator for Quantum Circuits
• Classical Coding Approaches to Quantum Applications
• Fast quantum circuit simulation using hardware accelerated general purpose libraries
• Sampling and the complexity of nature
• Efficient Construction of Functional Representations for Quantum Algorithms
• A CMOS-compatible Ising Machine with Bistable Nodes
• Low Rank Approximation in Simulations of Quantum Algorithms
• The limits of quantum circuit simulation with low precision arithmetic
• Quantum Oracle Separations from Complex but Easily Specified States
• Optimizing Quantum Variational Circuits with Deep Reinforcement Learning