Quantum query complexity revisited

Quantum query complexity revisited

Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. === Includes bibliographical references (leaves 30-31). === In this thesis, we look at the polynomial method for quantum query complexity and relate it to the BQPA = PA questi...

Full description

Bibliographic Details
Main Author: Preda, Daniel C. (Daniel Ciprian), 1979-
Other Authors: Madhu Sudan.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2006
Subjects:
Electrical Engineering and Computer Science.
Online Access:http://hdl.handle.net/1721.1/29689
id ndltd-MIT-oai-dspace.mit.edu-1721.1-29689
record_format oai_dc
spelling ndltd-MIT-oai-dspace.mit.edu-1721.1-296892019-05-02T16:15:36Z Quantum query complexity revisited Preda, Daniel C. (Daniel Ciprian), 1979- Madhu Sudan. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. Includes bibliographical references (leaves 30-31). In this thesis, we look at the polynomial method for quantum query complexity and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity. by Daniel C. Preda. M.Eng.and S.B. 2006-03-24T16:15:29Z 2006-03-24T16:15:29Z 2003 2003 Thesis http://hdl.handle.net/1721.1/29689 53867258 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 31 leaves 830033 bytes 829842 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology
collection NDLTD
language English
format Others
sources NDLTD
topic Electrical Engineering and Computer Science.
spellingShingle Electrical Engineering and Computer Science.
Preda, Daniel C. (Daniel Ciprian), 1979-
Quantum query complexity revisited
description Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. === Includes bibliographical references (leaves 30-31). === In this thesis, we look at the polynomial method for quantum query complexity and relate it to the BQPA = PA question for a random oracle A. We will also look at some open problems and improve some bounds relating classical and quantum complexity. === by Daniel C. Preda. === M.Eng.and S.B.
author2 Madhu Sudan.
author_facet Madhu Sudan.
Preda, Daniel C. (Daniel Ciprian), 1979-
author Preda, Daniel C. (Daniel Ciprian), 1979-
author_sort Preda, Daniel C. (Daniel Ciprian), 1979-
title Quantum query complexity revisited
title_short Quantum query complexity revisited
title_full Quantum query complexity revisited
title_fullStr Quantum query complexity revisited
title_full_unstemmed Quantum query complexity revisited
title_sort quantum query complexity revisited
publisher Massachusetts Institute of Technology
publishDate 2006
url http://hdl.handle.net/1721.1/29689
work_keys_str_mv AT predadanielcdanielciprian1979 quantumquerycomplexityrevisited
_version_ 1719037307315552256

Similar Items