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:
Online Access:http://hdl.handle.net/1721.1/29689