Quantum algorithms and learning theory (Book, 2018) [WorldCat.org]
skip to content
Quantum algorithms and learning theory Preview this item
ClosePreview this item
Checking...

Quantum algorithms and learning theory

Author: Srinivasan Arunachalam
Publisher: [S.l. : s.n.] Amsterdam : Universiteit van Amsterdam [Host], 2018.
Dissertation: Proefschrift Universiteit van Amsterdam.
Series: ILLC dissertations series, DS-2018-08
Edition/Format:   Thesis/dissertation : Document : Thesis/dissertation   Computer File : EnglishView all editions and formats
Summary:
"This thesis studies strengths and weaknesses of quantum computers. In the first part we present three contributions to quantum algorithms. 1) consider a search space of N elements. One of these elements is "marked" and our goal is to find this. We describe a quantum algorithm to solve this problem using essentially sqrt{N} queries and other operations, improving over the gate count of Grover's algorithm. 2) We give  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Gedrukte uitgave:
Arunachalam, Srinivasan
Quantum algorithms and learning theory
[S.l. : s.n.], 2018.
Material Type: Document, Thesis/dissertation
Document Type: Book, Computer File
All Authors / Contributors: Srinivasan Arunachalam
OCLC Number: 1151487380
Notes: Met samenvatting in het Nederlands.
Description: 1 online resource (x, 201 p.) : ill.
Series Title: ILLC dissertations series, DS-2018-08
Responsibility: Srinivasan Arunachalam.

Abstract:

"This thesis studies strengths and weaknesses of quantum computers. In the first part we present three contributions to quantum algorithms. 1) consider a search space of N elements. One of these elements is "marked" and our goal is to find this. We describe a quantum algorithm to solve this problem using essentially sqrt{N} queries and other operations, improving over the gate count of Grover's algorithm. 2) We give a succinct characterization of quantum algorithms in terms of polynomials, and develop a new technique for showing upper and lower bounds on quantum query complexity based on this. 3) One generic technique used to compute the minimum of a given function is "gradient descent". We present a quantum gradient-calculation algorithm and a gradient-optimization algorithm that is quadratically faster than classical algorithms. In the second part of this thesis we look at quantum learning theory. 1) We survey quantum learning theory, describing the main results known for three models of learning, using classical as well as quantum data: exact learning from membership queries, the probably approximately correct (PAC) learning model, and the agnostic learning model. 2) We then consider if a quantum learner can PAC-learn a given concept class from fewer quantum examples. We give a negative answer by showing that quantum examples are not more powerful than classical random examples, both for PAC learning and for agnostic learning."--Samenvatting auteur.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.