Which Quantum Walk on Graphs?
|
|
- Robert Cunningham
- 6 years ago
- Views:
Transcription
1 Which Quantum Walk on Graphs? Christino Tamon Department of Computer Science Clarkson University August 13, 2015
2 Outline I Walks on graphs (random and quantum) I State transfer on graphs (motivation) I Known results and open problems
3 Algebraic graph theory: graphs are matrices The path P 3 w u v Its adjacency and degree matrices: A = D =
4 Walk on graphs u w v A = The matrix power A t encodes the following: A t uv = #t-step walks ending at u (starting from v) u ; v cospectral: A t uu = A t vv for all t.
5 Discrete-time random walk u w v P := AD 1 = = = The matrix power P t encodes: P t uv = P[at u after t steps (starting from v)] P is not symmetric, but p D 1 P p D is.
6 Continuous-time random walk u w v L := I e Lt = 1X k =0 p D 1 P p D ( 1) k t k k! L k The matrix exponential (e L ) t encodes: (e Lt ) uv = P[at u at time t (starting from v)] Heat kernel: Chung & Yau (1999)
7 \Quantum" walk u w v e iat = 1X k =0 ( it) k k! A k The matrix exponential (e ia ) t encodes: (e iat ) uv = amplitude at u at time t (starting from v) Recover classical interpretation by squaring: j(e iat ) uv j 2 = P[at u if measured at time t (starting from v)]
8 \Quantum" walk u w v U (t) = exp 0 i t C A More explicitly U (t) = p cos(pp p p p 2t) i 2 sin( p 2t) cos( p 2t) p 3 1 i 2 p sin( 2t) 2 p cos( 2t) p i 2 sin( p 2t) 5 cos( 2t) 1 i 2 sin( 2t) 1 + cos( 2t) U (t) is symmetric. U (=p 2)0;2 = 1, negative certainty.
9 Have you heard about... a quantum particle who walked into a discrete graph: I it can be in many places at once (superposition) I it may cancel itself out (interference) C. Addams, NY Times \Is it weird in here or is it just me?" - Steven Wright
10 Quantum walk (Farhi & Gutmann 1998) A continuous-time quantum walk on a graph G is given by U (t) := e imt where M is a Hermitian matrix related to G. Based on Schrodinger's equation i~ 0 (t) = H (t) =) (t) = e iht (0) with Hamiltonian H.
11 Motivation Why quantum walks? I paradigm to design quantum algorithms: Grover (1996), Szegedy (2004), Farhi-Goldstone-Gutmann (2008) I universal model for quantum computation: Childs (2009) I information transfer in quantum networks: Bose (2003), Christandl et al. (2004) I beautiful interplay with algebraic combinatorics Godsil (2011)
12 Spectral decomposition Theorem If M is Hermitian with eigenvalues f 1 ; : : : ; dg, there are Hermitian matrices fe 1 ; : : : ; E d g so M = dx r =1 re r where E r E s = rse r and P d r =1 E r = I. As an application: 1X ( it) k k! M k k =0 {z } innite = e imt = dx e i r t E r r =1 {z } nite
13 Quantum walk on K 2 u v Since we have A = e ita = e it 2 " # 0 1 = " # e it " # " # 1 1 = 1 1 " # " cos t i sin t i sin t cos t #
14 Graph Laplacians u w v Combinatorial, signless and normalized (San Diego): L := I L := D A = Q := D + A = p D 1 A p D 1 = p p 2 1 p p
15 Regular graphs Laplacian quantum walk on a k-regular graph: e itl = e it(ki A) ; since D = ki = e itki e ita ; because A,D commute = e itk e ita ; using e I = e I These walks are equivalent (up to phase factors and time reversal): j(e itl ) uv j = j(e ita ) uv j
16 Motivation: quantum spin network Bose (2003), Christandl et al. (2004): u w v
17 Motivation: quantum spin network Bose (2003), Christandl et al. (2004): u w v
18 Motivation: quantum spin network Bose (2003), Christandl et al. (2004): u w v
19 Quantum spin networks In a n-vertex graph G, assign to each vertex u of G a unit-norm vector u 2 C 2 (a quantum particle): u = a 0 j0i + a 1 j1i where fj0i; j1ig is an orthonormal basis for C 2. The state of all n particles is a unit-norm vector in (C 2 ) n : X = a z jz 1 i : : : jz n i z 2f0;1g n
20 Hamiltonian Consider a Hamiltonian acting on (C 2 ) n : H := X (u ;v )2E (X u X v + Y u Y v + Z u Z v ) where 2 f0; 1g and the Pauli matrices are " # " # i X = ; Y = ; Z = 1 0 i 0 " # Notation: view u 2 [n] Standard to omit. X u = I : : : I X {z} uth I : : : I
21 Information transfer Let the system do a unitary walk (t) = exp( ih t) (0) Goal: there is a time so for any unit-norm 2 C 2 (0) = j0i : : : j0i () = j0i j0i : : : It suces to take = j1i.
22 Back to quantum walk Project H onto its invariant subspace W spanned by fje u ig n u=1 where e u 2 f0; 1g n has Hamming weight one. We get a n n matrix The goal becomes ~H 8 >< >: L if = +1 A if = 0 Q if = 1 je n i = exp( i ~H t)je 1 i
23 Example: P 3 H = XXI + IXX + YYI + IYY + (ZZI + IZZ ) Let W = spanfj100i; j010i; j001ig. Restricted to W, we get the blue submatrix (adjacency matrix of P 3 ). Pauli Y is similar.
24 State transfer (Bose 2003, Christandl et al. 2004) A graph G has perfect state transfer (relative to M ) between vertices u and v at time t if for some 2 C. exp( imt)e u = e v Choices for M : adjacency matrix, or one of the Laplacians or anything Hermitian?
25 Rest of talk State Transfer in Quantum Walk relative to Combinatorial Laplacian I Tight conditions for perfect state transfer I Families of graphs (with or without) I Questions
26 Three equalities (Godsil) Say G has Laplacian perfect state transfer between u and v:
27 Three equalities (Godsil) Say G has Laplacian perfect state transfer between u and v: X 1 = j(e ilt ) uv j = j e i t r (E r ) uv j; by spectral theorem X r j(e r ) uv j; e i t r = sgn((e r ) uv ) r q q(e r ) uu (E r ) vv ; E r e u / E r e v X r s X r (E r ) uu s X r (E r ) vv ; (E r ) uu = (E r ) vv = 1 since P r E r = I
28 Three equalities (Godsil) Say G has Laplacian perfect state transfer between u and v: X 1 = j(e ilt ) uv j = j e i t r (E r ) uv j; by spectral theorem X r j(e r ) uv j; e i t r = sgn((e r ) uv ) r q q(e r ) uu (E r ) vv ; E r e u / E r e v X r s X r (E r ) uu s X r (E r ) vv ; (E r ) uu = (E r ) vv = 1 since P r E r = I Conditions: integrality and strong cospectrality e i r t = sgn((e r ) uv ); E r e u = E r e v
29 Conditions Let supp(u) := fr : E r e u 6= 0g and u ;v := fr 2 supp(u) : E r e u = E r e v g Thm (see Coutinho's thesis) G has Laplacian perfect state transfer between u and v at time if and only if all of the following hold: I E r e u = E r e v. I supp(u) Z. I r 2 + u ;v i r = gcd(supp(u)) is even. Moreover, is an odd multiple of = gcd(supp(u)).
30 Cubes u v Laplacian perfect state transfer occurs on K 2 at time t = =2. " # " # cos(t) e il(k2)t = e it i sin(t)! 0 1 t = =2 i sin(t) cos(t) 1 0 Thm (Christandl et al. 2004) The n-cube Q n has Laplacian perfect state transfer at time =2. proof: The quantum walk on G H is given by e il(g H )t = e il(g)t e il(h )t Therefore e il(q n )t = (e il(k2)t ) n.
31 Perpetual example: P 3 True/False: There is perfect state transfer relative to L in P 3. u w v
32 Perpetual example: P 3 True/False: There is perfect state transfer relative to L in P 3. u w v Thm (Coutinho & Liu) No tree has Laplacian perfect state transfer except for K 2. (P 3 is a tree) Thm (w. Alvir, Dever, Lovitz, Myer, Xu, Zhan) K 2 + G has Laplacian perfect state transfer i jgj 2 (mod 4). (P 3 = K 2 + K 1 )
33 Odd Trees Thm (Coutinho & Liu) No odd order G with an odd number of spanning trees has Laplacian perfect state transfer. Proof: By Matrix Tree Theorem: Y r 6=0 r = jgj (#spanning trees): The number of even integer eigenvalues r for which E r e u 6= 0 must be at least two for perfect state transfer to occur. A bit more is true: (Ghorbani) If G has odd order and #spanning trees 6 0 (mod 4), then L has no nonzero even integer eigenvalue.
34 Double cones Lemma: If G has Laplacian perfect state transfer at time t, so does G provided jgjt 2 2Z. Proof: Let n = jgj. Note L G = ni J L G. Thus exp( itl G ) = e itn e itj exp(itl G ) But, e itj = (e itn 1)J =n + I. Thm (w. Alvir, Dever, Lovitz, Myer, Xu, Zhan) K 2 + H has Laplacian perfect state transfer i jh j 2 (mod 4). Proof: K 2 [ H = K 2 + H and K 2 has perfect state transfer at time t = =2. Need 2 + jh j 2 4Z. Take quotient for only if.
35 Coronas True/False: There is perfect state transfer relative to L in P 4. u a b v (Frucht & Harary) The corona G H is formed by taking one copy of G and jgj copies of H. Then connect the j th vertex of G to each vertex in the j th copy of H. Note: P 4 = K 2 K 1. Thm (w. Ackelsberg, Brehm, Chan, Mundinger) No corona G H has Laplacian perfect state transfer whenever jgj 2 and jh j 1.
36 Why Coronas 3K 2 K 1 (spiky cocktail party graph) Thm (w. Ackelsberg, Brehm, Chan, Mundinger) nk 2 K 1 has Laplacian pretty good state transfer for all n. Coutinho, Godsil, Guo, & Vanhove (2015): the only strongly regular graph with perfect state transfer is nk 2 for n even.
37 Some questions True/False: There is Laplacian perfect state transfer on a graph with odd order.
38 Some questions True/False: There is Laplacian perfect state transfer on a graph with odd order. True/False: There is Laplacian perfect state transfer on a graph at time =odd.
39 Some References S. Bose. \Quantum Communication through an Unmodulated Spin Chain," Phys. Rev. Lett. 91:207901, M. Christandl, N. Datta, A. Ekert, A. Landahl. \Perfect state transfer in quantum spin networks," Phys. Rev. Lett. 92:187902, G. Coutinho, H. Liu. \No Laplacian Perfect State Transfer on Trees," arxiv.org/ E. Farhi, S. Gutmann. \Quantum computation and decision trees," Phys. Rev. A 58:915, C. Godsil. \State Transfer on Graphs," Discrete Mathematics 312(1): , 2011.
Periodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs
St John s, June 7, 2009 Outline 1 Periodicity & State Transfer 2 Some Results 3 Some Questions Unitary Operators Suppose X is a graph with adjacency matrix A. Definition We define the operator H X (t)
More informationNo Laplacian Perfect State Transfer in Trees
No Laplacian Perfect State Transfer in Trees arxiv:1408.2935v1 [math.co] 13 Aug 2014 Gabriel Coutinho Henry Liu October 15, 2018 Abstract We consider a system of qubits coupled via nearest-neighbour interaction
More informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
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 informationAverage mixing of continuous quantum walks
Average mixing of continuous quantum walks Juergen Kritschgau Department of Mathematics Iowa State University Ames, IA 50011 jkritsch@iastate.edu April 7, 2017 Juergen Kritschgau (ISU) 2 of 17 This is
More informationarxiv: v1 [quant-ph] 13 Jul 2009
Perfect state transfer, integral circulants and join of graphs Ricardo Javier Angeles-Canul Rachael M. Norton Michael C. Opperman Christopher C. Paribello Matthew C. Russell Christino Tamon arxiv:0907.2148v1
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationState transfer in strongly regular graphs with an edge perturbation
State transfer in strongly regular graphs with an edge perturbation Chris Godsil, Krystal Guo, Mark Kempton, Gabor Lippner October 9, 2017 Abstract Quantum walks, an important tool in quantum computing,
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 informationarxiv:cond-mat/ v1 20 Sep 2004
One-dimensional continuous-time quantum walks DANIEL BEN-AVRAHAM ERIK M. BOLLT CHRISTINO TAMON September, 4 arxiv:cond-mat/4954 v Sep 4 Abstract We survey the equations of continuous-time quantum walks
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 informationQuantum Control Theory and Graphs
Quantum Control Theory and Graphs Simone Severini 1 UCL August 23, 2012 1 Joint work with Chris Godsil, Jamie Smith (UWaterloo), and Steve Kirkland (Hamilton Institute); Leslie Hogben, Michael Young, Domenico
More informationExponential algorithmic speedup by quantum walk
Exponential algorithmic speedup by quantum walk Andrew Childs MIT Center for Theoretical Physics joint work with Richard Cleve Enrico Deotto Eddie Farhi Sam Gutmann Dan Spielman quant-ph/0209131 Motivation
More informationWhen can perfect state transfer occur?
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 62 2012 When can perfect state transfer occur? Chris Godsil cgodsil@uwaterloo.ca Follow this and additional works at: http://repository.uwyo.edu/ela
More informationQuantum state transfer on distance regular. spin networks with intrinsic decoherence
Quantum state transfer on distance regular spin networks with intrinsic decoherence arxiv:1701.00647v1 [quant-ph] 3 Jan 2017 R. Sufiani a and A. Pedram a Department of Theoretical Physics and Astrophysics,
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
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 informationALGEBRAIC COMBINATORICS. c1993 C. D. Godsil
ALGEBRAIC COMBINATORICS c1993 C. D. Godsil To Gillian Preface There are people who feel that a combinatorial result should be given a \purely combinatorial" proof, but I am not one of them. For me the
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 informationPERFECT STATE TRANSFER ON SIGNED GRAPHS
Quantum Information and Computation, Vol. 13, No. 5&6 (2013) 0511 0530 c Rinton Press PERFECT STATE TRANSFER ON SIGNED GRAPHS JOHN BROWN Department of Mathematics, SUNY Potsdam 44 Pierrepont Avenue, Potsdam,
More informationPerfect state transfer in quantum walks on graphs
Perfect state transfer in quantum walks on graphs Vivien M Kendon 1, and Christino Tamon 2, 1 School of Physics and Astronomy, University of Leeds, Leeds, LS2 9JT, UK 2 Department of Computer Science,
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationDiscrete Quantum Walks on Graphs and Digraphs
Discrete Quantum Walks on Graphs and Digraphs by Hanmeng Zhan A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Combinatorics
More informationFaster quantum algorithm for evaluating game trees
Faster quantum algorithm for evaluating game trees x 7 x 8 Ben Reichardt xx1 1 x 2 x 3 x 4 x 6 OR x 9 x1 1 x 5 x 9 University of Waterloo x 5 AND OR AND AND OR AND ϕ(x) x 7 x 8 x 1 x 2 x 3 x 4 x 6 OR x
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 informationReal symmetric matrices/1. 1 Eigenvalues and eigenvectors
Real symmetric matrices 1 Eigenvalues and eigenvectors We use the convention that vectors are row vectors and matrices act on the right. Let A be a square matrix with entries in a field F; suppose that
More information2. Introduction to quantum mechanics
2. Introduction to quantum mechanics 2.1 Linear algebra Dirac notation Complex conjugate Vector/ket Dual vector/bra Inner product/bracket Tensor product Complex conj. matrix Transpose of matrix Hermitian
More informationFourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
More informationC/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12
C/CS/Phys C191 Quantum Mechanics in a Nutshell 10/06/07 Fall 2009 Lecture 12 In this lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to this course. Topics
More informationQuantum wires, orthogonal polynomials and Diophantine approximation
Quantum wires, orthogonal polynomials and Diophantine approximation Introduction Quantum Mechanics (QM) is a linear theory Main idea behind Quantum Information (QI): use the superposition principle of
More informationLinear Algebra and Dirac Notation, Pt. 2
Linear Algebra and Dirac Notation, Pt. 2 PHYS 500 - Southern Illinois University February 1, 2017 PHYS 500 - Southern Illinois University Linear Algebra and Dirac Notation, Pt. 2 February 1, 2017 1 / 14
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 informationPeter J. Dukes. 22 August, 2012
22 August, 22 Graph decomposition Let G and H be graphs on m n vertices. A decompostion of G into copies of H is a collection {H i } of subgraphs of G such that each H i = H, and every edge of G belongs
More informationQuantum Physics II (8.05) Fall 2002 Assignment 3
Quantum Physics II (8.05) Fall 00 Assignment Readings The readings below will take you through the material for Problem Sets and 4. Cohen-Tannoudji Ch. II, III. Shankar Ch. 1 continues to be helpful. Sakurai
More informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
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 informationQuantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002
Quantum NP - Cont. Classical and Quantum Computation A.Yu Kitaev, A. Shen, M. N. Vyalyi 2002 1 QMA - the quantum analog to MA (and NP). Definition 1 QMA. The complexity class QMA is the class of all languages
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 informationGraphs with Integral Spectrum
Graphs with Integral Spectrum Omran Ahmadi Department of Combinatorics & Optimization University of Waterloo Waterloo, Ontario, N2L 3G1, Canada oahmadid@math.uwaterloo.ca Noga Alon Department of Mathematics
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
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 informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationA linear algebraic view of partition regular matrices
A linear algebraic view of partition regular matrices Leslie Hogben Jillian McLeod June 7, 3 4 5 6 7 8 9 Abstract Rado showed that a rational matrix is partition regular over N if and only if it satisfies
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationAlgorithmic challenges in quantum simulation. Andrew Childs University of Maryland
Algorithmic challenges in quantum simulation Andrew Childs University of Maryland nature isn t classical, dammit, and if you want to make a simulation of nature, you d better make it quantum mechanical,
More informationAbstract We survey some of what can be deduced about automorphisms of a graph from information on its eigenvalues and eigenvectors. Two of the main to
Symmetry and Eigenvectors Ada Chan and Chris D. Godsil Combinatorics and Optimization University of Waterloo Waterloo, Ontario Canada N2L 3G http://bilby.uwaterloo.ca Support from a National Sciences and
More informationThe Strong Largeur d Arborescence
The Strong Largeur d Arborescence Rik Steenkamp (5887321) November 12, 2013 Master Thesis Supervisor: prof.dr. Monique Laurent Local Supervisor: prof.dr. Alexander Schrijver KdV Institute for Mathematics
More informationCharacterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs. Sung Y. Song Iowa State University
Characterizations of Strongly Regular Graphs: Part II: Bose-Mesner algebras of graphs Sung Y. Song Iowa State University sysong@iastate.edu Notation K: one of the fields R or C X: a nonempty finite set
More informationQuantum Search on Strongly Regular Graphs
Quantum Search on Strongly Regular Graphs Degree Project in Engineering Physics, Second Level by Jonatan Janmark at Department of Theoretical Physics Royal Institute of Technology (KTH) & Department of
More information1 Mathematical preliminaries
1 Mathematical preliminaries The mathematical language of quantum mechanics is that of vector spaces and linear algebra. In this preliminary section, we will collect the various definitions and mathematical
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationSpectra of Weighted Directed Graphs. Debajit Kalita. Doctor of Philosophy
Spectra of Weighted Directed Graphs A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Debajit Kalita to the Department of Mathematics Indian Institute
More informationUniversal computation by quantum walk
Universal computation by quantum walk Andrew Childs C&O and IQC Waterloo arxiv:0806.1972 Random walk A Markov process on a graph G = (V, E). Random walk A Markov process on a graph G = (V, E). In discrete
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationRepresentations of Sp(6,R) and SU(3) carried by homogeneous polynomials
Representations of Sp(6,R) and SU(3) carried by homogeneous polynomials Govindan Rangarajan a) Department of Mathematics and Centre for Theoretical Studies, Indian Institute of Science, Bangalore 560 012,
More informationButson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4
Butson-Hadamard matrices in association schemes of class 6 on Galois rings of characteristic 4 Akihiro Munemasa Tohoku University (joint work with Takuya Ikuta) November 17, 2017 Combinatorics Seminar
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationarxiv: v2 [math-ph] 2 Jun 2014
Spin Operators Pauli Group Commutators Anti-Commutators Kronecker product and Applications Willi-Hans Steeb and Yorick Hardy arxiv:45.5749v [math-ph] Jun 4 International School for Scientific Computing
More informationQuantum Walks on Strongly Regular Graphs
Quantum Walks on Strongly Regular Graphs by Krystal J. Guo A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics
More informationCombinatorial semigroups and induced/deduced operators
Combinatorial semigroups and induced/deduced operators G. Stacey Staples Department of Mathematics and Statistics Southern Illinois University Edwardsville Modified Hypercubes Particular groups & semigroups
More informationEigenvalues of 2-edge-coverings
Eigenvalues of -edge-coverings Steve Butler October 3, 007 Abstract A -edge-covering between G and H is an onto homomorphism from the vertices of G to the vertices of H so that each edge is covered twice
More informationChapter III. Quantum Computation. Mathematical preliminaries. A.1 Complex numbers. A.2 Linear algebra review
Chapter III Quantum Computation These lecture notes are exclusively for the use of students in Prof. MacLennan s Unconventional Computation course. c 2017, B. J. MacLennan, EECS, University of Tennessee,
More informationC/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11
C/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11 In this and the next lecture we summarize the essential physical and mathematical aspects of quantum mechanics relevant to
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
More informationAn Analog Analogue of a Digital Quantum Computation
An Analog Analogue of a Digital Quantum Computation arxiv:quant-ph/9612026v1 6 Dec 1996 Edard Farhi Center for Theoretical Physics Massachusetts Institute of Technology Cambridge, MA 02139 Sam Gutmann
More informationOn graphs with largest Laplacian eigenvalue at most 4
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 163 170 On graphs with largest Laplacian eigenvalue at most 4 G. R. Omidi Department of Mathematical Sciences Isfahan University of Technology
More informationPhysics 129B, Winter 2010 Problem Set 4 Solution
Physics 9B, Winter Problem Set 4 Solution H-J Chung March 8, Problem a Show that the SUN Lie algebra has an SUN subalgebra b The SUN Lie group consists of N N unitary matrices with unit determinant Thus,
More informationQuantum algorithms for hidden nonlinear structures
Quantum algorithms for hidden nonlinear structures Andrew Childs Waterloo Leonard Schulman Caltech Umesh Vazirani Berkeley Shor s algorithm finds hidden linear structures [Shor 94]: Efficient quantum algorithms
More informationSpectral Graph Theory
Spectral raph Theory to appear in Handbook of Linear Algebra, second edition, CCR Press Steve Butler Fan Chung There are many different ways to associate a matrix with a graph (an introduction of which
More informationExistence of Antiparticles as an Indication of Finiteness of Nature. Felix M. Lev
Existence of Antiparticles as an Indication of Finiteness of Nature Felix M. Lev Artwork Conversion Software Inc., 1201 Morningside Drive, Manhattan Beach, CA 90266, USA (Email: felixlev314@gmail.com)
More informationThe Hamming Codes and Delsarte s Linear Programming Bound
The Hamming Codes and Delsarte s Linear Programming Bound by Sky McKinley Under the Astute Tutelage of Professor John S. Caughman, IV A thesis submitted in partial fulfillment of the requirements for the
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationLinear Algebra using Dirac Notation: Pt. 2
Linear Algebra using Dirac Notation: Pt. 2 PHYS 476Q - Southern Illinois University February 6, 2018 PHYS 476Q - Southern Illinois University Linear Algebra using Dirac Notation: Pt. 2 February 6, 2018
More informationSimulating Quantum Systems through Matrix Product States. Laura Foini SISSA Journal Club
Simulating Quantum Systems through Matrix Product States Laura Foini SISSA Journal Club 15-04-2010 Motivations Theoretical interest in Matrix Product States Wide spectrum of their numerical applications
More informationQuantum Computing Lecture 3. Principles of Quantum Mechanics. Anuj Dawar
Quantum Computing Lecture 3 Principles of Quantum Mechanics Anuj Dawar What is Quantum Mechanics? Quantum Mechanics is a framework for the development of physical theories. It is not itself a physical
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 Information & Quantum Computing
Math 478, Phys 478, CS4803, February 9, 006 1 Georgia Tech Math, Physics & Computing Math 478, Phys 478, CS4803 Quantum Information & Quantum Computing Problems Set 1 Due February 9, 006 Part I : 1. Read
More informationMath 350 Fall 2011 Notes about inner product spaces. In this notes we state and prove some important properties of inner product spaces.
Math 350 Fall 2011 Notes about inner product spaces In this notes we state and prove some important properties of inner product spaces. First, recall the dot product on R n : if x, y R n, say x = (x 1,...,
More informationQUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
International Journal of Quantum Information Vol. 7, No. 8 (009) 149 1445 #.c World Scienti c Publishing Company QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS RICARDO JAVIER ANGELES-CANUL Centro
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationInduced Cycles of Fixed Length
Induced Cycles of Fixed Length Terry McKee Wright State University Dayton, Ohio USA terry.mckee@wright.edu Cycles in Graphs Vanderbilt University 31 May 2012 Overview 1. Investigating the fine structure
More information3 Symmetry Protected Topological Phase
Physics 3b Lecture 16 Caltech, 05/30/18 3 Symmetry Protected Topological Phase 3.1 Breakdown of noninteracting SPT phases with interaction Building on our previous discussion of the Majorana chain and
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationQuantum Algorithms for Finding Constant-sized Sub-hypergraphs
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs Seiichiro Tani (Joint work with François Le Gall and Harumichi Nishimura) NTT Communication Science Labs., NTT Corporation, Japan. The 20th
More informationAlgebra I Fall 2007
MIT OpenCourseWare http://ocw.mit.edu 18.701 Algebra I Fall 007 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.701 007 Geometry of the Special Unitary
More informationPhysics 505 Homework No. 1 Solutions S1-1
Physics 505 Homework No s S- Some Preliminaries Assume A and B are Hermitian operators (a) Show that (AB) B A dx φ ABψ dx (A φ) Bψ dx (B (A φ)) ψ dx (B A φ) ψ End (b) Show that AB [A, B]/2+{A, B}/2 where
More informationA complete criterion for convex-gaussian states detection
A complete criterion for convex-gaussian states detection Anna Vershynina Institute for Quantum Information, RWTH Aachen, Germany joint work with B. Terhal NSF/CBMS conference Quantum Spin Systems The
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationLecture If two operators A, B commute then they have same set of eigenkets.
Lecture 14 Matrix representing of Operators While representing operators in terms of matrices, we use the basis kets to compute the matrix elements of the operator as shown below < Φ 1 x Φ 1 >< Φ 1 x Φ
More informationOn some incidence structures constructed from groups and related codes
On some incidence structures constructed from groups and related codes Dean Crnković Department of Mathematics University of Rijeka Croatia Algebraic Combinatorics and Applications The first annual Kliakhandler
More informationThe Solovay-Kitaev theorem
The Solovay-Kitaev theorem Maris Ozols December 10, 009 1 Introduction There are several accounts of the Solovay-Kitaev theorem available [K97, NC00, KSV0, DN05]. I chose to base my report on [NC00], since
More informationSimple eigenvalues of graphs and digraphs
Simple eigenvalues of graphs and digraphs by Krystal Guo M.Maths., University of Waterloo, 2010 B.Maths., University of Waterloo, 2009 Dissertation Submitted in Partial Fulfillment of the Requirements
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
More informationIntroduction to Association Schemes
Introduction to Association Schemes Akihiro Munemasa Tohoku University June 5 6, 24 Algebraic Combinatorics Summer School, Sendai Assumed results (i) Vandermonde determinant: a a m =. a m a m m i
More informationDimension reduction for semidefinite programming
1 / 22 Dimension reduction for semidefinite programming Pablo A. Parrilo Laboratory for Information and Decision Systems Electrical Engineering and Computer Science Massachusetts Institute of Technology
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationQuantum Error-Correcting Codes by Concatenation
Second International Conference on Quantum Error Correction University of Southern California, Los Angeles, USA December 5 9, 2011 Quantum Error-Correcting Codes by Concatenation Markus Grassl joint work
More information1. General Vector Spaces
1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule
More information