東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Quantum Algorithms for Scientific Co...

Hadfield, Stuart Andrew.

FindBook

Google Book

Amazon

博客來

Quantum Algorithms for Scientific Computing and Approximate Optimization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quantum Algorithms for Scientific Computing and Approximate Optimization./
作者:	Hadfield, Stuart Andrew.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2018,
面頁冊數:	264 p.
附註:	Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
Contained By:	Dissertation Abstracts International79-08B(E).
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10746272
ISBN:	9780355680447

Quantum Algorithms for Scientific Computing and Approximate Optimization.
Hadfield, Stuart Andrew.

Quantum Algorithms for Scientific Computing and Approximate Optimization. - Ann Arbor : ProQuest Dissertations & Theses, 2018 - 264 p.

Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.

Thesis (Ph.D.)--Columbia University, 2018.

Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we study the application of quantum computers to computational problems in science and engineering, and to combinatorial optimization problems. We outline the results below.

ISBN: 9780355680447Subjects--Topical Terms:

523869
Computer science.

Quantum Algorithms for Scientific Computing and Approximate Optimization.
LDR:05086nmm a2200361 4500 001 2162115
005 20180927111920.5
008 190424s2018 ||||||||||||||||| ||eng d
020 $a 9780355680447
035 $a (MiAaPQ)AAI10746272
035 $a (MiAaPQ)columbia:14445
035 $a AAI10746272
040 $a MiAaPQ $c MiAaPQ
100 1 $a Hadfield, Stuart Andrew. $3 3350091
245 1 0 $a Quantum Algorithms for Scientific Computing and Approximate Optimization.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2018
300 $a 264 p.
500 $a Source: Dissertation Abstracts International, Volume: 79-08(E), Section: B.
500 $a Adviser: Alfred V. Aho.
502 $a Thesis (Ph.D.)--Columbia University, 2018.
520 $a Quantum computation appears to offer significant advantages over classical computation and this has generated a tremendous interest in the field. In this thesis we study the application of quantum computers to computational problems in science and engineering, and to combinatorial optimization problems. We outline the results below.
520 $a Algorithms for scientific computing require modules, i.e., building blocks, implementing elementary numerical functions that have well-controlled numerical error, are uniformly scalable and reversible, and that can be implemented efficiently. We derive quantum algorithms and circuits for computing square roots, logarithms, and arbitrary fractional powers, and derive worst-case error and cost bounds. We describe a modular approach to quantum algorithm design as a first step towards numerical standards and mathematical libraries for quantum scientific computing.
520 $a A fundamental but computationally hard problem in physics is to solve the time-independent Schrodinger equation. This is accomplished by computing the eigenvalues of the corresponding Hamiltonian operator. The eigenvalues describe the different energy levels of a system. The cost of classical deterministic algorithms computing these eigenvalues grows exponentially with the number of system degrees of freedom. The number of degrees of freedom is typically proportional to the number of particles in a physical system. We show an efficient quantum algorithm for approximating a constant number of low-order eigenvalues of a Hamiltonian using a perturbation approach. We apply this algorithm to a special case of the Schrodinger equation and show that our algorithm succeeds with high probability, and has cost that scales polynomially with the number of degrees of freedom and the reciprocal of the desired accuracy. This improves and extends earlier results on quantum algorithms for estimating the ground state energy.
520 $a We consider the simulation of quantum mechanical systems on a quantum computer. We show a novel divide and conquer approach for Hamiltonian simulation. Using the Hamiltonian structure, we can obtain faster simulation algorithms. Considering a sum of Hamiltonians we split them into groups, simulate each group separately, and combine the partial results. Simulation is customized to take advantage of the properties of each group, and hence yield refined bounds to the overall simulation cost. We illustrate our results using the electronic structure problem of quantum chemistry, where we obtain significantly improved cost estimates under mild assumptions.
520 $a We turn to combinatorial optimization problems. An important open question is whether quantum computers provide advantages for the approximation of classically hard combinatorial problems. A promising recently proposed approach of Farhi et al. is the Quantum Approximate Optimization Algorithm (QAOA). We study the application of QAOA to the Maximum Cut problem, and derive analytic performance bounds for the lowest circuit-depth realization, for both general and special classes of graphs. Along the way, we develop a general procedure for analyzing the performance of QAOA for other problems, and show an example demonstrating the difficulty of obtaining similar results for greater depth.
520 $a We show a generalization of QAOA and its application to wider classes of combinatorial optimization problems, in particular, problems with feasibility constraints. We introduce the Quantum Alternating Operator Ansatz, which utilizes more general unitary operators than the original QAOA proposal. Our framework facilitates low-resource implementations for many applications which may be particularly suitable for early quantum computers. We specify design criteria, and develop a set of results and tools for mapping diverse problems to explicit quantum circuits. We derive constructions for several important prototypical problems including Maximum Independent Set, Graph Coloring, and the Traveling Salesman problem, and show appealing resource cost estimates for their implementations.
590 $a School code: 0054.
650 4 $a Computer science. $3 523869
650 4 $a Quantum physics. $3 726746
690 $a 0984
690 $a 0599
710 2 $a Columbia University. $b Computer Science. $3 1679268
773 0 $t Dissertation Abstracts International $g 79-08B(E).
790 $a 0054
791 $a Ph.D.
792 $a 2018
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10746272