Simulating Large Quantum Circuits on a Small Quantum Computer

被引:165
作者
Peng, Tianyi [1 ]
Harrow, Aram W. [2 ]
Ozols, Maris [3 ,4 ]
Wu, Xiaodi [5 ,6 ]
机构
[1] MIT, Lab Informat & Decis Syst, 77 Massachusetts Ave, Cambridge, MA 02139 USA
[2] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA
[3] Univ Amsterdam, NL-1098 XG Amsterdam, Netherlands
[4] QuSoft, NL-1098 XG Amsterdam, Netherlands
[5] Univ Maryland, Inst Adv Comp Studies, Dept Comp Sci, College Pk, MD 20742 USA
[6] Univ Maryland, Joint Ctr Quantum Informat & Comp Sci, College Pk, MD 20742 USA
关键词
COMPUTATION;
D O I
10.1103/PhysRevLett.125.150504
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
Limited quantum memory is one of the most important constraints for near-term quantum devices. Understanding whether a small quantum computer can simulate a larger quantum system, or execute an algorithm requiring more qubits than available, is both of theoretical and practical importance. In this Letter, we introduce cluster parameters K and d of a quantum circuit. The tensor network of such a circuit can be decomposed into clusters of size at most d with at most K qubits of inter-cluster quantum communication. We propose a cluster simulation scheme that can simulate any (K, d)-clustered quantum circuit on a d-qubit machine in time roughly 2(O(K)), with further speedups possible when taking more fine-grained circuit structure into account. We show how our scheme can be used to simulate clustered quantum systems-such as large molecules-that can be partitioned into multiple significantly smaller clusters with weak interactions among them. By using a suitable clustered ansatz, we also experimentally demonstrate that a quantum variational eigensolver can still achieve the desired performance for estimating the energy of the BeH2 molecule while running on a physical quantum device with half the number of required qubits.
引用
收藏
页数:6
相关论文
共 54 条
[41]   Efficient approximation of the dynamics of one-dimensional quantum spin systems [J].
Osborne, Tobias J. .
PHYSICAL REVIEW LETTERS, 2006, 97 (15)
[42]   From estimation of quantum probabilities to simulation of quantum circuits [J].
Pashayan, Hakop ;
Bartlett, Stephen D. ;
Gross, David .
QUANTUM, 2020, 4
[43]   A variational eigenvalue solver on a photonic quantum processor [J].
Peruzzo, Alberto ;
McClean, Jarrod ;
Shadbolt, Peter ;
Yung, Man-Hong ;
Zhou, Xiao-Qi ;
Love, Peter J. ;
Aspuru-Guzik, Alan ;
O'Brien, Jeremy L. .
NATURE COMMUNICATIONS, 2014, 5
[44]   Quantum Computing in the NISQ era and beyond [J].
Preskill, John .
QUANTUM, 2018, 2
[45]   Quantum Support Vector Machine for Big Data Classification [J].
Rebentrost, Patrick ;
Mohseni, Masoud ;
Lloyd, Seth .
PHYSICAL REVIEW LETTERS, 2014, 113 (13)
[46]   Quantum autoencoders for efficient compression of quantum data [J].
Romero, Jonathan ;
Olson, Jonathan P. ;
Aspuru-Guzik, Alan .
QUANTUM SCIENCE AND TECHNOLOGY, 2017, 2 (04)
[47]   Classical simulation of quantum many-body systems with a tree tensor network [J].
Shi, Y. -Y. ;
Duan, L. -M. ;
Vidal, G. .
PHYSICAL REVIEW A, 2006, 74 (02)
[48]   Fermion-to-qubit mappings with varying resource requirements for quantum simulation [J].
Steudtner, Mark ;
Wehner, Stephanie .
NEW JOURNAL OF PHYSICS, 2018, 20
[49]  
Terhal BM, 2004, QUANTUM INFORM COMPU, V4, P134
[50]   Efficient simulation of one-dimensional quantum many-body systems [J].
Vidal, G .
PHYSICAL REVIEW LETTERS, 2004, 93 (04) :040502-1