Quantum Supremacy Circuit Simulation on Sunway TaihuLight

Abstract

With the rapid progress made by industry and academia, quantum computers with dozens of qubits or even larger size are being realized. However, the fidelity of existing quantum computers often sharply decreases as the circuit depth increases. Thus, an ideal quantum circuit simulator on classical computers, especially on high-performance computers, is needed for benchmarking and validation. We design a large-scale simulator of universal random quantum circuits, often called 'quantum supremacy circuits', and implement it on Sunway TaihuLight. The simulator can be used to accomplish the following two tasks: 1) Computing a complete output state-vector; 2) Calculating one or a few amplitudes. We target the simulation of 49-qubit circuits. For task 1), we successfully simulate such a circuit of depth 39, and for task 2) we reach the 55-depth level. To the best of our knowledge, both of the simulation results reach the largest depth for 49-qubit quantum supremacy circuits.

arXiv commentslightly modify the organisation

References in corpus (4)

• Simulating quantum computation by contracting tensor networks
• 10-qubit entanglement and parallel logic operations with a superconducting circuit
• 0.5 Petabyte Simulation of a 45-Qubit Quantum Circuit
• 64-Qubit Quantum Circuit Simulation

Cited by in corpus (16)

• Validating quantum computers using randomized model circuits
• A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
• Quantum advantage with noisy shallow circuits in 3D
• Full-State Quantum Circuit Simulation by Using Data Compression
• Leveraging Secondary Storage to Simulate Deep 54-qubit Sycamore Circuits
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Probabilistic Simulation of Quantum Circuits with the Transformer
• Quantum Supremacy Is Both Closer and Farther than It Appears
• Low cost quantum circuits for classically intractable instances of the Hamiltonian dynamics simulation problem
• Neural-network states for the classical simulation of quantum computing
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Quantum Teleportation-Inspired Algorithm for Sampling Large Random Quantum Circuits
• An adaptive algorithm for quantum circuit simulation
• Entanglement Scaling in Quantum Advantage Benchmarks
• Efficient approximation of experimental Gaussian boson sampling
• Speedup in Classical Simulation of Gaussian Boson Sampling