Главная
Study mode:
on
1
Intro
2
Outline
3
A graph and a matrix
4
A discrete quantum walk
5
Coins of order two
6
Transferring states
7
Pretty good state transfer
8
A spectral correspondence
9
Reduction of strong cospectrality
10
Example 1
11
A 'characterization
12
Geodetic angles
13
More examples
14
Quantum walk with a marked vertex
15
Quantum walk search
16
An averaging perspective
17
Average search probability
18
Distance regular graphs
19
Discrete bounded by continuous
20
Question
21
One quarter success probability
Description:
Explore the intricacies of discrete quantum walks in this 55-minute lecture by Hanmeng Zhan from York University. Delve into topics such as graph matrices, coins of order two, state transfer mechanisms, and the concept of pretty good state transfer. Examine spectral correspondences, strong cospectrality reduction, and geodetic angles. Investigate quantum walk searches, including marked vertex scenarios and average search probability. Analyze distance regular graphs and compare discrete and continuous quantum walks. Gain insights into the one-quarter success probability theorem and participate in a concluding question session.

Transferring States in Discrete Quantum Walks

Fields Institute
Add to list