Explore the intricacies of XOR-patterns in quantum computation through this comprehensive lecture from Carnegie Mellon University's Quantum Computation and Quantum Information course. Delve into topics such as sign implementation tricks, superposition, State Star, random strings, and uniform superposition. Learn from Professor Ryan O'Donnell as he guides you through the complexities of quantum computation, offering insights into general functions and garbage states. Access additional resources, including weekly assignments and a course discussion board, to enhance your understanding of this advanced topic in quantum information science.
Revealing XOR-Patterns I - Lecture 11 of Quantum Computation at CMU
Overview
Syllabus
Introduction
Sign implementation trick
Sign implementation
Superposition
State Star
Random String
Garbage
General Function
Uniform Superposition
Taught by
Ryan O'Donnell
Related Courses
-
Multi-Qubit Systems - Lecture 5 of Quantum Computation at CMU
-
Quantum "Supremacy" - Lecture 25 of Quantum Computation at CMU
-
Partial Measurements and Spooky Action at a Distance - Quantum Computation at CMU
-
Basics of Quantum Computing - Lecture 10 of Quantum Computation at CMU
-
Shor's Factoring Algorithm - Lecture 16 of Quantum Computation at CMU
-
Understanding and Measuring One Qubit - Lecture 3 of Quantum Computation and Information at CMU
