Continuous Time Quantum Walk on finite dimensions. Shanshan Li Joint work with Stefan Boettcher Emory University QMath13, 10/11/2016

Transcription

1 Continuous Time Quantum Walk on finite dimensions Shanshan Li Joint work with Stefan Boettcher Emory University QMath3, 0//206

2 Grover Algorithm: Unstructured Search! #$%&' Oracle $()*%$ f(x) f (x) = ( x = w 0 otherwise Initialize the system to the state si = p NX N x=0 xi Apply Grover Iteration (U s U w )p N si U s =2 sihs U w = I I 2 wihw = 2 arcsin p N

3 Quantum Walk Basics for Spatial Search Random Walk d dt p x = NX y=0 L xy p y Continuous time quantum walk Unstructured search: f(x) is a computable function Spatial Search: N items stored in a d-dimensional physical space d x (t) dt = X y H xy y (t) H = L!ih! initial state si = N marked state wi X xi x Laplacian = Degree Matrix - Adjacency Matrix L = D A

4 Critical Point in the Hamiltonian =0 H = wihw 0 th, st = wi, si = H = L 0 th, st = si, wi = c 0 th, st =( wi ± si) / p 2 T = 2 p N A. Childs et al. Spatial Search by Quantum Walk (2004)

5 CTQW: optimal performance Quadratic Speedup O p N Grover efficiency complete graph, hypercube, strongly regular graph (E. Farhi and S. Gutmann 998, A. M. Childs et al 2002, J. Janmark et al, 204) Erdös Renyi graph p ( SS. Chakraborty et al, 206) log 3 2 N/N lattices d>4 (A. M. Childs et al 2004) We extend CTQW to fractal graphs with real fractal dimension Spectral dimension of graph Laplacian determines the computational complexity

6 Finite Dimensional Fractals we generalize to arbitrary real (fractal) dimension Hierarchical networks Sierpinski Gasket, Migdal-Kadanoff network with regular degree 3 Diamond fractals based on the Migdal-Kadanoff renormalization group scheme

7 Dimensions in fractal networks Fractal dimensions N l d f i N = i Spectral dimension i N 2/d s i 2 0 N = 6 N = 32 N = 64 N = 28 N = 256 N = 52 N = 024 N = 2048 N = 4096 N = 892 N = i/n Hierarchical Network with regular degree 3

8 Migdal-Kadanoff renormalization group(mkrg) Model regular lattices closely arbitrary real dimension b Bond-moving scheme on square lattices with rescaling length l=2, branching factor b=2

9 Procedure to build the Diamond Fractals k=0 k= k=2

10 Measure Critical Point The spectral Zeta function When the CTQW is optimal for search, the critical point takes place (numerically true for almost all sites in fractals we consider) The transition probability A. Childs et al. Spatial Search by Quantum Walk (2004)

11 Assumption on fractal Laplacian eigenvector MK renormalization group with b=2 0 Highest Level N <w i > nd -Highest Level 3 rd -Highest Level i th eigenvector

12 Renormalization Group Argument det h L (k) q (k) i i,p (k) i, det h L (k+) q (k+) i i,p (k+) i, The spectral Zeta function I j (N 2j ds const apple det (L + )!0 d s < 2j d s > 2j

13 Computational Complexity of CTQW spectral dimension of network Laplacian determines the computational complexity complement the discussions on regular lattices and mean-field networks References: Shanshan Li and Stefan Boettcher, arxiv preprint arxiv: , 206 Stefan Boettcher and Shanshan Li, arxiv preprint arxiv: , 206

14 Thank you!

15 RG calculation for spectral determinant b Stefan Boettcher and Shanshan Li, arxiv preprint arxiv: , 206