filmov
tv
Quantum algorithm for deciding st-connectivity - Ben Reichardt
Показать описание
IQC Faculty member Ben Reichardt lectures on quantum algorithms for deciding st-connectivity during the "Recent Progress in Quantum Algorithms" conference.
The event was hosted by The Institute for Quantum Computing, and The Perimeter Institute and was held in Waterloo, Ontario, April 11-13th, 2012.
Abstract: We give an O(log n) space, query-optimal quantum algorithm for deciding whether two vertices in a graph are connected, given query access to the adjacency matrix. This is an exponential improvement in the space complexity over previous results, and the time and query complexity are also improved under promises that arise in several applications. Although designed using span programs, the algorithm can also naturally be expressed in terms of a reflection about the set of balanced st-flows in the complete graph, an efficiently implementable operation.
Based on joint work with Aleksandrs Belovs.
The event was hosted by The Institute for Quantum Computing, and The Perimeter Institute and was held in Waterloo, Ontario, April 11-13th, 2012.
Abstract: We give an O(log n) space, query-optimal quantum algorithm for deciding whether two vertices in a graph are connected, given query access to the adjacency matrix. This is an exponential improvement in the space complexity over previous results, and the time and query complexity are also improved under promises that arise in several applications. Although designed using span programs, the algorithm can also naturally be expressed in terms of a reflection about the set of balanced st-flows in the complete graph, an efficiently implementable operation.
Based on joint work with Aleksandrs Belovs.
0:53:53
0:24:15
1:15:01
1:33:57
0:28:36
0:49:23
0:04:59
0:48:23
2:17:02
0:15:12
0:52:45
0:41:23
1:07:04
0:15:30
0:30:53
1:05:31
0:06:44
0:30:42
1:13:40
0:55:55
2:04:54
0:59:06
0:38:51
1:24:42