.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
MATRIX PRODUCT STATES
SUPREMACY
GRAPHS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
18.3
论文数:
3.1K
被引数:
4.0K
机构
引用论文
分享收藏Towards a cyanobacterial biorefinery: Carbohydrate fingerprint, biocomposition and enzymatic hydrolysis of Nostoc biomass走向蓝细菌生物精炼厂: Nostoc生物质的碳水化合物指纹，生物组成和酶促水解
PREAI
分享收藏Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems量子自旋系统的矩阵乘积态，投影纠缠态和变分重归一化组方法.png)
ADVANCES IN PHYSICS
OAAI
ADVANCES IN PHYSICSIF13.8
OAAI分享收藏
查看更多内容