Skip to content
lectern.tv
CMU 15-859BB: Quantum Computation and Quantum Information →0/17
1

10^500 Parallel Universes

1:08:48
2

Rotate, Compute, Rotate

1:20:24
3

Understanding and Measuring One Qubit

1:21:29
4

Unitary Transformations and the Elitzur--Vaidman Bomb

1:21:50
5

Multi-Qubit Systems

1:22:43
6

Partial Measurements and Spooky Action at a Distance

1:22:24
7

The CHSH Game

53:31
8

No Cloning Theorem, and Quantum Teleportation

1:22:32
9

Quantum Money

1:24:38
10

Basics of Quantum Computing

1:22:30
11

Revealing XOR-patterns I

1:23:44
12

Revealing XOR-patterns II

1:21:09
13

Simon's Algorithm

1:21:33
14

The Fourier Transform over Z_n

1:23:01
15

Period-Finding (Simon's Algorithm over Z_N)

1:22:41
16

Shor's Factoring Algorithm

1:20:16
17

The Hidden Subgroup Problem

1:23:24

Revealing XOR-patterns II

Ryan O'DonnellCarnegie Mellon University

Professor

1:21:09·2018·graduate level

Continuing from the previous lecture, this session deepens the analysis of quantum algorithms for identifying hidden XOR-patterns, building towards more complex oracle problems.

Theory & AlgosAlgorithms & Data StructuresComputational ComplexityQuantum OraclesXOR Functions

Quantum Computation and Quantum Information

Lecture 12: Revealing XOR-patterns II

Carnegie Mellon Course 15-859BB, Fall 2018

Previous · Lecture 11

Revealing XOR-patterns I

Next · Lecture 13

Simon's Algorithm

Comments

Add a comment...Sign in