Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction

  title={Jet: Fast quantum circuit simulations with parallel task-based tensor-network contraction},
  author={Trevor Vincent and Lee J O'Riordan and Mikhail Andrenkov and Jack Brown and Nathan Killoran and Haoyu Qi and Ish Dhand},
We introduce a new open-source software library Jet, which uses task-based parallelism to obtain speed-ups in classical tensor-network simulations of quantum circuits. These speed-ups result from i) the increased parallelism introduced by mapping the tensor-network simulation to a task-based framework, ii) a novel method of reusing shared work between tensor-network contraction tasks, and iii) the concurrent contraction of tensor networks on all available hardware. We demonstrate the advantages… 

Figures and Tables from this paper

RosneT: A Block Tensor Algebra Library for Out-of-Core Quantum Computing Simulation
RosneT, a library for distributed, out-of-core block tensor algebra, is presented, using the PyCOMPSs programming model to transform tensor operations into a collection of tasks handled by the COMPSs runtime, targeting executions in existing and upcoming Exascale supercomputers.
Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale
An end-to-end virtual quantum development environment which can scale from laptops to future exascale platforms is introduced which includes a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.
Simulation of Quantum Many-Body Dynamics with Tensor Processing Units: Floquet Prethermalization
This work demonstrates that TPUs can offer significant advantages for state-of-the-art simulations of quantum many-body dynamics, and studies the accumulation of numerical error as a function of circuit depth in very deep circuits.
QXTools: A Julia framework for distributed quantum circuit simulation
QXTools is a framework for simulating quantum circuits using tensor network methods that will efficiently calculate the probability amplitude of a given output configuration or set of configurations using random sampling approaches.
Simulation Paths for Quantum Circuit Simulation with Decision Diagrams
This work studies the importance of the path that is chosen when simulating quantum circuits using decision diagrams and proposes an open-source framework that not only allows to investigate dedicated simulation paths, but also to re-use existing findings, e.g., obtained from determining contraction plans for tensor networks.
Quantum AI simulator using a hybrid CPU-FPGA approach
This co-design of the quantum kernel and its efficient FPGA implementation enabled us to perform the largest numerical simulation of a gate-based quantum kernel in terms of input features, up to 780-dimensional features using 4000 samples.
mat2qubit: A lightweight pythonic package for qubit encodings of vibrational, bosonic, graph coloring, routing, scheduling, and general matrix problems
Mat2qubit, a Python package for encoding several classes of classical and quantum problems into qubit repre-sentations, is described, intended for use especially on Hamiltonians and functions defined over variables.
A Practical Guide to the Numerical Implementation of Tensor Networks I: Contractions, Decompositions, and Gauge Freedom
  • G. Evenbly
  • Computer Science
    Frontiers in Applied Mathematics and Statistics
  • 2022
An introduction to the contraction of tensor networks, to optimal tensor decompositions, and to the manipulation of gauge degrees of freedom in Tensor networks is presented.
Multi-Tensor Contraction for XEB Verification of Quantum Circuits
The computational advantage of noisy quantum computers has been demonstrated by sampling the bitstrings of quantum random circuits by exploiting the noise in the input and output of these circuits.


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
Hyper-optimized tensor network contraction
This work implements new randomized protocols that find very high quality contraction paths for arbitrary and large tensor networks, and introduces a hyper-optimization approach, where both the method applied and its algorithmic parameters are tuned during the path finding.
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
Simulating boson sampling in lossy architectures
It is proved that either the depth of the circuit is large enough that it can be simulated by thermal noise with an algorithm running in polynomial time, or it is shallow enough that a tensor network simulation runs in quasi-polynomial time.
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)$.
Algorithms for Tensor Network Contraction Ordering
The performance of simulated annealing and genetic algorithms, two common discrete optimization techniques, to this ordering problem are explored and it is found that the algorithms considered consistently outperform a greedy search given equal computational resources.
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
Quantum supremacy using a programmable superconducting processor
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.