期刊
NEW JOURNAL OF PHYSICS
卷 14, 期 -, 页码 -出版社
IOP PUBLISHING LTD
DOI: 10.1088/1367-2630/14/11/115023
关键词
-
资金
- National Science Foundation [CCF-0829694, 1017244]
- University of Tokyo Special Coordination Funds for Promoting Science and Technology
- NICT
- Japan Society for the Promotion of Science (JSPS)
- Air Force Office of Scientific Research [FA8721-05-C-0002]
- Alfred P Sloan Foundation
- Camille and Henry Dreyfus Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1017244] Funding Source: National Science Foundation
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on fault-tolerant quantum computers; these methods generalize readily to other quantum simulation problems. Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource. To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform. Comput. 6 81). For a given approximation error epsilon, arbitrary single-qubit gates can be produced fault-tolerantly and using a restricted set of gates in time which is O(log epsilon) or O(log log epsilon); with sufficient parallel preparation of ancillas, constant average depth is possible using a method we call programmable ancilla rotations. Moreover, we construct and analyze efficient implementations of first- and second-quantized simulation algorithms using the fault-tolerant arbitrary gates and other techniques, such as implementing various subroutines in constant time. A specific example we analyze is the ground-state energy calculation for lithium hydride.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据