Quantum algorithms (CO 781 CS 867 QIC 823, Winter[removed]Andrew Childs, University of Waterloo LECTURE 19: The polynomial method In this lecture we discuss a second method for establishing lower bounds on quantum query co - Irreducibility - Document - PDFSEARCH.IO

First Page	Meta Content
	Quantum algorithms (CO 781/CS 867/QIC 823, Winter[removed]Andrew Childs, University of Waterloo LECTURE 19: The polynomial method In this lecture we discuss a second method for establishing lower bounds on quantum query co Add to Reading List Document Date: 2011-03-22 17:27:48 Open Document File Size: 171,18 KB Share Result on Facebook Facility University of Waterloo LECTURE / / IndustryTerm Unstructured search / zero-error algorithms / unstructured search problem / t-query quantum algorithm / bounded-error algorithms / quantum algorithms / / Organization University of Waterloo LECTURE / / Person Andrew Childs / / Technology Quantum algorithms / bounded-error algorithms / t-query quantum algorithm / zero-error algorithms / / SocialTag Theoretical computer science Coding theory PP Quantum algorithm Berlekamp–Welch algorithm Factorization of polynomials over a finite field and irreducibility tests Mathematics Polynomials Applied mathematics

Quantum algorithms (CO 781/CS 867/QIC 823, Winter[removed]Andrew Childs, University of Waterloo LECTURE 19: The polynomial method In this lecture we discuss a second method for establishing lower bounds on quantum query coAdd to Reading List