Diagrammatic approach to quantum search

Research output: Contribution to journalArticle

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

    Fingerprint

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