Diagrammatic approach to quantum search
From MaRDI portal
Publication:2355585
DOI10.1007/S11128-015-0959-3zbMATH Open1317.81071arXiv1410.7201OpenAlexW2071677952MaRDI QIDQ2355585
Author name not available (Why is that?)
Publication date: 24 July 2015
Published in: (Search for Journal in Brave)
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 .
Full work available at URL: https://arxiv.org/abs/1410.7201
No records found.
No records found.
This page was built for publication: Diagrammatic approach to quantum search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355585)
