Diagrammatic approach to quantum search

Thomas G. Wong

doi:10.1007/s11128-015-0959-3

Diagrammatic approach to quantum search

Thomas G. Wong

Department of Physics

Research output: Contribution to journal › Article

13 Scopus citations

Abstract

We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory’s effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with N.

Original language	English (US)
Pages (from-to)	1767-1775
Number of pages	9
Journal	Quantum Information Processing
Volume	14
Issue number	6
DOIs	https://doi.org/10.1007/s11128-015-0959-3
State	Published - Jun 30 2015

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Statistical and Nonlinear Physics
Theoretical Computer Science
Signal Processing
Modeling and Simulation
Electrical and Electronic Engineering

Access to Document

10.1007/s11128-015-0959-3

Fingerprint Dive into the research topics of 'Diagrammatic approach to quantum search'. Together they form a unique fingerprint.

Cite this

Wong, T. G. (2015). Diagrammatic approach to quantum search. Quantum Information Processing, 14(6), 1767-1775. https://doi.org/10.1007/s11128-015-0959-3

@article{f2fbf44be6444946987d926a1d1eb0c7,

title = "Diagrammatic approach to quantum search",

abstract = "We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory{\textquoteright}s effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with N.",

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

year = "2015",

month = jun,

day = "30",

doi = "10.1007/s11128-015-0959-3",

language = "English (US)",

volume = "14",

pages = "1767--1775",

journal = "Quantum Information Processing",

issn = "1570-0755",

publisher = "Springer New York",

number = "6",

}

TY - JOUR

T1 - Diagrammatic approach to quantum search

AU - Wong, Thomas G.

PY - 2015/6/30

Y1 - 2015/6/30

N2 - We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory’s effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with N.

AB - We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous time, which involves sketching small weighted graphs with self-loops and considering degenerate perturbation theory’s effects on them. Using this method, we give the first example of degenerate perturbation theory solving search on a graph whose evolution occurs in a subspace whose dimension grows with N.

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

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

U2 - 10.1007/s11128-015-0959-3

DO - 10.1007/s11128-015-0959-3

M3 - Article

AN - SCOPUS:84929956056

VL - 14

SP - 1767

EP - 1775

JO - Quantum Information Processing

JF - Quantum Information Processing

SN - 1570-0755

IS - 6

ER -