東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Quantum Computing for Optimization and Machine Learning.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Quantum Computing for Optimization and Machine Learning./
作者:	Chakrabarti, Shouvanik.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2022,
面頁冊數:	454 p.
附註:	Source: Dissertations Abstracts International, Volume: 84-01, Section: B.
Contained By:	Dissertations Abstracts International84-01B.
標題:	Computer science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29068886
ISBN:	9798834033349

Quantum Computing for Optimization and Machine Learning.
Chakrabarti, Shouvanik.

Quantum Computing for Optimization and Machine Learning. - Ann Arbor : ProQuest Dissertations & Theses, 2022 - 454 p.

Source: Dissertations Abstracts International, Volume: 84-01, Section: B.

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

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

Quantum Computing leverages the quantum properties of subatomic matter to enable computations faster than those possible on a regular computer. Quantum Computers have become increasingly practical in recent years, with some small-scale machines becoming available for public use. The rising importance of machine learning has highlighted a large class of computing and optimization problems that process massive amounts of data and incur correspondingly large computational costs. This raises the natural question of how quantum computers may be leveraged to solve these problems more efficiently. This dissertation presents some encouraging results on the design of quantum algorithms for machine learning and optimization.We first focus on tasks with provably more efficient quantum algorithms. We show a quantum speedup for convex optimization by extending quantum gradient estimation algorithms to efficiently compute subgradients of non-differentiable functions. We also develop a quantum framework for simulated annealing algorithms which is used to show a quantum speedup in estimating the volumes of convex bodies. Finally, we demonstrate a quantum algorithm for solving matrix games, which can be applied to a variety of learning problems such as linear classification, minimum enclosing ball, and ℓ - 2 margin SVMs.We then shift our focus to variational quantum algorithms, which describe a family of heuristic algorithms that use parameterized quantum circuits as function models that can be fit for various learning and optimization tasks. We seek to analyze the properties of these algorithms including their efficient formulation and training, expressivity, and the convergence of the associated optimization problems. We formulate a model of quantum Wasserstein GANs in order to facilitate the robust and scalable generative learning of quantum states. We also investigate the expressivity of so called Quantum Neural Networks compared to classical ReLU networks and investigate both theoretical and empirical separations. Finally, we leverage the theory of overparameterization in variational systems to give sufficient conditions on the convergence of Variational Quantum Eigensolvers. We use these conditions to design principles to study and evaluate the design of these systems.

ISBN: 9798834033349Subjects--Topical Terms:

523869
Computer science.
Subjects--Index Terms:

Machine learning

Quantum Computing for Optimization and Machine Learning.
LDR:03425nmm a2200361 4500 001 2352215
005 20221118093845.5
008 241004s2022 ||||||||||||||||| ||eng d
020 $a 9798834033349
035 $a (MiAaPQ)AAI29068886
035 $a AAI29068886
040 $a MiAaPQ $c MiAaPQ
100 1 $a Chakrabarti, Shouvanik. $0 (orcid)0000-0002-9159-4881 $3 3691834
245 1 0 $a Quantum Computing for Optimization and Machine Learning.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2022
300 $a 454 p.
500 $a Source: Dissertations Abstracts International, Volume: 84-01, Section: B.
500 $a Advisor: Wu, Xiaodi.
502 $a Thesis (Ph.D.)--University of Maryland, College Park, 2022.
506 $a This item must not be sold to any third party vendors.
520 $a Quantum Computing leverages the quantum properties of subatomic matter to enable computations faster than those possible on a regular computer. Quantum Computers have become increasingly practical in recent years, with some small-scale machines becoming available for public use. The rising importance of machine learning has highlighted a large class of computing and optimization problems that process massive amounts of data and incur correspondingly large computational costs. This raises the natural question of how quantum computers may be leveraged to solve these problems more efficiently. This dissertation presents some encouraging results on the design of quantum algorithms for machine learning and optimization.We first focus on tasks with provably more efficient quantum algorithms. We show a quantum speedup for convex optimization by extending quantum gradient estimation algorithms to efficiently compute subgradients of non-differentiable functions. We also develop a quantum framework for simulated annealing algorithms which is used to show a quantum speedup in estimating the volumes of convex bodies. Finally, we demonstrate a quantum algorithm for solving matrix games, which can be applied to a variety of learning problems such as linear classification, minimum enclosing ball, and ℓ - 2 margin SVMs.We then shift our focus to variational quantum algorithms, which describe a family of heuristic algorithms that use parameterized quantum circuits as function models that can be fit for various learning and optimization tasks. We seek to analyze the properties of these algorithms including their efficient formulation and training, expressivity, and the convergence of the associated optimization problems. We formulate a model of quantum Wasserstein GANs in order to facilitate the robust and scalable generative learning of quantum states. We also investigate the expressivity of so called Quantum Neural Networks compared to classical ReLU networks and investigate both theoretical and empirical separations. Finally, we leverage the theory of overparameterization in variational systems to give sufficient conditions on the convergence of Variational Quantum Eigensolvers. We use these conditions to design principles to study and evaluate the design of these systems.
590 $a School code: 0117.
650 4 $a Computer science. $3 523869
650 4 $a Quantum physics. $3 726746
650 4 $a Artificial intelligence. $3 516317
653 $a Machine learning
653 $a Optimization theory
653 $a Quantum algorithms
653 $a Quantum computing
690 $a 0984
690 $a 0599
690 $a 0800
710 2 $a University of Maryland, College Park. $b Computer Science. $3 1018451
773 0 $t Dissertations Abstracts International $g 84-01B.
790 $a 0117
791 $a Ph.D.
792 $a 2022
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=29068886