Diagrammatic approach to quantum search

Research output: Contribution to journalArticle

10 Citations (Scopus)

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 languageEnglish (US)
Pages (from-to)1767-1775
Number of pages9
JournalQuantum Information Processing
Volume14
Issue number6
DOIs
StatePublished - Jun 30 2015
Externally publishedYes

Fingerprint

walking
estimating
perturbation theory
perturbation
Sketching
Weighted Graph
Graph in graph theory
Perturbation Theory
Continuous Time
Subspace
Perturbation

All Science Journal Classification (ASJC) codes

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

Cite this

Diagrammatic approach to quantum search. / Wong, Thomas.

In: Quantum Information Processing, Vol. 14, No. 6, 30.06.2015, p. 1767-1775.

Research output: Contribution to journalArticle

@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’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 = "Thomas Wong",
year = "2015",
month = "6",
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

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

VL - 14

SP - 1767

EP - 1775

JO - Quantum Information Processing

JF - Quantum Information Processing

SN - 1570-0755

IS - 6

ER -