語系:
繁體中文
English
說明(常見問題)
回圖書館首頁
手機版館藏查詢
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Algorithms Bridging Quantum Computat...
~
McClean, Jarrod Ryan.
FindBook
Google Book
Amazon
博客來
Algorithms Bridging Quantum Computation and Chemistry.
紀錄類型:
書目-電子資源 : Monograph/item
正題名/作者:
Algorithms Bridging Quantum Computation and Chemistry./
作者:
McClean, Jarrod Ryan.
面頁冊數:
244 p.
附註:
Source: Dissertation Abstracts International, Volume: 77-04(E), Section: B.
Contained By:
Dissertation Abstracts International77-04B(E).
標題:
Physical chemistry. -
電子資源:
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3738997
ISBN:
9781339295350
Algorithms Bridging Quantum Computation and Chemistry.
McClean, Jarrod Ryan.
Algorithms Bridging Quantum Computation and Chemistry.
- 244 p.
Source: Dissertation Abstracts International, Volume: 77-04(E), Section: B.
Thesis (Ph.D.)--Harvard University, 2015.
The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches.
ISBN: 9781339295350Subjects--Topical Terms:
1981412
Physical chemistry.
Algorithms Bridging Quantum Computation and Chemistry.
LDR
:03229nmm a2200313 4500
001
2077661
005
20161114130339.5
008
170521s2015 ||||||||||||||||| ||eng d
020
$a
9781339295350
035
$a
(MiAaPQ)AAI3738997
035
$a
AAI3738997
040
$a
MiAaPQ
$c
MiAaPQ
100
1
$a
McClean, Jarrod Ryan.
$3
3193185
245
1 0
$a
Algorithms Bridging Quantum Computation and Chemistry.
300
$a
244 p.
500
$a
Source: Dissertation Abstracts International, Volume: 77-04(E), Section: B.
500
$a
Adviser: Alan Aspuru-Guzik.
502
$a
Thesis (Ph.D.)--Harvard University, 2015.
520
$a
The design of new materials and chemicals derived entirely from computation has long been a goal of computational chemistry, and the governing equation whose solution would permit this dream is known. Unfortunately, the exact solution to this equation has been far too expensive and clever approximations fail in critical situations. Quantum computers offer a novel solution to this problem. In this work, we develop not only new algorithms to use quantum computers to study hard problems in chemistry, but also explore how such algorithms can help us to better understand and improve our traditional approaches.
520
$a
In particular, we first introduce a new method, the variational quantum eigensolver, which is designed to maximally utilize the quantum resources available in a device to solve chemical problems. We apply this method in a real quantum photonic device in the lab to study the dissociation of the helium hydride (HeH+) molecule.
520
$a
We also enhance this methodology with architecture specific optimizations on ion trap computers and show how linear-scaling techniques from traditional quantum chemistry can be used to improve the outlook of similar algorithms on quantum computers. We then show how studying quantum algorithms such as these can be used to understand and enhance the development of classical algorithms. In particular we use a tool from adiabatic quantum computation, Feynman's Clock, to develop a new discrete time variational principle and further establish a connection between real-time quantum dynamics and ground state eigenvalue problems. We use these tools to develop two novel parallel-in-time quantum algorithms that outperform competitive algorithms as well as offer new insights into the connection between the fermion sign problem of ground states and the dynamical sign problem of quantum dynamics.
520
$a
Finally we use insights gained in the study of quantum circuits to explore a general notion of sparsity in many-body quantum systems. In particular we use developments from the field of compressed sensing to find compact representations of ground states. As an application we study electronic systems and find solutions dramatically more compact than traditional configuration interaction expansions, offering hope to extend this methodology to challenging systems in chemical and material design.
590
$a
School code: 0084.
650
4
$a
Physical chemistry.
$3
1981412
650
4
$a
Molecular physics.
$3
3174737
690
$a
0494
690
$a
0609
710
2
$a
Harvard University.
$b
Chemical Physics.
$3
3193186
773
0
$t
Dissertation Abstracts International
$g
77-04B(E).
790
$a
0084
791
$a
Ph.D.
792
$a
2015
793
$a
English
856
4 0
$u
http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3738997
筆 0 讀者評論
館藏地:
全部
電子資源
出版年:
卷號:
館藏
1 筆 • 頁數 1 •
1
條碼號
典藏地名稱
館藏流通類別
資料類型
索書號
使用類型
借閱狀態
預約狀態
備註欄
附件
W9310529
電子資源
11.線上閱覽_V
電子書
EB
一般使用(Normal)
在架
0
1 筆 • 頁數 1 •
1
多媒體
評論
新增評論
分享你的心得
Export
取書館
處理中
...
變更密碼
登入