Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Monday, August 2, 2021 — 11:30 to 11:30 AM EDT
Title: The average search probability in a quantum walk with an oracle
Speaker: Harmony Zhan Affiliation: York University Zoom: Contact Soffia ArnadottirAbstract:
Some quantum search algorithms can be viewed as discrete-time quantum walks on graphs with a marked vertex a. In such a walk, the oracle is part of the transition matrix, the target state is the characteristic vector of the outgoing arcs of a, and the initial state is the all-ones vector.