Quantum query complexity revisited
Name
53867258-MIT.pdf
Description
Full printable version
Size
810.39 KB
Format
Adobe PDF
Checksum (MD5)
5583cb112bd878bf55c66720d1558368
Author(s)
Preda, Daniel C. (Daniel Ciprian), 1979-
Advisor(s)
Madhu Sudan.
Date Issued
2003
Publisher
Massachusetts Institute of Technology
Abstract
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.
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).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
