Year: 2018
Type: article
Abstract: We analyze the potential for different types of searches using the formalism of scattering random walks on quantum computers. Given a particular type of graph consisting of nodes and connections, a ``tree maze,'' we would like to find a selected final node as quickly as possible, faster than any classical search algorithm. We show that this can be done using a quantum random walk, both through numerical calculations as well as by using the eigenvectors and eigenvalues of the quantum system.
Source: Physical Review A
Authors: Daniel Koch, Mark Hillery
Institutions: The Graduate Center, CUNY, City University of New York
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: John Templeton Foundation
OpenAlex ID: W2765369772