Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral

Abstract

With the current rate of progress in quantum computing technologies, systems with more than 50 qubits will soon become reality. Computing ideal quantum state amplitudes for circuits of such and larger sizes is a fundamental step to assess both the correctness, performance, and scaling behavior of quantum algorithms and the fidelities of quantum devices. However, resource requirements for such calculations on classical computers grow exponentially. We show that deferring tensor contractions can extend the boundaries of what can be computed on classical systems. To demonstrate this technique, we present results obtained from a calculation of the complete set of output amplitudes of a universal random circuit with depth 27 in a 2D lattice of $7\times 7$ qubits, and an arbitrarily selected slice of $2^{37}$ amplitudes of a universal random circuit with depth 23 in a 2D lattice of $8\times 7$ qubits. Combining our methodology with other decomposition approaches found in the literature, we show that we can simulate $7\times 7$-qubit random circuits to arbitrary depth by leveraging secondary storage. These calculations were thought to be impossible due to resource requirements.

Uploaded full version of the original paper, which includes additional experiments and comparisons with the literature

References in corpus (14)

• Quantum Computational Supremacy
• Experimental Comparison of Two Quantum Computing Architectures
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• High-Fidelity Readout in Circuit Quantum Electrodynamics Using the Jaynes-Cummings Nonlinearity
• Verification of quantum computation: An overview of existing approaches
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Quantum computing and the entanglement frontier
• Explicit tensor network representation for the ground states of string-net models
• 64-Qubit Quantum Circuit Simulation
• Simulation of low-depth quantum circuits as complex undirected graphical models
• Classical Simulation of Intermediate-Size Quantum Circuits
• qTorch: The Quantum Tensor Contraction Handler
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Quantum Supremacy Circuit Simulation on Sunway TaihuLight

Cited by in corpus (25)

• Quantum Computing in the NISQ era and beyond
• Toward the first quantum simulation with quantum speedup
• 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
• Massively parallel quantum computer simulator, eleven years later
• Classical Simulation of Quantum Supremacy Circuits
• qTorch: The Quantum Tensor Contraction Handler
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Optimising Matrix Product State Simulations of Shor's Algorithm
• Tensor networks for quantum computing
• Stabilizer rank and higher-order Fourier analysis
• An efficient quantum circuits optimizing scheme compared with QISKit
• Explicit lower bounds on strong quantum simulation
• Memory-Efficient Quantum Circuit Simulation by Using Lossy Data Compression
• Entanglement Scaling in Quantum Advantage Benchmarks
• Amplitude-Aware Lossy Compression for Quantum Circuit Simulation
• Fast simulation of planar Clifford circuits
• Tensor Networks for Simulating Quantum Circuits on FPGAs
• On Stability of Tensor Networks and Canonical Forms
• The Future of Computing: Bits + Neurons + Qubits
• Importance of Diagonal Gates in Tensor Network Simulations
• Speedup in Classical Simulation of Gaussian Boson Sampling
• Low Rank Approximation in Simulations of Quantum Algorithms
• Benchmarking Supercomputers with the Jülich Universal Quantum Computer Simulator