東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Applications and Verification of Quantum Computers.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Applications and Verification of Quantum Computers./
作者:	Hung, Shih-Han.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	205 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-04, Section: B.
Contained By:	Dissertations Abstracts International83-04B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28548877
ISBN:	9798460430611

Applications and Verification of Quantum Computers.
Hung, Shih-Han.

Applications and Verification of Quantum Computers. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 205 p.

Source: Dissertations Abstracts International, Volume: 83-04, Section: B.

Thesis (Ph.D.)--University of Maryland, College Park, 2021.

This item must not be sold to any third party vendors.

Quantum computing devices can solve problems that are infeasible for classical computers. While rigorously proving speedups over existing classical algorithms demonstrates the usefulness of quantum computers, analyzing the limits on efficient processes for computational tasks allows us to better understand the power of quantum computation. Indeed, hard problems for quantum computers also enable useful cryptographic applications.In this dissertation, we aim to understand the limits on efficient quantum computation and base applications on hard problems for quantum computers. We consider models in which a classical machine can leverage the power of a quantum device, which may be affected by noise or behave adversarially. We present protocols and tools for detecting errors in a quantum machine and estimate how serious the deviation is. We construct a non-interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In the setting of error-prone quantum hardware, we employ formal methods to construct a logical system for reasoning about the robustness of a quantum algorithm design.We also study the limits of ideal quantum computers for computational tasks and give asymptotically optimal algorithms. In particular, we give quantum algorithms which provide speedups for the polynomial interpolation problem and show their optimality. Finally, we study the performance of quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. In particular, we show that for various linear algebra problems, there is no quantum speedup, while for some problems, exponential speedups can be achieved.

ISBN: 9798460430611Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Quantum computing

Applications and Verification of Quantum Computers.
LDR:02795nmm a2200349 4500 001 2344649
005 20220531064616.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798460430611
035 $a (MiAaPQ)AAI28548877
035 $a AAI28548877
040 $a MiAaPQ $c MiAaPQ
100 1 $a Hung, Shih-Han. $0 (orcid)0000-0003-3410-7466 $3 3683435
245 1 0 $a Applications and Verification of Quantum Computers.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 205 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-04, Section: B.
500 $a Advisor: Childs, Andrew M.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Quantum computing devices can solve problems that are infeasible for classical computers. While rigorously proving speedups over existing classical algorithms demonstrates the usefulness of quantum computers, analyzing the limits on efficient processes for computational tasks allows us to better understand the power of quantum computation. Indeed, hard problems for quantum computers also enable useful cryptographic applications.In this dissertation, we aim to understand the limits on efficient quantum computation and base applications on hard problems for quantum computers. We consider models in which a classical machine can leverage the power of a quantum device, which may be affected by noise or behave adversarially. We present protocols and tools for detecting errors in a quantum machine and estimate how serious the deviation is. We construct a non-interactive protocol that enables a purely classical party to delegate any quantum computation to an untrusted quantum prover. In the setting of error-prone quantum hardware, we employ formal methods to construct a logical system for reasoning about the robustness of a quantum algorithm design.We also study the limits of ideal quantum computers for computational tasks and give asymptotically optimal algorithms. In particular, we give quantum algorithms which provide speedups for the polynomial interpolation problem and show their optimality. Finally, we study the performance of quantum algorithms that learn properties of a matrix using queries that return its action on an input vector. In particular, we show that for various linear algebra problems, there is no quantum speedup, while for some problems, exponential speedups can be achieved.
590 $a School code: 0117.
650 4 $a Computer science. $3 523869
650 4 $a Quantum physics. $3 726746
653 $a Quantum computing
653 $a Algorithm
653 $a Problem
653 $a Verification
690 $a 0984
690 $a 0599
710 2 $a University of Maryland, College Park. $b Computer Science. $3 1018451
773 0 $t Dissertations Abstracts International $g 83-04B.
790 $a 0117
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28548877