Tensor Network Quantum Simulator With Step-Dependent Parallelization

Alexey Galda; Danylo Lykov; Roman Schutski; Valerii Vinokur; Yuri Alexeev

Tensor Network Quantum Simulator With Step-Dependent Parallelization

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.02430 v2 pith:Q5FY3RDO submitted 2020-12-04 quant-ph

Danylo Lykov , Roman Schutski , Alexey Galda , Valerii Vinokur , Yuri Alexeev This is my paper · ORCID

classification quant-ph

keywords quantumqaoaalgorithmcircuitcircuitsnetworkparallelizationsimulator

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
cs.ET 2025-02 reject novelty 4.0 of 10

Any finite combinatorial problem with a known logical circuit can be encoded as a tensor network whose contraction defines an explicit, though generally inefficient, solution equation.

Pith tools