| dc.contributor.advisor | Madhu Sudan. | en_US |
| dc.contributor.author | Preda, Daniel C. (Daniel Ciprian), 1979- | en_US |
| dc.contributor.other | Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
| dc.date.accessioned | 2006-03-24T16:15:29Z | |
| dc.date.available | 2006-03-24T16:15:29Z | |
| dc.date.copyright | 2003 | en_US |
| dc.date.issued | 2003 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/29689 | |
| dc.description | Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. | en_US |
| dc.description | Includes bibliographical references (leaves 30-31). | en_US |
| dc.description.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. | en_US |
| dc.description.statementofresponsibility | by Daniel C. Preda. | en_US |
| dc.format.extent | 31 leaves | en_US |
| dc.format.extent | 830033 bytes | |
| dc.format.extent | 829842 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | eng | en_US |
| dc.publisher | Massachusetts Institute of Technology | en_US |
| dc.rights | 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. | en_US |
| dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
| dc.subject | Electrical Engineering and Computer Science. | en_US |
| dc.title | Quantum query complexity revisited | en_US |
| dc.type | Thesis | en_US |
| dc.description.degree | M.Eng.and S.B. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.identifier.oclc | 53867258 | en_US |
