Faster quantum walk search on a weighted graph

Thomas G. Wong

doi:10.1103/PhysRevA.92.032320

Faster quantum walk search on a weighted graph

Thomas G. Wong

Research output: Contribution to journal › Article

11 Scopus citations

Abstract

A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ(N3/4). We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ(N). To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

Original language	English (US)
Article number	032320
Journal	Physical Review A - Atomic, Molecular, and Optical Physics
Volume	92
Issue number	3
DOIs	https://doi.org/10.1103/PhysRevA.92.032320
State	Published - Sep 21 2015
Externally published	Yes

All Science Journal Classification (ASJC) codes

Atomic and Molecular Physics, and Optics

Access to Document

10.1103/PhysRevA.92.032320

Fingerprint Dive into the research topics of 'Faster quantum walk search on a weighted graph'. Together they form a unique fingerprint.

Cite this

Wong, T. G. (2015). Faster quantum walk search on a weighted graph. Physical Review A - Atomic, Molecular, and Optical Physics, 92(3), [032320]. https://doi.org/10.1103/PhysRevA.92.032320

@article{e35cb6c47ecc43619b06d475ff79a96d,

title = "Faster quantum walk search on a weighted graph",

abstract = "A randomly walking quantum particle evolving by Schr{\"o}dinger's equation searches for a unique marked vertex on the {"}simplex of complete graphs{"} in time Θ(N3/4). We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ(N). To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.",

author = "Wong, {Thomas G.}",

year = "2015",

month = sep,

day = "21",

doi = "10.1103/PhysRevA.92.032320",

language = "English (US)",

volume = "92",

journal = "Physical Review A - Atomic, Molecular, and Optical Physics",

issn = "1050-2947",

publisher = "American Physical Society",

number = "3",

}

TY - JOUR

T1 - Faster quantum walk search on a weighted graph

AU - Wong, Thomas G.

PY - 2015/9/21

Y1 - 2015/9/21

N2 - A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ(N3/4). We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ(N). To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

AB - A randomly walking quantum particle evolving by Schrödinger's equation searches for a unique marked vertex on the "simplex of complete graphs" in time Θ(N3/4). We give a weighted version of this graph that preserves vertex transitivity, and we show that the time to search on it can be reduced to nearly Θ(N). To prove this, we introduce two extensions to degenerate perturbation theory: an adjustment that distinguishes the weights of the edges and a method to determine how precisely the jumping rate of the quantum walk must be chosen.

UR - http://www.scopus.com/inward/record.url?scp=84943167511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84943167511&partnerID=8YFLogxK

U2 - 10.1103/PhysRevA.92.032320

DO - 10.1103/PhysRevA.92.032320

M3 - Article

AN - SCOPUS:84943167511

VL - 92

JO - Physical Review A - Atomic, Molecular, and Optical Physics

JF - Physical Review A - Atomic, Molecular, and Optical Physics

SN - 1050-2947

IS - 3

M1 - 032320

ER -