Tensor Network Circuit Simulation at Exascale

  title={Tensor Network Circuit Simulation at Exascale},
  author={John Brennan and Momme Allalen and David Brayford and K. G. Hanley and Luigi Iapichino and Lee J O'Riordan and Myles Doyle and Niall Moran},
  journal={2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)},
  • John Brennan, M. Allalen, +5 authors N. Moran
  • Published 18 October 2021
  • Physics
  • 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS)
Tensor network methods are incredibly effective for simulating quantum circuits. This is due to their ability to efficiently represent and manipulate the wave-functions of large interacting quantum systems. We describe the challenges faced when scaling tensor network simulation approaches to Exascale compute platforms and introduce QuantEx, a framework for tensor network circuit simulation at Exascale. 

Figures and Tables from this paper


Efficient parallelization of tensor network contraction for simulating quantum computation
We develop an algorithmic framework for contracting tensor networks and demonstrate its power by classically simulating quantum computation of sizes previously deemed out of reach. Our main
Tensor Networks in a Nutshell
Tensor network methods are taking a central role in modern quantum physics and beyond. They can provide an efficient approximation to certain classes of quantum states, and the associated graphical
qTorch: The quantum tensor contraction handler
The results in this work suggest that tensor contraction methods are superior only when simulating Max-Cut/QAOA with graphs of regularities approximately five and below, and that the stochastic contraction method outperforms the line graph based method only when the time to calculate a reasonable tree decomposition is prohibitively expensive.
A flexible high-performance simulator for verifying and benchmarking quantum circuits implemented on real hardware
Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can compute both the exact amplitudes, essential for the verification of the quantum hardware, as well as
Classical Simulation of Quantum Supremacy Circuits
It is shown that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration, and an orders-of-magnitude reduction in classical simulation time is indicated.
Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of Quantum Supremacy, sustaining an average performance of 281 Pflop/s on Summit, currently the fastest supercomputer in the World, are reported.
Simulating Quantum Computation by Contracting Tensor Networks
It is proved that a quantum circuit with T gates whose underlying graph has a treewidth d can be simulated deterministically in T^{O(1)}\exp[O(d)]$ time, which, in particular, is polynomial in $T$ if d=O(\log T)$.
Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
The curse of dimensionality associated with the Hilbert space of spin systems provides a significant obstruction to the study of condensed matter systems. Tensor networks have proven an important
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of
Quantum Supremacy Is Both Closer and Farther than It Appears
A massively-parallel simulation tool Rollright is developed that does not require inter-process communication (IPC) or proprietary hardware, and two ways to trade circuit fidelity for computational speedups are developed, so as to match the fidelity of a given quantum computer --- a task previously thought impossible.