¸£Àû±ÆÕ¾

The course will develop some well-known algorithms in quantum computing. Learning about quantum algorithms requires background in linear algebra and quantum gates, and many of our algorithmic insights will come from a signal processing angle. Therefore, we will review linear algebra, signal processing, and quantum gates. (Some students will not have all the background, in which case they should be willing to work somewhat harder during the first half of the course as we review these concepts. Specifically, students are expected to have encountered Fourier transforms in past coursework, but a review will be provided for those less familiar with the topic.) Armed with this background, we will study several quantum algorithms based on the quantum Hadamard and Fourier transforms, which connect to signal processing. Grover's unstructured quantum search algorithm will also be covered.

Restriction: Much of the background will be covered during the first half of the course. Students who are unsure about their linear algebra and signal processing background can consult with the instructor

Typically offered in Spring only