Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method
文献类型：期刊论文
| 作者 | Pan, Feng2; Zhang, Pan1,3
|
| 刊名 | PHYSICAL REVIEW LETTERS
 |
| 出版日期 | 2022 |
| 卷号 | 128期号:3页码:30501 |
| 关键词 | SUPREMACY |
| ISSN号 | 0031-9007 |
| DOI | 10.1103/PhysRevLett.128.030501 |
| 英文摘要 | We propose a tensor network approach to compute amplitudes and probabilities for a large number of correlated bitstrings in the final state of a quantum circuit. As an application, we study Google's Sycamore circuits, which are believed to be beyond the reach of classical supercomputers and have been used to demonstrate quantum supremacy. By employing a small computational cluster containing 60 graphical processing units (GPUs), we compute exact amplitudes and probabilities of 2 x 10(6) correlated bitstrings with some entries fixed (which span a subspace of the output probability distribution) for the Sycamore circuit with 53 qubits and 20 cycles. The obtained results verify the Porter-Thomas distribution of the large and deep quantum circuits of Google, provide datasets and benchmarks for developing approximate simulation methods, and can be used for spoofing the linear cross entropy benchmark of quantum supremacy. Then we extend the proposed big-batch method to a full-amplitude simulation approach that is more efficient than the existing Schrodinger method on shallow circuits and the Schrodinger-Feynman method in general, enabling us to obtain the state vector of Google's simplifiable circuit with n = 43 qubits and m = 14 cycles using only one GPU. We also manage to obtain the state vector for Google's simplifiable circuits with n = 50 qubits and m = 14 cycles using a small GPU cluster, breaking the previous record on the number of qubits in full-amplitude simulations. Our method is general in computing bitstring probabilities for a broad class of quantum circuits and can find applications in the verification of quantum computers. We anticipate that our method will pave the way for combining tensor network-based classical computations and near-term quantum computations for solving challenging problems in the real world. |
| 学科主题 | Physics |
| 语种 | 英语 |
| 源URL | [http://ir.itp.ac.cn/handle/311006/27856]  |
| 专题 | 理论物理研究所_理论物理所1978-2010年知识产出 |
| 作者单位 | 1.UCAS, Hangzhou Inst Adv Study, Sch Fundamental Phys & Math Sci, Hangzhou 310024, Peoples R China 2.Chinese Acad Sci, Inst Theoret Phys, CAS Key Lab Theoret Phys, Beijing 100190, Peoples R China 3.Univ Chinese Acad Sci, Sch Phys Sci, Beijing 100049, Peoples R China 4.Int Ctr Theoret Phys Asia Pacific, Beijing, Peoples R China |
| 推荐引用方式 GB/T 7714 | Pan, Feng,Zhang, Pan. Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method[J]. PHYSICAL REVIEW LETTERS,2022,128(3):30501. |
| APA | Pan, Feng,&Zhang, Pan.(2022).Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method.PHYSICAL REVIEW LETTERS,128(3),30501. |
| MLA | Pan, Feng,et al."Simulation of Quantum Circuits Using the Big-Batch Tensor Network Method".PHYSICAL REVIEW LETTERS 128.3(2022):30501. |
入库方式： OAI收割
来源：理论物理研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。