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 | |
| State | Published - Jun 30 2015 |
| Externally published | Yes |
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
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