Efficient parallelization of tensor network contraction for simulating quantum computation

33Citations
Citations of this article
28Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 105 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.

Cite

CITATION STYLE

APA

Huang, C., Zhang, F., Newman, M., Ni, X., Ding, D., Cai, J., … Chen, J. (2021). Efficient parallelization of tensor network contraction for simulating quantum computation. Nature Computational Science, 1(9), 578–587. https://doi.org/10.1038/s43588-021-00119-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free