1
organizing role
2004–2006
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
1 Talk
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Quantum query complexity of some graph problems | QIP 2004 | regular | — |
Quantum algorithms for graph problems are considered, both in the adjacency matrix query model and in an adjacency list-like array model. We give almost tight lower and upper bounds for Connectivity, Strong Connectivity, Minimum Spanning Tree and Single Source Shortest Paths. (This is joint work with Mark Heiligman, Peter Hoyer, Mehdi Mhalla, and Yahui Lei.) |
|||
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2006 | organizing | member | — |