Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Exceptional quantum walk search on the cycle

Exceptional quantum walk search on the cycle Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk’s hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk’s random sampling yields an arbitrary speedup in query complexity over the classical random walk’s hitting time. In this context, however, the mixing time to prepare the initial uniform state is a more suitable comparison than the hitting time, and then, the speedup is roughly quadratic. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

Exceptional quantum walk search on the cycle

Download PDF
17 pages

Loading next page...
1
 
/lp/springer_journal/exceptional-quantum-walk-search-on-the-cycle-ZkCgZcyuVr

References (30)

Publisher
Springer Journals
Copyright
Copyright © 2017 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-017-1606-y
Publisher site
See Article on Publisher Site

Abstract

Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk’s hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk’s random sampling yields an arbitrary speedup in query complexity over the classical random walk’s hitting time. In this context, however, the mixing time to prepare the initial uniform state is a more suitable comparison than the hitting time, and then, the speedup is roughly quadratic.

Journal

Quantum Information Processing – Springer Journals

Published: May 4, 2017

There are no references for this article.