Title: Fast quantum search with continuous quantum walk on graphs
| Speaker: | Ruofan Ma |
| Affiliation: | University of Waterloo |
| Room: | MC 6486 |
Abstract:
Grover's
search
algorithm
is
a
quantum
search
algorithm
whose
implementation
is
based
on
elementary
gates.
In
1996,
Farhi
and
Gutmann
introduced
a
continuous
analogue
of
Grover's
algorithm.
The
search
can
be
achieved
by
pre-engineering
the
system
and
letting
it
evolve
for
a
time
proportional
to
$\sqrt{N}E$,
and
this
time
is
optimally
short.
This
model
applies
the
continuous
quantum
walk
on
a
complete
graph.
In
2014,
Janmark
et
al.
showed
that
fast
quantum
search
can
also
be
achieved
if
the
system
is
let
evolve
on
large
strongly
regular
graphs.
We
discuss
Farhi
and
Gutmann's
results
and
other
graph
structures
that
seem
to
allow
fast
quantum
search.
This talk will be delivered again on August 9th, 2016 during the USRA seminar.