Tensor Network Quantum Simulator With Step-Dependent Parallelization
Danylo Lykov, Roman Schutski, Alexey Galda, Valerii Vinokur, Yuri, Alexeev

TL;DR
This paper introduces a large-scale quantum circuit simulator using tensor networks and a novel parallelization method, enabling simulation of 210-qubit QAOA circuits on supercomputers, advancing quantum computational research.
Contribution
The paper presents a new tensor network-based quantum simulator with step-dependent parallelization, allowing simulation of larger quantum circuits than previously possible.
Findings
Simulated 210-qubit QAOA circuits with 1,785 gates
Utilized 1,024 nodes of the Cray XC 40 supercomputer
Achieved largest reported quantum circuit simulation to date
Abstract
In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel parallelization algorithm based on \stepslice . In this paper, we push the requirement on the size of a quantum computer that will be needed to demonstrate the advantage of quantum computation with Quantum Approximate Optimization Algorithm (QAOA). We computed 210 qubit QAOA circuits with 1,785 gates on 1,024 nodes of the the Cray XC 40 supercomputer Theta. To the best of our knowledge, this constitutes the largest QAOA quantum circuit simulations reported to this date.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Parallel Computing and Optimization Techniques · Computational Physics and Python Applications
