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 |
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
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 journal › Article
}
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 -