| Document Date: 2014-12-25 20:29:06
Open Document File Size: 313,81 KBShare Result on Facebook
Company Oracle / Vertex / / Country Netherlands / / / IndustryTerm depth-first search visits / classical algorithm / graph algorithm / quantum algorithm / depth-first search / query algorithm / bounded-error quantum algorithm / depth-first search algorithm / bomb query algorithm / breadth-first search / explicit algorithm / graph algorithms / quantum local search / quantum algorithms / / Person Lin / Han-Hsuan Lin / Cedric Yen-Yu Lin / Ai / Scott Aaronson / Vinay Mayar / / / Position adjacency list model for singlesource shortest paths / General / / Product Theorem 1 / / PublishedMedium Foundations of Physics / / Region North Holland / / Technology graph algorithms / randomized algorithm / quantum algorithm / quantum algorithms / graph algorithm / search algorithm / n1.75 query algorithm / corresponding bounded-error quantum algorithm / classical algorithm / guessing algorithm / adjacency matrix.√Our guessing algorithm / Micali-Vazirani algorithm / explicit algorithm / bomb query algorithm / /
SocialTag |
Improved Quantum Query Complexity Bounds for Some Graph Problems Prafulla Dhariwal, Vinay Mayar Abstract We prove improved quantum query complexity bounds for some graph problem. Our results are based on a new quantum al