Document Open Access Logo

Efficient Quantum Walk on the Grid with Multiple Marked Elements

Authors Peter Hoyer, Mojtaba Komeili

PDF

File

Thumbnail PDF
PDF
LIPIcs.STACS.2017.42.pdf
  • Filesize: 484 kB
  • 14 pages

Document Identifiers

Subject Classification

Keywords
  • Quantum walks
  • random walks
  • query complexity
  • spatial search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We give a quantum algorithm for finding a marked element on the grid when there are multiple marked elements. Our algorithm uses quadratically fewer steps than a random walk on the grid, ignoring logarithmic factors. This is the first known quantum walk that finds a marked element in a number of steps less than the square-root of the extended hitting time. We also give a new tighter upper bound on the extended hitting time of a marked subset, expressed in terms of the hitting times of its members.

Cite As Get BibTex

Peter Hoyer and Mojtaba Komeili. Efficient Quantum Walk on the Grid with Multiple Marked Elements. In 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 66, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017) https://doi.org/10.4230/LIPIcs.STACS.2017.42

Author Details

Peter Hoyer
Mojtaba Komeili
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact