First mean return time in decoherent quantum walks


 Tyler Arnold
 1 years ago
 Views:
Transcription
1 First mean return time in decoherent quantum walks Péter Sinkovicz, János K. Asbóth, Tamás Kiss Wigner Research Centre for Physics Hungarian Academy of Sciences, April 0.
2 Problem statement Example: N=,,,... A ij = A ji transition amplitude First mean return time in decoherent quantum walks /
3 Problem Our numerical results Conclusion Arrival by absorption: 0i := ψ0 i First mean return time in decoherent quantum walks /
4 Problem Our numerical results Conclusion Arrival by absorption: 0i := ψ0 i First mean return time in decoherent quantum walks U 0i /
5 Problem Our numerical results Conclusion Arrival by absorption: 0i := ψ0 i U 0i or p := h0 U 0i First mean return time in decoherent quantum walks ψ i := [I 0ih0 ] U 0i q := hψ ψ i /
6 Conditional wave function: evolve these parts, which haven t come back where ψ t+ := [I 0 0 ] U ψ t p t := 0 U ψ t q t+ := ψ t+ ψ t+ p t probability: Prob(X t = 0 X n 0 if n < t) q t probability: Prob(X n 0 if n t) First mean return time in decoherent quantum walks /
7 Mean return time T := tp t q t := Trρ(t) t= t=0 t=0 where q t+ + p t+ = q t and q 0 = F. A. Grünbaum,A. H. Werner, R. F. Werner, (0) First mean return time in decoherent quantum walks /
8 Mean return time T := tp t q t := Trρ(t) t= t=0 t=0 where q t+ + p t+ = q t and q 0 = pt N= example p t : t pt t F. A. Grünbaum,A. H. Werner, R. F. Werner, (0) First mean return time in decoherent quantum walks /
9 Mean return time T := tp t q t := Trρ(t) t= t=0 t=0 where q t+ + p t+ = q t and q 0 = pt N= example p t : t pt t T is an integer number equal with the graph size independent of A ij transition amplitude T = N F. A. Grünbaum,A. H. Werner, R. F. Werner, (0) First mean return time in decoherent quantum walks /
10 Classical case : symmetric, regular graph T Kemeny, G.; Snell, L. (90) First mean return time in decoherent quantum walks /
11 Our interest? decoherence x First mean return time in decoherent quantum walks 7 /
12 Numerical study in order to find out?? T = N I) homogeneous decoherence II) Kraus representation III) Master equation First mean return time in decoherent quantum walks 8 /
13 Homogeneous decoherence For see a transition between Grünbaum et al. s and the Classical random walk we stick in a simplest decoherence. So one step of the process is the following: coherent time step decoherence C[ρ] = UρU measurement D[ρ] xy = dρ xy + ( d)ρ xx δ xy M[ρ] = [I 0 0 ] ρ [I 0 0 ] First mean return time in decoherent quantum walks 9 /
14 T numerical result U + homogeneous decoherence T = N N for d = unitary time evolution, and d = 0 is the classical case d 0 where d ρ t+ = M[T [ρ t ]] = M[D[C[ρ t ]]] d and D[ρ] = ρ dρ dρ... dρ ρ First mean return time in decoherent quantum walks 0 /
15 Numerical study in order to find out?? T = N I) homogeneous decoherence II) Kraus representation III) Master equation First mean return time in decoherent quantum walks /
16 Kraus representation In order to map all quantum channel we can use Kraus representation for the decoherence channel d ρ := D[ρ] = K µ ρk µ µ= ρ m,µ = D m,n µ,ν ρ n,ν trace preserving (probability preserving): d K µk µ = I D stochastic µ= may we will get some redundancy, because the measure and the unitary time evolution can be defined by Kraus operators First mean return time in decoherent quantum walks /
17 numerical guess unital map T [ N I] = N I T = N T [ ] = D[C[ ]] measure less process is unital (leave the totally mixed state invariant) only if d K µ K µ = I D T stochastic µ= trace preserving and untial map quantum walk ρ T [ρ] classical walk λ t Wλ t First mean return time in decoherent quantum walks /
18 Numerical study in order to find out?? T = N I) homogeneous decoherence II) Kraus representation III) Master equation First mean return time in decoherent quantum walks /
19 Master equation For check we formulated our guess in another language: T [ ] can be substitute with the time evolution which has generated by the t ρ = i [H, ρ] + L(ρ) L(ρ) = i,j κ i,j [ i j ρ j i ( i i ρ + ρ j j ) ] Master equation. First mean return time in decoherent quantum walks /
20 Master equation For check we formulated our guess in another language: T [ ] can be substitute with the time evolution which has generated by the t ρ = i [H, ρ] + L(ρ) L(ρ) = i,j κ i,j [ i j ρ j i ( i i ρ + ρ j j ) ] Master equation. numerical guess unital map L(I) = 0 κ i,j = κ j,i T = N First mean return time in decoherent quantum walks /
21 Conclusion I) numerically studied systems Kraus representation unitary quantum walk homogeneous decoherence inhomogeneous, but symmetric decoherence unistochastic map Master equation L(I) = 0 (unital map) II) analytically we need proof for numerical guess T [I] = I unital T = N First mean return time in decoherent quantum walks /
Markov Chains. Table of Contents. Schedules
Markov Chains These notes contain material prepared by colleagues who have also presented this course at Cambridge, especially James Norris. The material mainly comes from books of Norris, Grimmett & Stirzaker,
More informationHow to Gamble If You Must
How to Gamble If You Must Kyle Siegrist Department of Mathematical Sciences University of Alabama in Huntsville Abstract In red and black, a player bets, at even stakes, on a sequence of independent games
More informationSOLUTIONS FOR PROBLEM SET 2
SOLUTIONS FOR PROBLEM SET 2 A: There exist primes p such that p+6k is also prime for k = 1,2 and 3. One such prime is p = 11. Another such prime is p = 41. Prove that there exists exactly one prime p such
More informationCritical points of once continuously differentiable functions are important because they are the only points that can be local maxima or minima.
Lecture 0: Convexity and Optimization We say that if f is a once continuously differentiable function on an interval I, and x is a point in the interior of I that x is a critical point of f if f (x) =
More informationChapter 9 Unitary Groups and SU(N)
Chapter 9 Unitary Groups and SU(N) The irreducible representations of SO(3) are appropriate for describing the degeneracies of states of quantum mechanical systems which have rotational symmetry in three
More informationPhysik Department. Matrix Product Formalism
Physik Department Matrix Product Formalism Diplomarbeit von María Gracia Eckholt Perotti Angefertigt an der Technische Universität München und am MaxPlanckInstitut für Quantenoptik Garching, September
More informationSolutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
More information4. FIRST STEPS IN THE THEORY 4.1. A
4. FIRST STEPS IN THE THEORY 4.1. A Catalogue of All Groups: The Impossible Dream The fundamental problem of group theory is to systematically explore the landscape and to chart what lies out there. We
More informationA Googlelike Model of Road Network Dynamics and its Application to Regulation and Control
A Googlelike Model of Road Network Dynamics and its Application to Regulation and Control Emanuele Crisostomi, Steve Kirkland, Robert Shorten August, 2010 Abstract Inspired by the ability of Markov chains
More informationThe Backpropagation Algorithm
7 The Backpropagation Algorithm 7. Learning as gradient descent We saw in the last chapter that multilayered networks are capable of computing a wider range of Boolean functions than networks with a single
More informationSelecting a Subset of Cases in SPSS: The Select Cases Command
Selecting a Subset of Cases in SPSS: The Select Cases Command When analyzing a data file in SPSS, all cases with valid values for the relevant variable(s) are used. If I opened the 1991 U.S. General Social
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More informationIntroduction to Group Theory with Applications in Molecular and Solid State Physics
Introduction to Group Theory with Applications in Molecular and Solid State Physics Karsten Horn FritzHaberInstitut der MaxPlanckGesellschaft 3 84 3, email horn@fhiberlin.mpg.de Symmetry  old concept,
More informationClosed Timelike Curves Make Quantum and Classical Computing Equivalent
Closed Timelike Curves Make Quantum and Classical Computing Equivalent Scott Aaronson MIT John Watrous University of Waterloo Abstract While closed timelike curves (CTCs) are not known to exist, studying
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationBackground Information on Exponentials and Logarithms
Background Information on Eponentials and Logarithms Since the treatment of the decay of radioactive nuclei is inetricably linked to the mathematics of eponentials and logarithms, it is important that
More information( 1)2 + 2 2 + 2 2 = 9 = 3 We would like to make the length 6. The only vectors in the same direction as v are those
1.(6pts) Which of the following vectors has the same direction as v 1,, but has length 6? (a), 4, 4 (b),, (c) 4,, 4 (d), 4, 4 (e) 0, 6, 0 The length of v is given by ( 1) + + 9 3 We would like to make
More informationONEDIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK
ONEDIMENSIONAL RANDOM WALKS 1. SIMPLE RANDOM WALK Definition 1. A random walk on the integers with step distribution F and initial state x is a sequence S n of random variables whose increments are independent,
More informationFourier Theoretic Probabilistic Inference over Permutations
Journal of Machine Learning Research 10 (2009) 9971070 Submitted 5/08; Revised 3/09; Published 5/09 Fourier Theoretic Probabilistic Inference over Permutations Jonathan Huang Robotics Institute Carnegie
More informationFindTheNumber. 1 FindTheNumber With Comps
FindTheNumber 1 FindTheNumber With Comps Consider the following twoperson game, which we call FindTheNumber with Comps. Player A (for answerer) has a number x between 1 and 1000. Player Q (for questioner)
More informationInner Product Spaces and Orthogonality
Inner Product Spaces and Orthogonality week 34 Fall 2006 Dot product of R n The inner product or dot product of R n is a function, defined by u, v a b + a 2 b 2 + + a n b n for u a, a 2,, a n T, v b,
More informationProbability on Graphs
Probability on Graphs Random Processes on Graphs and Lattices GEOFFREY GRIMMETT Statistical Laboratory University of Cambridge Geoffrey Grimmett Statistical Laboratory Centre for Mathematical Sciences
More informationTAKEAWAY GAMES. ALLEN J. SCHWENK California Institute of Technology, Pasadena, California INTRODUCTION
TAKEAWAY GAMES ALLEN J. SCHWENK California Institute of Technology, Pasadena, California L INTRODUCTION Several games of Tf takeaway?f have become popular. The purpose of this paper is to determine the
More informationPQM Supplementary Notes: Spin, topology, SU(2) SO(3) etc
PQM Supplementary Notes: Spin, topology, SU(2) SO(3) etc (away from the syllabus, but interesting material, based on notes by Dr J.M. Evans) 1 Rotations and Noncontractible Loops Rotations in R 3 can
More informationWHICH SCORING RULE MAXIMIZES CONDORCET EFFICIENCY? 1. Introduction
WHICH SCORING RULE MAXIMIZES CONDORCET EFFICIENCY? DAVIDE P. CERVONE, WILLIAM V. GEHRLEIN, AND WILLIAM S. ZWICKER Abstract. Consider an election in which each of the n voters casts a vote consisting of
More information5.7 Maximum and Minimum Values
5.7 Maximum and Minimum Values Objectives Icandefinecriticalpoints. I know the di erence between local and absolute minimums/maximums. I can find local maximum(s), minimum(s), and saddle points for a given
More informationChapter 8 Maxwell relations and measurable properties
Chapter 8 Maxwell relations and measurable properties 8.1 Maxwell relations Other thermodynamic potentials emerging from Legendre transforms allow us to switch independent variables and give rise to alternate
More informationWhich Semantics for Neighbourhood Semantics?
Which Semantics for Neighbourhood Semantics? Carlos Areces INRIA Nancy, Grand Est, France Diego Figueira INRIA, LSV, ENS Cachan, France Abstract In this article we discuss two alternative proposals for
More informationErgodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains
Ergodicity and Energy Distributions for Some Boundary Driven Integrable Hamiltonian Chains Peter Balint 1, Kevin K. Lin 2, and LaiSang Young 3 Abstract. We consider systems of moving particles in 1dimensional
More information1. Graphing Linear Inequalities
Notation. CHAPTER 4 Linear Programming 1. Graphing Linear Inequalities x apple y means x is less than or equal to y. x y means x is greater than or equal to y. x < y means x is less than y. x > y means
More information