Transport Properties of Quantum Walks, Deterministic and Random
|
|
- Kerrie Scott
- 5 years ago
- Views:
Transcription
1 Transport Properties of Quantum Walks, Deterministic and Random Alain JOYE i f INSTITUT FOURIER AQOS, Autrans, 8-19/7/2013 p.1/29
2 Unitary Quantum Walks Interdisciplinary Concept Quantum from Quantum Physics Walk from Probability Theory Well studied in Computer Science Maths QW Computer Science Physics AQOS, Autrans, 8-19/7/2013 p.2/29
3 Unitary Quantum Walks Interdisciplinary Concept Quantum from Quantum Physics Walk from Probability Theory Well studied in Computer Science Maths QW Computer Science Interest for Physics Computer Scientists: elaboration of softwares for Quantum Computers Aharonov et al 93, Grover 96, Childs et al Physicists: effective dynamics of complex Quantum Systems Feynman 82, Chalker-Coddington 88, Meyer Mathematicians: non-commutative extensions of Random Walks Nayak et al 00, Ambainis et al 01, Konno 02,... AQOS, Autrans, 8-19/7/2013 p.2/29
4 Search Algorithm Search in unstructured list Q: Does S N = {x 1,x 2,,x N } contain the elmt. x? If so, find it. Algorithmic Answer: { If x1 =x stop pick x 1 If x 1 x pick x 2 iterate Algorithm typically requires O(N) steps to determine if x S N and find it. AQOS, Autrans, 8-19/7/2013 p.3/29
5 Search Algorithm Search in unstructured list Q: Does S N = {x 1,x 2,,x N } contain the elmt. x? If so, find it. Algorithmic Answer: { If x1 =x stop pick x 1 If x 1 x pick x 2 iterate Algorithm typically requires O(N) steps to determine if x S N and find it. Assume random state a) x S N (with proba p ). N steps required. b) x S N (with proba 1 p ). Stop after k N steps. prob (x found at step k )= 1/N T = N k=1 k N = N+1 2. AQOS, Autrans, 8-19/7/2013 p.3/29
6 Search Algorithm Search in unstructured list Q: Does S N = {x 1,x 2,,x N } contain the elmt. x? If so, find it. Algorithmic Answer: { If x1 =x stop pick x 1 If x 1 x pick x 2 iterate Algorithm typically requires O(N) steps to determine if x S N and find it. Assume random state a) x S N (with proba p ). N steps required. b) x S N (with proba 1 p ). Stop after k N steps. prob (x found at step k )= 1/N T = N k=1 Assuming random choice of states k N = N+1 2. i.e. a random walk on S N same conclusions. AQOS, Autrans, 8-19/7/2013 p.3/29
7 Grover s Algorithm Grover 96 Quantum Version: S N C N Q: How to find the (normalized) state x C N? Assume x C N charact. by an oracle U x U(N) s.t. U x x = x and U x ϕ = +ϕ, for all ϕ span{x} Algorithmic Answer: Let s = 1 N N j=1 j and U s U(N) s.t. U s s = s and U s ϕ = ϕ, for all ϕ span{s} AQOS, Autrans, 8-19/7/2013 p.4/29
8 Grover s Algorithm Grover 96 Quantum Version: S N C N Q: How to find the (normalized) state x C N? Assume x C N charact. by an oracle U x U(N) s.t. U x x = x and U x ϕ = +ϕ, for all ϕ span{x} Algorithmic Answer: Let s = 1 N N j=1 j and U s U(N) s.t. U s s = s and U s ϕ = ϕ, for all ϕ span{s} Sequence of States s s 1 = (U s U x ) 1 s s 2 = (U s U x ) 2 s s r = (U s U x ) r s Fact: For r(n) π N/4, x s r(n) 2 1 O(1/N) (if x s 0 ) Quantum is Faster It takes O( N) steps to find the state x with large prob. by a Quantum Walk in state space AQOS, Autrans, 8-19/7/2013 p.4/29
9 Quantum Walk on Z First Try Hilbert space l 2 (Z) with ONB { j } j Z Unitary op. U on l 2 (Z) Jumps from j to j +1, j 1 only, for all j Z AQOS, Autrans, 8-19/7/2013 p.5/29
10 Quantum Walk on Z First Try Hilbert space l 2 (Z) with ONB { j } j Z Unitary op. U on l 2 (Z) Jumps from j to j +1, j 1 only, for all j Z U j = α j 1 +β j +1, α,β C s.t. α 2 + β 2 = 1 α β l j-1> l j > l j+1 > Z Orthogonality: 0 = j j +2 = Uj U(j +2) = βα Only possibilities: Left (β = 0 ) or Right (α = 0 ) Shifts AQOS, Autrans, 8-19/7/2013 p.5/29
11 Quantum Walk on Z Second Try Add Internal degree of freedom: C 2 a.k.a Spin l j-1> l j > l j+1 > Z Hilbert space l 2 (Z;C 2 ) l 2 (Z) C 2 Ψ = j Z j ψ(j), where ( ) a(j) ψ(j) = = a(j) +1 +b(j) 1 C 2, b(j) s.t. j Z ψ(j) 2 = j Z a(j) 2 + b(j) 2 <. ONB { j τ } τ {+1, 1} j Z QM interpretation: = { j +1, j 1 } j Z prob. (Ψ on "site" j) = ψ(j) 2 (Ψ normalized) AQOS, Autrans, 8-19/7/2013 p.6/29
12 Coined Quantum Walk I l j-1> l j > l j+1 > Z Construction of Unitary op. U on l 2 (Z) C 2 : Jumps from j τ to (j +1) τ, (j 1) τ only, for all j Z,τ,τ,τ {+1, 1} First Step: Let C U(2) to act locally on Spin deg. of freed. (I C) j ϕ = j (Cϕ), ϕ C 2 AQOS, Autrans, 8-19/7/2013 p.7/29
13 Coined Quantum Walk I l j-1> l j > l j+1 > Z Construction of Unitary op. U on l 2 (Z) C 2 : Jumps from j τ to (j +1) τ, (j 1) τ only, for all j Z,τ,τ,τ {+1, 1} First Step: Let C U(2) to act locally on Spin deg. of freed. (I C) j ϕ = j (Cϕ), ϕ C 2 Second Step: Spin-dependent shift op. S B(l 2 (Z) C 2 ) S j +1 = (j +1) +1, S j 1 = (j 1) 1 > I+1> I+1 I+1> I-1 > I-1> I-1> l j-1> l j > l j+1 > i.e. S S + S Z AQOS, Autrans, 8-19/7/2013 p.7/29
14 Coined Quantum Walk II l j-1> l j > l j+1 > Z Definition: U(C) = S(I C) on l 2 (Z) C 2 Remarks: The Coin Matrix C U(2) is a parameter of the QW. ( ) r t Take C =, s.t. 0 r,t and r 2 +t 2 = 1. t r U(C) j +1 = r (j +1) +1 t (j 1) 1 U(C) j 1 = t (j +1) +1 +r (j 1) 1 AQOS, Autrans, 8-19/7/2013 p.8/29
15 Coined Quantum Walk II l j-1> l j > l j+1 > Z Definition: U(C) = S(I C) on l 2 (Z) C 2 Remarks: The Coin Matrix C U(2) is a parameter of the QW. ( ) r t Take C =, s.t. 0 r,t and r 2 +t 2 = 1. t r U(C) j +1 = r (j +1) +1 t (j 1) 1 U(C) j 1 = t (j +1) +1 +r (j 1) 1 QW RW: Starting from j +1 Prob (j j +1) = r2 Prob (j j 1) = t 2 Prob (j j +1) = t2 Starting from j 1 Prob (j j 1) = r 2 ( ) 1 1 "Symmetric Walk": r = t, i.e. Hadamard Matrix C = AQOS, Autrans, 8-19/7/2013 p.8/29
16 QW Dynamics "on Z " U(C) = S(I C) Discrete Time Dynamics Given U(C) and Ψ 0 QW in l 2 (Z) C 2 Ψ 0 Ψ 1 = U(C) 1 Ψ 0 Ψ 2 = U(C) 2 Ψ 0 Ψ n = U(C) n Ψ 0 AQOS, Autrans, 8-19/7/2013 p.9/29
17 QW Dynamics "on Z " U(C) = S(I C) Discrete Time Dynamics Given U(C) and Ψ 0 QW in l 2 (Z) C 2 Ψ 0 Ψ 1 = U(C) 1 Ψ 0 Ψ 2 = U(C) 2 Ψ 0 Ψ n = U(C) n Ψ 0 RW vs QW Random Walker Coin Quantum Walker Coin Matrix C U(2) AQOS, Autrans, 8-19/7/2013 p.9/29
18 QW Dynamics "on Z " U(C) = S(I C) Discrete Time Dynamics Given U(C) and Ψ 0 QW in l 2 (Z) C 2 Ψ 0 Ψ 1 = U(C) 1 Ψ 0 Ψ 2 = U(C) 2 Ψ 0 Ψ n = U(C) n Ψ 0 RW vs QW Random Walker Coin Quantum Walker Coin Matrix C U(2) Position Distribution at time n State at time n : Ψ n = U(C) n Ψ 0 Prob(QW on site j at time n ) = ψ n (j) 2 AQOS, Autrans, 8-19/7/2013 p.9/29
19 Hadamard Walk: C = 1 2 ( ) Ψ 0 = ( ) 1 i Distribution of Ψ n (j) 2 n 75 AQOS, Autrans, 8-19/7/2013 p.10/29
20 Hadamard Walk: C = 1 2 ( Distribution of Ψ n (j) 2 n ) Ψ 0 = 0 ( ) a, a b b AQOS, Autrans, 8-19/7/2013 p.11/29
21 QM Characteristics of { ψ n ( ) 2 }, with Ψ 0 = 0 ϕ Expectation: X n Ψ0 = j Z j ψ n(j) 2 Variance: Var(X n ) Ψ0 = j Z (j X n Ψ0 ) 2 ψ n (j) 2, as n AQOS, Autrans, 8-19/7/2013 p.12/29
22 QM Characteristics of { ψ n ( ) 2 }, with Ψ 0 = 0 ϕ Expectation: X n Ψ0 = j Z j ψ n(j) 2 Variance: Var(X n ) Ψ0 = j Z (j X n Ψ0 ) 2 ψ n (j) 2, as n Special Cases C Diagonal Spin +1 / 1 components shifted to the Left/Right X n Ψ0 = O(n) Var(X n ) Ψ0 = O(n 2 ) > I+1> I+1 I+1> I-1 > I-1> I-1> l j-1> l j > l j+1 > C Off-Diagonal Quantum Walker stuck on sites { 1, 0, 1} Z X n Ψ0 = O(1) Var(X n ) Ψ0 = O(1) l j-1> l j > l j+1 > Z AQOS, Autrans, 8-19/7/2013 p.12/29
23 QM Characteristics of { ψ n ( ) 2 }, with Ψ 0 = 0 ϕ Generic C X n Ψ0 = O(n) and Var(X n ) Ψ0 = O(n 2 ), i.e. Ballistic Behaviour Limiting distribution of X n /n as n. Konno 02 AQOS, Autrans, 8-19/7/2013 p.13/29
24 QM Characteristics of { ψ n ( ) 2 }, with Ψ 0 = 0 ϕ Generic C X n Ψ0 = O(n) and Var(X n ) Ψ0 = O(n 2 ), i.e. Ballistic Behaviour Limiting distribution of X n /n as n. Konno 02 Spectral Method Transl. invar. on Z Fourier transform l 2 (Z 2 ) C 2 L 2 (T k ;C 2 ) ˆψ(k) = j ψ(j)eijk ( ) e ik 0 U(C) = S(I C) C C(k) as a U(2) -valued mult. op. 0 e ik C(k) = e iω(k) v + (k) v + (k) +e iω(k) v (k) v (k) ω(k) = arccos(rcos(k)) σ(u(c)) = σ a.c. (U(C)) ballistic behavior AQOS, Autrans, 8-19/7/2013 p.13/29
25 QM Characteristics of { ψ n ( ) 2 }, with Ψ 0 = 0 ϕ Generic C X n Ψ0 = O(n) and Var(X n ) Ψ0 = O(n 2 ), i.e. Ballistic Behaviour Limiting distribution of X n /n as n. Konno 02 Spectral Method Transl. invar. on Z Fourier transform l 2 (Z 2 ) C 2 L 2 (T k ;C 2 ) ˆψ(k) = j ψ(j)eijk ( ) e ik 0 U(C) = S(I C) C C(k) as a U(2) -valued mult. op. 0 e ik C(k) = e iω(k) v + (k) v + (k) +e iω(k) v (k) v (k) ω(k) = arccos(rcos(k)) σ(u(c)) = σ a.c. (U(C)) ballistic behavior (C n ( )ˆψ)(k) = f (k)e inω(k) v (k) +f + (k) e +inω(k) v + (k), n Z Var(X n ) Ψ0 = j j2 ψ n (j) 2 = n 2 T k ( k ω(k)) 2 ˆψ(k) 2 +O(n) Group velocity: k ω(k) AQOS, Autrans, 8-19/7/2013 p.13/29
26 Random Quantum Walk: Static Disorder Site-dep. Coin Matrices C {C(j)} j Z U j ±1 = C +,± (j) (j +1) +1 +C,± (j) (j 1) 1 Spatial inhomogeneity Coin C ω (j) at each site j is random AQOS, Autrans, 8-19/7/2013 p.14/29
27 Random Quantum Walk: Static Disorder Site-dep. Coin Matrices C {C(j)} j Z U j ±1 = C +,± (j) (j +1) +1 +C,± (j) (j 1) 1 Spatial inhomogeneity Coin C ω (j) at each site j is random Physics Quantum Hall Dynamics Q. Network Model Chalker-Coddington 88 Exp. propagation of polarized photons in networks of coupled wave guides with static random phase shifts Crespi et al 13 AQOS, Autrans, 8-19/7/2013 p.14/29
28 Random Quantum Walk: Static Disorder Site-dep. Coin Matrices C {C(j)} j Z U j ±1 = C +,± (j) (j +1) +1 +C,± (j) (j 1) 1 Spatial inhomogeneity Coin C ω (j) at each site j is random Assumptions: J.-Merkli 09 {C ω (k)} k Z is an i.i.d. U(2) valued random variable The quantum transition amplitudes to the right and left are independent The quantum transition probabilities to the right and left are deterministic. AQOS, Autrans, 8-19/7/2013 p.15/29
29 Random Quantum Walk: Static Disorder Site-dep. Coin Matrices C {C(j)} j Z U j ±1 = C +,± (j) (j +1) +1 +C,± (j) (j 1) 1 Spatial inhomogeneity Coin C ω (j) at each site j is random Assumptions: J.-Merkli 09 {C ω (k)} k Z is an i.i.d. U(2) valued random variable The quantum transition amplitudes to the right and left are independent The quantum transition probabilities to the right and left are deterministic. Consequence Lemma: Up to trivial transformations, r,t [0,1] s.t. r 2 +t 2 = 1 and i.i.d random phases {ω ± k } k Z C ω (k) := ( re iω + k te iω+ k te iω k re iω k ), k Z. AQOS, Autrans, 8-19/7/2013 p.15/29
30 Random Quantum Walk: Static Disorder Structure Property: U(C) U ω (C) Let { k τ } τ {±} k Z be ONB of l 2 (Z) C 2 Set D(ω) = diag(exp(iω τ k)), then random time one dynamics U ω (C) = D(ω)U(C) AQOS, Autrans, 8-19/7/2013 p.16/29
31 Random Quantum Walk: Static Disorder Structure Property: U(C) U ω (C) Let { k τ } τ {±} k Z be ONB of l 2 (Z) C 2 Set D(ω) = diag(exp(iω τ k)), then random time one dynamics U ω (C) = D(ω)U(C) Thm "Anderson Localization" J.-Merkli 09, Ahlbrecht et al 11 If ω ± k have an L density, For any r [0,1), any p N, any Ψ 0 of cpct. supp. : sup Xn ω p ψ0 < C ω, a.s. n Z AQOS, Autrans, 8-19/7/2013 p.16/29
32 Random Quantum Walk: Static Disorder Structure Property: U(C) U ω (C) Let { k τ } τ {±} k Z be ONB of l 2 (Z) C 2 Set D(ω) = diag(exp(iω τ k)), then random time one dynamics U ω (C) = D(ω)U(C) Thm "Anderson Localization" J.-Merkli 09, Ahlbrecht et al 11 If ω ± k have an L density, For any r [0,1), any p N, any Ψ 0 of cpct. supp. : sup Xn ω p ψ0 < C ω, a.s. n Z First RQW: 09 Konno: ( re iω k t ) C ω (k) = t re iω k ballistic behaviour! AQOS, Autrans, 8-19/7/2013 p.16/29
33 Random Quantum Walk: Static Disorder Generalization: RQW on Z d H = l 2 (Z d ) C 2d J. 12 ONB: { τ } τ I±, I ± {±1,±2,...,±d} for C 2d Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Z/ - -2 S = τ I ± k Z d k +r(τ) k P τ r(+1) r(-1) r(-2) AQOS, Autrans, 8-19/7/2013 p.17/29
34 Random Quantum Walk: Static Disorder Generalization: RQW on Z d H = l 2 (Z d ) C 2d J. 12 ONB: { τ } τ I±, I ± {±1,±2,...,±d} for C 2d Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Z/ - -2 S = τ I ± k Z d k +r(τ) k P τ C U(2d), U(C) = S(I C), U ω (C) = D(ω)U(C) on l 2 (Z d ) C 2d r(-1) r(-2) r(+1) AQOS, Autrans, 8-19/7/2013 p.17/29
35 Random Quantum Walk: Static Disorder Generalization: RQW on Z d H = l 2 (Z d ) C 2d J. 12 ONB: { τ } τ I±, I ± {±1,±2,...,±d} for C 2d Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Z/ - -2 S = τ I ± k Z k +r(τ) k P d τ C U(2d), U(C) = S(I C), U ω (C) = D(ω)U(C) on l 2 (Z d ) C 2d "Large Disorder Regime" Anderson Localization If C close to certain Permutation matrices r(-1) r(-2) r(+1) + similar hyp. sup Xn ω p ψ0 < C ω, a.s. n Z Rem: Permut. matrices Off-Diag C when d = 1 Stuck Quantum Walker AQOS, Autrans, 8-19/7/2013 p.17/29
36 Random Quantum Walk: Temporal Disorder Temporal disorder New coin C ω at each time step: Kosk et al 06 U ω (n,0) = S(I C ω (n)) S(I C ω (2))S(I C ω (1)) Random Coin op s {C ω (k)} k N, i.i.d. with common distribution µ on U(2d) r(-1) Deterministic Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Z/ - -2 _ r r(+1) r(-2) AQOS, Autrans, 8-19/7/2013 p.18/29
37 Random Quantum Walk: Temporal Disorder Temporal disorder New coin C ω at each time step: Kosk et al 06 U ω (n,0) = S(I C ω (n)) S(I C ω (2))S(I C ω (1)) Random Coin op s {C ω (k)} k N, i.i.d. with common distribution µ on U(2d) r(-1) Deterministic Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Averaging over randomness of QM expectations: X n Ψ0 = E ω ( Xn ω Ψ0 ) w n ( ) = E ω ( ψn( ) ω 2 ) Z/ - -2 _ r r(+1) r(-2) AQOS, Autrans, 8-19/7/2013 p.18/29
38 Random Quantum Walk: Temporal Disorder Temporal disorder New coin C ω at each time step: Kosk et al 06 U ω (n,0) = S(I C ω (n)) S(I C ω (2))S(I C ω (1)) Random Coin op s {C ω (k)} k N, i.i.d. with common distribution µ on U(2d) r(-1) Deterministic Jump Function r : I ± Z d s.t. τ r(τ) r(+2) Averaging over randomness of QM expectations: X n Ψ0 = E ω ( Xn ω Ψ0 ) w n ( ) = E ω ( ψn( ) ω 2 ) Z/ - -2 _ r r(+1) r(-2) Thm "Diffusive Behaviour" Ahlbrecht et al 11, J. 11, Hamza-J. 12 lim n X n Ψ0 n = µ Drift lim n (X n nµ) 2 Ψ0 n = D Diffusion Const. AQOS, Autrans, 8-19/7/2013 p.18/29
39 Summary Coined Random Quantum Walks on Z d C uniform ballistic behaviour C ω random in space a.s. localization C ω random in time average diffusive behaviour Generic situation AQOS, Autrans, 8-19/7/2013 p.19/29
40 Summary Coined Random Quantum Walks on Z d C uniform ballistic behaviour C ω random in space a.s. localization C ω random in time average diffusive behaviour Generic situation Remarks C ω random in time and space average diffusive behaviour Hamza-J. 12, Ahlbrecht et al 13 (R)QW on Z and CMV matrices: special cases of discrete dyn. systems generated by 5-diag. unitary operators on l 2 (Z) Bourget-Howland-J. 03 Warning a notion of localization for QW point spectrum in U(C). AQOS, Autrans, 8-19/7/2013 p.19/29
41 More on Random Quantum Walk II Random evol. U ω (n,0) = S(I C ω (n)) S(I C ω (2)) S(I C ω (1)) AQOS, Autrans, 8-19/7/2013 p.20/29
42 More on Random Quantum Walk II Random evol. U ω (n,0) = S(I C ω (n)) S(I C ω (2)) S(I C ω (1)) = where J ω k (n) = τn,,τ 1 τ j I ± x Z d x Z d k ρn τn,,τ 1 nj=1 r(τ j )=k n x+ j=1 x+k x J ω k (n), r(τ j ) x Pτn C ω (n) P τ1 C ω (1) ρ = max τ I ± r(τ) P τn C ω (n) P τ1 C ω (1) M 2d (C) AQOS, Autrans, 8-19/7/2013 p.20/29
43 More on Random Quantum Walk II Random evol. U ω (n,0) = S(I C ω (n)) S(I C ω (2)) S(I C ω (1)) = where J ω k (n) = τn,,τ 1 τ j I ± x Z d x Z d k ρn τn,,τ 1 nj=1 r(τ j )=k n x+ j=1 x+k x J ω k (n), r(τ j ) x Pτn C ω (n) P τ1 C ω (1) ρ = max τ I ± r(τ) P τn C ω (n) P τ1 C ω (1) }{{} M 2d(C) τ n τ n C ω (n) τ n 1 τ 1 τ 1 C ω (1) Note Ψ ω n = U ω (n,0)( 0 ϕ 0 ) = k Jk ω (n)ϕ 0 k ψn(k) ω k ρn k ρn AQOS, Autrans, 8-19/7/2013 p.21/29
44 QM Probability distribution Lattice observables If f : Z d C, let F := I f on D(F) H s.t. F(ϕ 0 k ) = f(k)(ϕ 0 k ), ϕ 0 C 2d. AQOS, Autrans, 8-19/7/2013 p.22/29
45 QM Probability distribution Lattice observables If f : Z d C, let F := I f on D(F) H s.t. F(ϕ 0 k ) = f(k)(ϕ 0 k ), ϕ 0 C 2d. QM Expectation Value Let F, Ψ 0 = ϕ 0 0, Ψ ω n = U ω (n,0)ψ 0 F ω Ψ 0 (n) = k Z d f(k) ψ ω n(k) 2, with ψn(k) ω 2 = Jk ω (n)ϕ 0 2 C 2d s.t. k Z ψn(k) ω 2 = Ψ d 0 2 H = 1. AQOS, Autrans, 8-19/7/2013 p.22/29
46 QM Probability distribution Lattice observables If f : Z d C, let F := I f on D(F) H s.t. F(ϕ 0 k ) = f(k)(ϕ 0 k ), ϕ 0 C 2d. QM Expectation Value Let F, Ψ 0 = ϕ 0 0, Ψ ω n = U ω (n,0)ψ 0 F ω Ψ 0 (n) = k Z d f(k) ψ ω n(k) 2, with ψn(k) ω 2 = Jk ω (n)ϕ 0 2 C 2d s.t. k Z ψn(k) ω 2 = Ψ d 0 2 H = 1. Random Distribution Let X ω n be a RV on Z d s.t. Prob(X ω n = k) = W ω k (n) = J ω k (n)ϕ 0 2 C 2d, F ω Ψ 0 (n) = E W ω k (n)(f(x ω n)). AQOS, Autrans, 8-19/7/2013 p.22/29
47 Averaged QM Probability distribution Lattice observables If f : Z d C, let F := I f on D(F) H s.t. F(ϕ 0 k ) = f(k)(ϕ 0 k ), ϕ 0 C 2d. Averaged QM Expectation Value Let F, Ψ 0 = ϕ 0 0, Ψ ω n = U ω (n,0)ψ 0 F Ψ0 (n) = E ω F ω Ψ 0 (n) = k Z d f(k)e ω ψ ω n(k) 2, with E ω ψn(k) ω 2 = E ω Jk ω (n)ϕ 0 2 C 2d s.t. k Z E d ω ψn(k) ω 2 = Ψ 0 2 H = 1. Determin. Distribution Let X n be a RV on Z d s.t. Prob(X n = k) = w k (n) = E ω J ω k (n)ϕ 0 2 C 2d, F Ψ0 (n) = E wk (n)(f(x n )). Goal Understand {w k (n)} k Z d as n AQOS, Autrans, 8-19/7/2013 p.23/29
48 Ballistic vs. Diffusive Scaling Expected r -dependent Drift: Diffusive behaviour: X n vn (X n vn) n AQOS, Autrans, 8-19/7/2013 p.24/29
49 Ballistic vs. Diffusive Scaling Expected r -dependent Drift: Diffusive behaviour: X n vn (X n vn) n Tool Given X n {w k (n)} k Z d, and y T d let Φ n (y) = E w(n) (e iyx n ) = k Z d w k (n)e iyk s.t. i yj Φ n (y/n α ) y=0 = k Z d w k (n)k j /n α = E w(n) ((X n ) j /n α ) α = 1 ballistic scaling α = 1/2 diffusive scaling AQOS, Autrans, 8-19/7/2013 p.24/29
50 Ballistic vs. Diffusive Scaling Expected r -dependent Drift: Diffusive behaviour: X n vn (X n vn) n Tool Given X n {w k (n)} k Z d, and y T d let Φ n (y) = E w(n) (e iyx n ) = k Z d w k (n)e iyk s.t. i yj Φ n (y/n α ) y=0 = k Z d w k (n)k j /n α = E w(n) ((X n ) j /n α ) α = 1 ballistic scaling α = 1/2 diffusive scaling Rem: Charact. Funct. Φ n (y) is analytic in C d. AQOS, Autrans, 8-19/7/2013 p.24/29
51 Black Box Reformulation Steps Expansion of w k (n) = E ω Jk ω (n)ϕ 0 2 C sums over weighted paths 2d Extended space C d C d C d i.i.d. coin matrices Periodicity of Φ n (y) T d AQOS, Autrans, 8-19/7/2013 p.25/29
52 Black Box Reformulation Steps Expansion of w k (n) = E ω Jk ω (n)ϕ 0 2 C sums over weighted paths 2d Extended space C d C d C d i.i.d. coin matrices Periodicity of Φ n (y) T d Set for any (y,y ) T d T d D(y,y ) := d(y) d(y ), where d(y) = τ I ± e iyr(τ) τ τ, E := E ω (C ω C ω ), M(y,y ) := D(y,y )E Ψ 1 = τ I ± τ τ, Φ 0 = ϕ 0 ϕ 0 Char. Funct. For y T d, Φ n (y) = Ψ 1 M n (y v,v)φ 0 dṽ T d AQOS, Autrans, 8-19/7/2013 p.25/29
53 Spectral Analysis Φ n (y) = T d Ψ 1 M n (y v,v)φ 0 dṽ Properties For all v T d Ψ 1 = τ I ± τ τ invar. under M( v,v) and its adjoint Spr M( v,v) = M( v,v) = 1 AQOS, Autrans, 8-19/7/2013 p.26/29
54 Spectral Analysis Φ n (y) = T d Ψ 1 M n (y v,v)φ 0 dṽ Properties For all v T d Ψ 1 = τ I ± τ τ invar. under M( v,v) and its adjoint Spr M( v,v) = M( v,v) = 1 Assumption S For all v T d, σ(m( v,v)) D(0,1) = {1} and 1 is simple AQOS, Autrans, 8-19/7/2013 p.26/29
55 Spectral Analysis Φ n (y) = T d Ψ 1 M n (y v,v)φ 0 dṽ Properties For all v T d Ψ 1 = τ I ± τ τ invar. under M( v,v) and its adjoint Spr M( v,v) = M( v,v) = 1 Assumption S For all v T d, σ(m( v,v)) D(0,1) = {1} and 1 is simple Consequently 0 < δ < 1, a complex ngbhd. N of {0} T d s.t. (y,v) N σ(m(y v,v)) D(1,δ) = {λ 1 (y,v)} σ(m(y v,v))\{λ 1 (y,v)} D(0,1 δ) M(y v,v) = λ 1 (y,v)p(y,v)+r(y,v), Spr(R(y,v)) < 1 δ where λ 1 (y,v), P(y,v), R(y,v) are analytic in N and λ 1 (0,v) 1 and P(0,v) Ψ 1 Ψ 1 /(2d). AQOS, Autrans, 8-19/7/2013 p.26/29
56 Perturbation Theory Φ n (y) = T d Ψ 1 M n (y v,v)φ 0 dṽ Diffusive/Ballistic Scaling y y/n α << 1 High Powers M(y/n α v,v) n = λ 1 (y/n α,v) n P(y/n α,v)+o((1 δ) n ) AQOS, Autrans, 8-19/7/2013 p.27/29
57 Perturbation Theory Φ n (y) = T d Ψ 1 M n (y v,v)φ 0 dṽ Diffusive/Ballistic Scaling y y/n α << 1 High Powers M(y/n α v,v) n = λ 1 (y/n α,v) n P(y/n α,v)+o((1 δ) n ) Analytic Perturbation Theory For (0,v) N, λ 1 (y,v) 1+y i 2d τ I ± r(τ) 1 2 y D(v)y +O v( y 3 ) The map v D(v) M d (C) is real analytic in T d and D(v) j,k = 2 y j y k λ(0,v) For v T d, D(v) 0 and O v ( y 3 ) is unif. in v in a complex nbhd. of T d. AQOS, Autrans, 8-19/7/2013 p.27/29
58 Results in Average Assumption S a real analytic map T d v D(v) M d (R), s.t. D(v) 0. AQOS, Autrans, 8-19/7/2013 p.28/29
59 Results in Average Assumption S a real analytic map T d v D(v) M d (R), s.t. D(v) 0. Theorem Under S, unif. in y in cpct sets of C d, lim Φ n(y/n) = e iyr, r = 1 r(τ) n 2d τ I ± ry n Φ n (y/ n) = lim n e in T d e 1 2 y D(v)y dṽ. AQOS, Autrans, 8-19/7/2013 p.28/29
60 Results in Average Assumption S a real analytic map T d v D(v) M d (R), s.t. D(v) 0. Theorem Under S, unif. in y in cpct sets of C d, lim Φ n(y/n) = e iyr, r = 1 r(τ) n 2d τ I ± ry n Φ n (y/ n) = lim n e in lim n lim n Consequently T d e 1 2 y D(v)y dṽ. X i ψ0 (n) = r i Drift n (X nr) i (X nr) j ψ0 (n) = D ij (v)dṽ Diffusion Matrix. n T d + Moderate/Large Deviations Results AQOS, Autrans, 8-19/7/2013 p.28/29
61 Variants / Perspectives Variations Open Quantum Walks Interacting Quantum Walkers Localization for the Chalker-Coddington model of electron transport localization-delocalization spectral transitions for RQW defined on trees AQOS, Autrans, 8-19/7/2013 p.29/29
62 Variants / Perspectives Variations Open Quantum Walks Interacting Quantum Walkers Localization for the Chalker-Coddington model of electron transport localization-delocalization spectral transitions for RQW defined on trees Perspectives Delocalization regime for the Chalker-Coddington model? Statistics of eigenvalues for RQW on Z d? (De-)localization properties of Random Open Quantum Walks?... AQOS, Autrans, 8-19/7/2013 p.29/29
Random Time-Dependent Quantum Walks
Random Time-Dependent Quantum Walks Alain Joye Abstract We consider the discrete time unitary dynamics given by a quantum walk on the lattice Z d performed by a quantum particle with internal degree of
More informationRecurrences and Full-revivals in Quantum Walks
Recurrences and Full-revivals in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech Technical University in Prague,
More informationRecurrences in Quantum Walks
Recurrences in Quantum Walks M. Štefaňák (1), I. Jex (1), T. Kiss (2) (1) Department of Physics, FJFI ČVUT in Prague, Czech Republic (2) Department of Nonlinear and Quantum Optics, RISSPO, Hungarian Academy
More informationSpatial correlations in quantum walks with two particles
Spatial correlations in quantum walks with two particles M. Štefaňák (1), S. M. Barnett 2, I. Jex (1) and T. Kiss (3) (1) Department of Physics, Faculty of Nuclear Sciences and Physical Engineering, Czech
More informationA quantum walk based search algorithm, and its optical realisation
A quantum walk based search algorithm, and its optical realisation Aurél Gábris FJFI, Czech Technical University in Prague with Tamás Kiss and Igor Jex Prague, Budapest Student Colloquium and School on
More informationDynamical Localization of Quantum Walks in Random Environments
Dynamical Localization of Quantum Walks in Random Environments Alain Joye Marco Merkli Abstract The dynamics of a one dimensional quantum walker on the lattice with two internal degrees of freedom, the
More informationBound States and Recurrence Properties of Quantum Walks
Bound States and Recurrence Properties of Quantum Walks Autrans 18.07.2013 Albert H. Werner Joint work with: Andre Ahlbrecht, Christopher Cedzich, Volkher B. Scholz (now ETH), Reinhard F. Werner (Hannover)
More informationα x x 0 α x x f(x) α x x α x ( 1) f(x) x f(x) x f(x) α x = α x x 2
Quadratic speedup for unstructured search - Grover s Al- CS 94- gorithm /8/07 Spring 007 Lecture 11 01 Unstructured Search Here s the problem: You are given an efficient boolean function f : {1,,} {0,1},
More informationSpectral properties of quantum graphs via pseudo orbits
Spectral properties of quantum graphs via pseudo orbits 1, Ram Band 2, Tori Hudgins 1, Christopher Joyner 3, Mark Sepanski 1 1 Baylor, 2 Technion, 3 Queen Mary University of London Cardiff 12/6/17 Outline
More informationOpen quantum random walks: bi-stability and ballistic diffusion. Open quantum brownian motion
Open quantum random walks: bi-stability and ballistic diffusion Open quantum brownian motion with Michel Bauer and Antoine Tilloy Autrans, July 2013 Different regimes in «open quantum random walks»: Open
More informationQuantum algorithms based on span programs
Quantum algorithms based on span programs Ben Reichardt IQC, U Waterloo [arxiv:0904.2759] Model: Complexity measure: Quantum algorithms Black-box query complexity Span programs Witness size [KW 93] [RŠ
More informationCorrelated Markov Quantum Walks
Correlated Markov Quantum Walks Eman Hamza Alain Joye Abstract We consider the discrete time unitary dynamics given by a quantum walk on Z d performed by a particle with internal degree of freedom, called
More information!"#$%"&'(#)*+',$'-,+./0%0'#$1' 23$4$"3"+'5,&0'
!"#$%"&'(#)*+',$'-,+./0%0'#$1' 23$4$"3"+'5,&0' 6/010/,.*'(7'8%/#".9' -0:#/%&0$%'3;'0' Valencia 2011! Outline! Quantum Walks! DTQW & CTQW! Quantum Algorithms! Searching, Mixing,
More informationHamiltonian simulation with nearly optimal dependence on all parameters
Hamiltonian simulation with nearly optimal dependence on all parameters Dominic Berry + Andrew Childs obin Kothari ichard Cleve olando Somma Quantum simulation by quantum walks Dominic Berry + Andrew Childs
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationConvergence of coined quantum walks on R d
Convergence of coined quantum walks on Alex D. Gottlieb, Svante Janson, and Petra F. Scudo June 7, 2004; corrected October 5, 2004 Abstract Coined quantum walks may be interpreted as the motion in position
More informationTwo-Dimensional Quantum Walks with Boundaries
WECIQ 26 - Artigos Two-Dimensional Quantum Walks with Boundaries Amanda C. Oliveira 1, Renato ortugal 1, Raul Donangelo 2 1 Laboratório Nacional de Computação Científica, LNCC Caixa ostal 95113 25651-75
More informationIntroduction to the Mathematics of the XY -Spin Chain
Introduction to the Mathematics of the XY -Spin Chain Günter Stolz June 9, 2014 Abstract In the following we present an introduction to the mathematical theory of the XY spin chain. The importance of this
More informationThe following definition is fundamental.
1. Some Basics from Linear Algebra With these notes, I will try and clarify certain topics that I only quickly mention in class. First and foremost, I will assume that you are familiar with many basic
More informationQFT Perturbation Theory
QFT Perturbation Theory Ling-Fong Li (Institute) Slide_04 1 / 43 Interaction Theory As an illustration, take electromagnetic interaction. Lagrangian density is The combination L = ψ (x ) γ µ ( i µ ea µ
More informationDiscrete Time Quantum Walk with Incommensurate Coin
Discrete Time Quantum Walk with Incommensurate Coin Yutaka Shikano Massachusetts Institute of Technology Tokyo Institute of Technology In collaboration with Hosho Katsura (Gakushuin University) Discrete
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationRandom Walks and Quantum Walks
Random Walks and Quantum Walks Stephen Bartlett, Department of Physics and Centre for Advanced Computing Algorithms and Cryptography, Macquarie University Random Walks and Quantum Walks Classical random
More informationDiscrete-Time Quantum Walk and Quantum Dynamical Simulator Yutaka Shikano
Discrete-Time Quantum Walk and Quantum Dynamical Simulator Yutaka Shikano Institute for Molecular Science Research Associate Professor What is my current research interest? 1 Foundation of Thermodynamics
More informationHadamard matrices and Compact Quantum Groups
Hadamard matrices and Compact Quantum Groups Uwe Franz 18 février 2014 3ème journée FEMTO-LMB based in part on joint work with: Teodor Banica, Franz Lehner, Adam Skalski Uwe Franz (LMB) Hadamard & CQG
More informationLecture 3: Central Limit Theorem
Lecture 3: Central Limit Theorem Scribe: Jacy Bird (Division of Engineering and Applied Sciences, Harvard) February 8, 003 The goal of today s lecture is to investigate the asymptotic behavior of P N (
More informationMean-Field Limits for Large Particle Systems Lecture 2: From Schrödinger to Hartree
for Large Particle Systems Lecture 2: From Schrödinger to Hartree CMLS, École polytechnique & CNRS, Université Paris-Saclay FRUMAM, Marseilles, March 13-15th 2017 A CRASH COURSE ON QUANTUM N-PARTICLE DYNAMICS
More informationDegenerate Perturbation Theory
Physics G6037 Professor Christ 12/05/2014 Degenerate Perturbation Theory The treatment of degenerate perturbation theory presented in class is written out here in detail. 1 General framework and strategy
More informationClassical and Quantum Localization in two and three dimensions
Classical and Quantum Localization in two and three dimensions John Cardy University of Oxford Mathematics of Phase Transitions Warwick, November 2009 This talk is about some mathematical results on physical
More informationDiffusion of wave packets in a Markov random potential
Diffusion of wave packets in a Markov random potential Jeffrey Schenker Michigan State University Joint work with Yang Kang (JSP 134 (2009)) WIP with Eman Hamza & Yang Kang ETH Zürich 9 June 2009 Jeffrey
More informationTopological classification of 1D symmetric quantum walks
Topological classification of 1D symmetric quantum walks Albert H. Werner QMath University of Copenhagen Together with: C. Cedzic, T. Geib, F. A. Grünbaum, C. Stahl, L. Velazques, R. F. Werner Phase classification
More informationLecture 3: Central Limit Theorem
Lecture 3: Central Limit Theorem Scribe: Jacy Bird (Division of Engineering and Applied Sciences, Harvard) February 8, 003 The goal of today s lecture is to investigate the asymptotic behavior of P N (εx)
More informationHopping transport in disordered solids
Hopping transport in disordered solids Dominique Spehner Institut Fourier, Grenoble, France Workshop on Quantum Transport, Lexington, March 17, 2006 p. 1 Outline of the talk Hopping transport Models for
More informationKet space as a vector space over the complex numbers
Ket space as a vector space over the complex numbers kets ϕ> and complex numbers α with two operations Addition of two kets ϕ 1 >+ ϕ 2 > is also a ket ϕ 3 > Multiplication with complex numbers α ϕ 1 >
More informationQuantum algorithms. Andrew Childs. Institute for Quantum Computing University of Waterloo
Quantum algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 11th Canadian Summer School on Quantum Information 8 9 June 2011 Based in part on slides prepared with Pawel Wocjan
More informationGeneric quantum walk using a coin-embedded shift operator
PHYSICAL REVIEW A 78, 052309 2008 Generic quantum walk using a coin-embedded shift operator C. M. Chandrashekar Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
More informationIII. Quantum ergodicity on graphs, perspectives
III. Quantum ergodicity on graphs, perspectives Nalini Anantharaman Université de Strasbourg 24 août 2016 Yesterday we focussed on the case of large regular (discrete) graphs. Let G = (V, E) be a (q +
More informationBanach Journal of Mathematical Analysis ISSN: (electronic)
Banach J. Math. Anal. 6 (2012), no. 1, 139 146 Banach Journal of Mathematical Analysis ISSN: 1735-8787 (electronic) www.emis.de/journals/bjma/ AN EXTENSION OF KY FAN S DOMINANCE THEOREM RAHIM ALIZADEH
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk We now turn to a second major topic in quantum algorithms, the concept
More informationRESOLVENT METHODS FOR QUANTUM WALKS WITH AN APPLICATION TO A THUE-MORSE QUANTUM WALK
RESOLVENT METHODS FOR QUANTUM WALKS WITH AN APPLICATION TO A THUE-MORSE QUANTUM WALK JAKE FILLMAN Abstract. In this expository work, we discuss spatially inhomogeneous quantum walks in one dimension and
More informationQUANTUM RANDOM WALKS ON ONE AND TWO DIMENSIONAL LATTICES. A Dissertation Submitted to the Temple University Graduate Board
QUANTUM RANDOM WALKS ON ONE AND TWO DIMENSIONAL LATTICES A Dissertation Submitted to the Temple University Graduate Board in Partial Fulfillment of the Requirements for the Degree of DOCTOR OF PHILOSOPHY
More informationHein, Birgit (2010) Quantum search algorithms. PhD thesis, University of Nottingham.
Hein, Birgit (00) Quantum search algorithms. PhD thesis, University of Nottingham. Access from the University of Nottingham repository: http://eprints.nottingham.ac.uk/5//phd_thesis_birgit_hein.pdf Copyright
More informationMath 471 (Numerical methods) Chapter 3 (second half). System of equations
Math 47 (Numerical methods) Chapter 3 (second half). System of equations Overlap 3.5 3.8 of Bradie 3.5 LU factorization w/o pivoting. Motivation: ( ) A I Gaussian Elimination (U L ) where U is upper triangular
More informationLectures 6 7 : Marchenko-Pastur Law
Fall 2009 MATH 833 Random Matrices B. Valkó Lectures 6 7 : Marchenko-Pastur Law Notes prepared by: A. Ganguly We will now turn our attention to rectangular matrices. Let X = (X 1, X 2,..., X n ) R p n
More informationBrownian Bridge and Self-Avoiding Random Walk.
Brownian Bridge and Self-Avoiding Random Walk. arxiv:math/02050v [math.pr] 9 May 2002 Yevgeniy Kovchegov Email: yevgeniy@math.stanford.edu Fax: -650-725-4066 November 2, 208 Abstract We derive the Brownian
More informationQFT Perturbation Theory
QFT Perturbation Theory Ling-Fong Li Institute) Slide_04 1 / 44 Interaction Theory As an illustration, take electromagnetic interaction. Lagrangian density is The combination is the covariant derivative.
More informationOn Alternating Quantum Walks
On Alternating Quantum Walks Jenia Rousseva, Yevgeniy Kovchegov Abstract We study an inhomogeneous quantum walk on a line that evolves according to alternating coins, each a rotation matrix. For the quantum
More informationSupplementary information I Hilbert Space, Dirac Notation, and Matrix Mechanics. EE270 Fall 2017
Supplementary information I Hilbert Space, Dirac Notation, and Matrix Mechanics Properties of Vector Spaces Unit vectors ~xi form a basis which spans the space and which are orthonormal ( if i = j ~xi
More informationBRST and Dirac Cohomology
BRST and Dirac Cohomology Peter Woit Columbia University Dartmouth Math Dept., October 23, 2008 Peter Woit (Columbia University) BRST and Dirac Cohomology October 2008 1 / 23 Outline 1 Introduction 2 Representation
More informationQuantum Recursion and Second Quantisation Basic Ideas and Examples
Quantum Recursion and Second Quantisation Basic Ideas and Examples Mingsheng Ying University of Technology, Sydney, Australia and Tsinghua University, China Happy Birthday Prakash! Happy Birthday Prakash!
More informationEntanglement and Decoherence in Coined Quantum Walks
Entanglement and Decoherence in Coined Quantum Walks Peter Knight, Viv Kendon, Ben Tregenna, Ivens Carneiro, Mathieu Girerd, Meng Loo, Xibai Xu (IC) & Barry Sanders, Steve Bartlett (Macquarie), Eugenio
More informationStatistical signal processing
Statistical signal processing Short overview of the fundamentals Outline Random variables Random processes Stationarity Ergodicity Spectral analysis Random variable and processes Intuition: A random variable
More informationQuantum Cluster Methods (CPT/CDMFT)
Quantum Cluster Methods (CPT/CDMFT) David Sénéchal Département de physique Université de Sherbrooke Sherbrooke (Québec) Canada Autumn School on Correlated Electrons Forschungszentrum Jülich, Sept. 24,
More informationA Review of Quantum Random Walks and their Algorithmic Applications
A Review of Quantum Random Walks and their Algorithmic Applications Enis K. Inan 1 and Mohamed Abidalrekab 2 1 Portland State University einan@pdx.edu 2 Portland State University moh29@pdx.edu June 17,
More information1 Math 241A-B Homework Problem List for F2015 and W2016
1 Math 241A-B Homework Problem List for F2015 W2016 1.1 Homework 1. Due Wednesday, October 7, 2015 Notation 1.1 Let U be any set, g be a positive function on U, Y be a normed space. For any f : U Y let
More informationNumerical construction of Wannier functions
July 12, 2017 Internship Tutor: A. Levitt School Tutor: É. Cancès 1/27 Introduction Context: Describe electrical properties of crystals (insulator, conductor, semi-conductor). Applications in electronics
More informationarxiv: v1 [quant-ph] 18 Apr 2018
Spatial search on Sierpinski carpet using quantum walk Shu Tamegai, Shohei Watabe, and Tetsuro Nikuni Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo, 162-9601, Japan Abstract arxiv:1804.06549v1
More informationQuantum Mechanics Solutions. λ i λ j v j v j v i v i.
Quantum Mechanics Solutions 1. (a) If H has an orthonormal basis consisting of the eigenvectors { v i } of A with eigenvalues λ i C, then A can be written in terms of its spectral decomposition as A =
More informationGaussian Random Fields
Gaussian Random Fields Mini-Course by Prof. Voijkan Jaksic Vincent Larochelle, Alexandre Tomberg May 9, 009 Review Defnition.. Let, F, P ) be a probability space. Random variables {X,..., X n } are called
More informationWhy Hyperbolic Symmetry?
Why Hyperbolic Symmetry? Consider the very trivial case when N = 1 and H = h is a real Gaussian variable of unit variance. To simplify notation set E ɛ = 0 iɛ and z, w C = G(E ɛ ) 2 h = [(h iɛ)(h + iɛ)]
More informationHighest-weight Theory: Verma Modules
Highest-weight Theory: Verma Modules Math G4344, Spring 2012 We will now turn to the problem of classifying and constructing all finitedimensional representations of a complex semi-simple Lie algebra (or,
More informationParametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes
Parametric Signal Modeling and Linear Prediction Theory 1. Discrete-time Stochastic Processes Electrical & Computer Engineering North Carolina State University Acknowledgment: ECE792-41 slides were adapted
More informationToday: 5 July 2008 ٢
Anderson localization M. Reza Rahimi Tabar IPM 5 July 2008 ١ Today: 5 July 2008 ٢ Short History of Anderson Localization ٣ Publication 1) F. Shahbazi, etal. Phys. Rev. Lett. 94, 165505 (2005) 2) A. Esmailpour,
More informationNumerical Analysis of the Anderson Localization
Numerical Analysis of the Anderson Localization Peter Marko² FEI STU Bratislava FzU Praha, November 3. 23 . introduction: localized states in quantum mechanics 2. statistics and uctuations 3. metal - insulator
More informationThe Quantum Query Complexity of Algebraic Properties
The Quantum Query Complexity of Algebraic Properties Sebastian Dörn Institut für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430
More informationC/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21
C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum
More informationQuantum Complexity of Testing Group Commutativity
Quantum Complexity of Testing Group Commutativity Frédéric Magniez 1 and Ashwin Nayak 2 1 CNRS LRI, UMR 8623 Université Paris Sud, France 2 University of Waterloo and Perimeter Institute for Theoretical
More informationNon-square diagonal matrices
Non-square diagonal matrices Aim lecture: We apply the spectral theory of hermitian operators to look at linear maps T : V W which are not necessarily endomorphisms. This gives useful factorisations of
More informationA Glimpse of Quantum Computation
A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation
More informationQuantum Recursion and Second Quantisation
Quantum Recursion and Second Quantisation Mingsheng Ying University of Technology Sydney, Australia and Tsinghua University, China Outline 1. Introduction 2. Quantum Case Statement 3. Syntax of Quantum
More informationChapter 29. Quantum Chaos
Chapter 29 Quantum Chaos What happens to a Hamiltonian system that for classical mechanics is chaotic when we include a nonzero h? There is no problem in principle to answering this question: given a classical
More informationSPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS
SPECTRAL THEOREM FOR COMPACT SELF-ADJOINT OPERATORS G. RAMESH Contents Introduction 1 1. Bounded Operators 1 1.3. Examples 3 2. Compact Operators 5 2.1. Properties 6 3. The Spectral Theorem 9 3.3. Self-adjoint
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationNew Journal of Physics
New Journal of Physics The open access journal for physics Entanglement in coined quantum walks on regular graphs Ivens Carneiro, Meng Loo, Xibai Xu, Mathieu Girerd,2, Viv Kendon,3 and Peter L Knight QOLS,
More informationSolutions to exam : 1FA352 Quantum Mechanics 10 hp 1
Solutions to exam 6--6: FA35 Quantum Mechanics hp Problem (4 p): (a) Define the concept of unitary operator and show that the operator e ipa/ is unitary (p is the momentum operator in one dimension) (b)
More informationReal Variables # 10 : Hilbert Spaces II
randon ehring Real Variables # 0 : Hilbert Spaces II Exercise 20 For any sequence {f n } in H with f n = for all n, there exists f H and a subsequence {f nk } such that for all g H, one has lim (f n k,
More information6. Auxiliary field continuous time quantum Monte Carlo
6. Auxiliary field continuous time quantum Monte Carlo The purpose of the auxiliary field continuous time quantum Monte Carlo method 1 is to calculate the full Greens function of the Anderson impurity
More informationOn the Random XY Spin Chain
1 CBMS: B ham, AL June 17, 2014 On the Random XY Spin Chain Robert Sims University of Arizona 2 The Isotropic XY-Spin Chain Fix a real-valued sequence {ν j } j 1 and for each integer n 1, set acting on
More informationOptimizing the discrete time quantum walk using a SU(2) coin
PHYSICAL REVIEW A 77, 336 8 Optimizing the discrete time quantum walk using a SU() coin C. M. Chandrashekar, 1 R. Srikanth,,3 and Raymond Laflamme 1,4 1 Institute for Quantum Computing, University of Waterloo,
More informationReturn Probability of the Fibonacci Quantum Walk
Commun. Theor. Phys. 58 (0 0 Vol. 58 o. August 5 0 Return Probability of the Fibonacci Quantum Walk CLEMET AMPADU 3 Carrolton Road Boston Massachusetts 03 USA (Received February 7 0; revised manuscript
More informationA Probability Review
A Probability Review Outline: A probability review Shorthand notation: RV stands for random variable EE 527, Detection and Estimation Theory, # 0b 1 A Probability Review Reading: Go over handouts 2 5 in
More informationConsider a system of n ODEs. parameter t, periodic with period T, Let Φ t to be the fundamental matrix of this system, satisfying the following:
Consider a system of n ODEs d ψ t = A t ψ t, dt ψ: R M n 1 C where A: R M n n C is a continuous, (n n) matrix-valued function of real parameter t, periodic with period T, t R k Z A t + kt = A t. Let Φ
More informationQuantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions
LATVIJAS UNIVERSITĀTES RAKSTI. 008, 733. sēj.: DATORZINĀTNE UN INFORMĀCIJAS TEHNOLOĢIJAS 15. 38. lpp. Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions Alina Vasiljeva
More informationarxiv:quant-ph/ v1 10 Jun 2006
Quantum walks with infinite hitting times Hari Krovi and Todd A. Brun Communication Sciences Institute, University of Southern California, Los Angeles, California 90089, USA (Dated: January, 08) arxiv:quant-ph/0606094v
More informationRandom Fermionic Systems
Random Fermionic Systems Fabio Cunden Anna Maltsev Francesco Mezzadri University of Bristol December 9, 2016 Maltsev (University of Bristol) Random Fermionic Systems December 9, 2016 1 / 27 Background
More informationLecture 2. Spring Quarter Statistical Optics. Lecture 2. Characteristic Functions. Transformation of RVs. Sums of RVs
s of Spring Quarter 2018 ECE244a - Spring 2018 1 Function s of The characteristic function is the Fourier transform of the pdf (note Goodman and Papen have different notation) C x(ω) = e iωx = = f x(x)e
More informationA BRIEF INTRODUCTION TO SEVERAL COMPLEX VARIABLES
A BRIEF INTRODUCTION TO SEVERAL COMPLEX VARIABLES PO-LAM YUNG Contents 1. The Cauchy-Riemann complex 1 2. Geometry of the domain: Pseudoconvexity 3 3. Solvability of the Cauchy-Riemann operator 5 4. The
More informationOn the distinguishability of random quantum states
1 1 Department of Computer Science University of Bristol Bristol, UK quant-ph/0607011 Distinguishing quantum states Distinguishing quantum states This talk Question Consider a known ensemble E of n quantum
More informationSymmetry in quantum walks on graphs
NSF Workshop on Quantum Information Processing and Nanoscale Systems, September 2007 Symmetry in quantum walks on graphs Hari Krovi and Todd Brun Communication Sciences Institute Ming Hsieh Department
More informationDiagrammatic Green s Functions Approach to the Bose-Hubbard Model
Diagrammatic Green s Functions Approach to the Bose-Hubbard Model Matthias Ohliger Institut für Theoretische Physik Freie Universität Berlin 22nd of January 2008 Content OVERVIEW CONSIDERED SYSTEM BASIC
More informationFinite Temperature Field Theory
Finite Temperature Field Theory Dietrich Bödeker, Universität Bielefeld 1. Thermodynamics (better: thermo-statics) (a) Imaginary time formalism (b) free energy: scalar particles, resummation i. pedestrian
More informationAn Isometric Dynamics for a Causal Set Approach to Discrete Quantum Gravity
University of Denver Digital Commons @ DU Mathematics Preprint Series Department of Mathematics 214 An Isometric Dynamics for a Causal Set Approach to Discrete Quantum Gravity S. Gudder Follow this and
More information1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12
C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12 In this and the next lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to
More informationMA 519 Probability: Review
MA 519 : Review Yingwei Wang Department of Mathematics, Purdue University, West Lafayette, IN, USA Contents 1 How to compute the expectation? 1.1 Tail........................................... 1. Index..........................................
More informationDegenerate Perturbation Theory. 1 General framework and strategy
Physics G6037 Professor Christ 12/22/2015 Degenerate Perturbation Theory The treatment of degenerate perturbation theory presented in class is written out here in detail. The appendix presents the underlying
More informationScaling exponents for certain 1+1 dimensional directed polymers
Scaling exponents for certain 1+1 dimensional directed polymers Timo Seppäläinen Department of Mathematics University of Wisconsin-Madison 2010 Scaling for a polymer 1/29 1 Introduction 2 KPZ equation
More informationPropagation bounds for quantum dynamics and applications 1
1 Quantum Systems, Chennai, August 14-18, 2010 Propagation bounds for quantum dynamics and applications 1 Bruno Nachtergaele (UC Davis) based on joint work with Eman Hamza, Spyridon Michalakis, Yoshiko
More informationQuantum speedup of backtracking and Monte Carlo algorithms
Quantum speedup of backtracking and Monte Carlo algorithms Ashley Montanaro School of Mathematics, University of Bristol 19 February 2016 arxiv:1504.06987 and arxiv:1509.02374 Proc. R. Soc. A 2015 471
More information4. Two-level systems. 4.1 Generalities
4. Two-level systems 4.1 Generalities 4. Rotations and angular momentum 4..1 Classical rotations 4.. QM angular momentum as generator of rotations 4..3 Example of Two-Level System: Neutron Interferometry
More informationarxiv:quant-ph/ v1 15 Apr 2005
Quantum walks on directed graphs Ashley Montanaro arxiv:quant-ph/0504116v1 15 Apr 2005 February 1, 2008 Abstract We consider the definition of quantum walks on directed graphs. Call a directed graph reversible
More information