Quantum query complexity revisited
Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/29689 |
| _version_ | 1826207548728934400 |
|---|---|
| author | Preda, Daniel C. (Daniel Ciprian), 1979- |
| author2 | Madhu Sudan. |
| author_facet | Madhu Sudan. Preda, Daniel C. (Daniel Ciprian), 1979- |
| author_sort | Preda, Daniel C. (Daniel Ciprian), 1979- |
| collection | MIT |
| description | Thesis (M.Eng. and S.B.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003. |
| first_indexed | 2024-09-23T13:51:17Z |
| format | Thesis |
| id | mit-1721.1/29689 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:51:17Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/296892019-04-10T21:29:26Z 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 |
| spellingShingle | Electrical Engineering and Computer Science. Preda, Daniel C. (Daniel Ciprian), 1979- Quantum query complexity revisited |
| title | Quantum query complexity revisited |
| title_full | Quantum query complexity revisited |
| title_fullStr | Quantum query complexity revisited |
| title_full_unstemmed | Quantum query complexity revisited |
| title_short | Quantum query complexity revisited |
| title_sort | quantum query complexity revisited |
| topic | Electrical Engineering and Computer Science. |
| url | http://hdl.handle.net/1721.1/29689 |
| work_keys_str_mv | AT predadanielcdanielciprian1979 quantumquerycomplexityrevisited |