.png){kind=icon}
Return
Efficient parallelization of tensor network contraction for simulating quantum computation
.png){kind=icon}
OA
AI
DOI：10.1038/s43588-021-00119-7.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 contribution, index slicing, is a method that efficiently parallelizes the contraction by breaking it down into much smaller and identically structured subtasks, which can then be executed in parallel without dependencies. We benchmark our algorithm on a class of random quantum circuits, achieving greater than 10(5) times acceleration over the original estimate of the simulation cost. We then demonstrate applications of the simulation framework for aiding the development of quantum algorithms and quantum error correction. As tensor networks are widely used in computational science, our simulation framework may find further applications.
Keywords:
MATRIX PRODUCT STATES
SUPREMACY
GRAPHS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
18.3
Papers:
3.1K
Citations:
4.0K
Organization
Cited Papers
ShareSaveShareSaveShareSaveMatrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems.png)
ADVANCES IN PHYSICS
OAAI
ADVANCES IN PHYSICSIF13.8
OAAIShareSaveShareSave
View more