Главная
Study mode:
on
1
Introduction
2
Who am I
3
General setup
4
Hamiltonian setup
5
Previous work
6
Invariant subspace
7
General strategy
8
Matrix representation
9
Normalized Hamiltonian
10
Eigenvectors
11
Technical proposition
12
Perturbation theory
13
Implicit function theorem
14
Search algorithm
15
Success probability
16
Hamiltonian
17
Search time scale
18
Other families
19
Negative examples
Description:
Explore the intricacies of spatial search on Johnson graphs using continuous-time quantum walks in this 54-minute lecture by Hajime Tanaka from Tohoku University. Delivered as part of the Workshop on Algebraic Graph Theory and Quantum Information at the Fields Institute, delve into topics such as Hamiltonian setup, invariant subspaces, matrix representation, and perturbation theory. Gain insights into the search algorithm, success probability, and time scale, while also examining other graph families and negative examples. Enhance your understanding of quantum information and algebraic graph theory through this comprehensive presentation.

Spatial Search on Johnson Graphs by Continuous-Time Quantum Walk

Fields Institute
Add to list
0:00 / 0:00