Gate-count estimates for performing quantum chemistry on small quantum computers

被引:216
作者
Wecker, Dave [1 ]
Bauer, Bela [2 ]
Clark, Bryan K. [2 ,3 ,4 ]
Hastings, Matthew B. [1 ,2 ]
Troyer, Matthias [5 ]
机构
[1] Microsoft Res, Quantum Architectures & Computat Grp, Redmond, WA 98052 USA
[2] Microsoft Res, Stn Q, Santa Barbara, CA 93106 USA
[3] Univ Calif Santa Barbara, Kavli Inst Theoret Phys, Santa Barbara, CA 93106 USA
[4] Univ Illinois, Dept Phys, Urbana, IL 61801 USA
[5] ETH, CH-8093 Zurich, Switzerland
基金
美国国家科学基金会;
关键词
ELECTRONIC WAVE-FUNCTIONS; HAMILTONIAN SIMULATION; ALGORITHM;
D O I
10.1103/PhysRevA.90.022305
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
As quantum computing technology improves and quantum computers with a small but nontrivial number of N >= 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems and, in particular, the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a 10-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.
引用
收藏
页数:13
相关论文
共 75 条
[1]   A Polynomial Quantum Algorithm for Approximating the Jones Polynomial [J].
Aharonov, Dorit ;
Jones, Vaughan ;
Landau, Zeph .
ALGORITHMICA, 2009, 55 (03) :395-421
[2]  
[Anonymous], 2013, ARXIV13122579
[3]  
[Anonymous], 2013, ARXIV13102984
[4]  
[Anonymous], ARXIV14024467
[5]  
[Anonymous], PROGR PHYS CHEM
[6]  
[Anonymous], 2005, P ACM IEEE DC 2005 C
[7]  
[Anonymous], 2010006 CRYPT
[8]  
[Anonymous], 2014, ARXIV14031539
[9]  
[Anonymous], ACM SIGARCH COMPUT A
[10]  
[Anonymous], 2002, CLASSICAL QUANTUM CO