On the hitting times of quantum versus random walks
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Saved in:
Main Authors: | Magniez, F., Nayak, A., Richter, P.C., Santha, M. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/115464 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the hitting times of quantum versus random walks
by: Magniez, F., et al.
Published: (2014) -
Improved bounds for the randomized decision tree complexity of recursive majority
by: Magniez, F., et al.
Published: (2014) -
Quantum walk based search algorithms
by: Santha, M.
Published: (2014) -
Improved quantum query algorithms for triangle finding and associativity testing
by: Lee, T., et al.
Published: (2014) -
White noise in quantum random walk search algorithm
by: Ma, L., et al.
Published: (2014)