Tensor Network Quantum Simulator With Step-Dependent Parallelization

Danylo Lykov, Roman Schutski, Alexey Galda, Valeri M. Vinokur, Yuri Alexeev

20222022 IEEE International Conference on Quantum Computing and Engineering (QCE)43 citationsDOI

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 step-dependent slicing . 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 a single amplitude of QAOA ansatz state on 210 qubits. The simulation involved 1,785 gates on 1,024 nodes of the Cray XC 40 supercomputer Theta. To the best of our knowledge, this constitutes the largest simulation of QAOA ansatz simulations reported to this date.

Topics & Concepts

AnsatzQuantum computerComputer scienceSlicingQubitTensor (intrinsic definition)ComputationParallel computingQuantum circuitComputational scienceQuantum algorithmQuantumSupercomputerQuantum simulatorAlgorithmQuantum networkPhysicsMathematicsQuantum mechanicsGeometryWorld Wide WebQuantum Computing Algorithms and ArchitectureParallel Computing and Optimization TechniquesQuantum Information and Cryptography