Simulation of Quantum Computing on Classical Supercomputers

Abstract

Simulation of quantum computing on supercomputers is a significant research topic, which plays a vital role in quantum algorithm verification, error-tolerant verification and other applications. Tensor network contraction based on density matrix is an important single-amplitude simulation strategy, but it is hard to execute on the distributed computing systems currently. In this paper, we dive deep into this problem, and propose a scheme based on cutting edges of undirected graphs. This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs with small tree width, and these subgraphs contracted on different computing cores. The contraction results of slave cores are summarized in the master node, which is consistent with the original tensor network contraction. Thus, we can simulate the larger scale quantum circuit than single core. Moreover, it's an NP-hard problem to find the global optimum cutting edges, and we propose a search strategy based on a heuristic algorithm to approach it. In order to verify the effectiveness of our scheme, we conduct tests based on QAOA algorithm, and it can simulate 120-qubit 3-regular QAOA algorithm on 4096-core supercomputer, which greatly exceeds the simulation scale on a single core of 100-qubit.

arXiv comment6 pages, 5 figures

References in corpus (14)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Classical simulation of quantum many-body systems with a tree tensor network
• Simulating quantum computation by contracting tensor networks
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Quantum Sampling Problems, BosonSampling and Quantum Supremacy
• 64-Qubit Quantum Circuit Simulation
• Massively parallel quantum computer simulator, eleven years later
• Classical simulation versus universality in measurement based quantum computation
• General-purpose quantum circuit simulator with Projected Entangled-Pair States and the quantum supremacy frontier
• Efficient classical simulation of the approximate quantum Fourier transform
• A Benchmark Test of Boson Sampling on Tianhe-2 Supercomputer
• qTorch: The Quantum Tensor Contraction Handler
• Validating Quantum-Classical Programming Models with Tensor Network Simulations

Cited by in corpus (4)

• Large-Scale Simulation of Shor's Quantum Factoring Algorithm
• Simulation of Quantum Computers: Review and Acceleration Opportunities
• Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks
• Supercomputer model of finite-dimensional quantum electrodynamics applications