Two-Dimensional Quantum Walks with Boundaries
|
|
- Claribel Henderson
- 5 years ago
- Views:
Transcription
1 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 etrópolis RJ Brazil 2 Universidade Federal do Rio de Janeiro UFRJ Caixa ostal Rio de Janeiro RJ Brazil {amanda,portugal}@lncc.br Abstract. We present here the quantum walk in two-dimensional lattices in an infinite and in a finite lattice with rectangular and diamond boundaries. These boundaries are generated by permanently breaking the links apart from the domain. We present here the probability distribution and the evolution of the standard deviation for the Hadamard, Fourier and Grover coins for many finite lattices. 1. Introduction In a seminal paper, Aharanov, Davidovich, and Zagury [Aharonov et al. 1993] introduced the discrete-time quantum walk model,which has new features when compared to the classical random walk. In special, the quantum walk spreads quadratically faster then the classical one. Many authors have used this fact to propose new quantum algorithms based on quantum walks [Farhi and Gutmann 1998, Shenvi et al. 23]. In this work we focus our attention on quantum walks in two dimensional lattices. We present the formalism for the quantum walk on an infinite line and for the quantum walk on a finite lattice with rectangular boundaries and lozenge shape boundaries. Ref.[Mackay et al. 22] was one of the first to analyze 2-D quantum walks.the authors concluded that the entanglement has a negative influence on the rate of spread. [Tregenna et al. 23] pointed out that this conclusion is not true in general, because it depends on the initial condition. They analyzed the full range of possible coin initial states of quantum walks starting at the origin and concluded that there are 1 types of non- equivalent coins. The Hadamard, Fourier, and Grover coins are of different types, the Grover coin being the one that produces the maximum spreading rate. The main goal of this work is to study the evolution of quantum walkers on lattice regions of arbitrary shape, through the procedure of permanently breaking the appropriate links in order to define its boundary. A possible application of this method is to study the transmission of quantum walkers through open billiards [Berggren et al. 22], or in a region where the corresponding classical motion would be chaotic. Other applications that could be considered are the problem of quantum percolation, and the propagation of the walkers in inhomogeneous regions, such as the interface of two regions with different conductivities. 211
2 2. Quantum walks in a two-dimensional infinite lattice A coined quantum walk on an infinite two-dimensional lattice has a Hilbert space H 4 H, where H 4 is the coin space and H is the lattice space. The coin consists of two qubits with basis { j,k,j,k {, 1}}. The links of the lattice are either in the main diagonal or in the secondary diagonal, then the basis for H is { m,n,m,n integers} such that m + n is even. The links have length 2. The generic state of the quantum walker is ψ(t) = j,k= m,n= A j,k; m,n (t) j,k m,n. (1) The evolution operator for the one step of the walk is U = S (C I), where C = j,k= j,k = C j,k; j,k j,k j,k (2) is the coin operator, I is the identity matrix, and S is the shift operator given by S j,k m,n = j,k m + ( 1) j,n + ( 1) k. (3) The walker moves along the main diagonal if the value of the coin is, or 1, 1 ; and along the secondary diagonal if the value of the coin is, 1 or 1,. Note that S does not entangle the first qubit of the coin with direction n nor the second qubit with direction m. Only the combined action of the coin and shift operators can perform such entanglement. Applying the evolution operator on state (1) we get A j,k; m,n (t + 1) = j,k = C j,k; j,k A j,k ; m ( 1) j,m ( 1) k(t). (4) The probability distribution for the walker at position m,n at time t is m,n (t) = A j,k; m,n (t) 2. (5) j,k= We have analyzed this walk with the Hadamard, Grover and Fourier coins. The initial state for each coin is the one which gives the maximum spread rate. Fig. 1 shows the probability distribution for the Hadamard coin (C = H H), where after steps, taking the initial state H = 1 2 ( ) ψ() = 1 ( i 1 )( + i 1 ),, (7) 2 which produces a symmetric walk. The Hadamard coin does not entangle the coin-qubits and the shift operator does not entangle the two directions. The result is the Hadamard walk in both directions. 212 (6)
3 Figure 1. The probability distribution of the 2-D QW after iterations using the Hadamard coin and the initial state (7) Figure 2. The probability distribution of the 2-D QW after iterations using the Fourier coin and the initial state (9). We observe that the density plot reveals details that are hardly seen in the 3-D plot. The walk is symmetric in the following sense. Take any line passing through the origin, the distributions are the same in both directions. This is equivalent to saying that the plot is invariant under a rotation of π. The initials states (7), (9), and (11), were chosen to guarantee a maximum of spreading when the walk starts at the origin [Tregenna et al. 23]. This situation is the most interesting in decoherence analysis. Fig. 2 shows the probability distribution for the Fourier coin F 4 = i 1 i i 1 i, (8) after steps, taking the initial state ψ() = 1 2 ( + 1 i i ) 11,. (9)
4 Figure 3. The probability distribution of the 2-D QW after iterations using the Grover coin and the initial state (11). In Fig. 3 we show the probability distribution for the Grover coin G = , (1) after steps, taking the initial state ψ() = 1 ( 1 )( 1 ),. (11) 2 The density plot shows remarkable properties of the Grover coin with the initial state (11). The walk is highly symmetric, since it is apparently invariant under a rotation of π/2. The walk is delocalized having a central region of about 1/3 of the reachable radius with almost zero probability distribution. In the infinite 2-D lattice the standard deviation for the Hadamard coin is the same for all choices of initial state that produces a symmetric distribution, even maximally mixed, and is 2 larger than the standard deviation for the walk on the line which is linear in the number of steps. However with the appropriated initial conditions both the Fourier and Grover coins have larger spreading rate than the Hadamard coin.even so the most differences between these three coins are not in the degree of spread, but in the extent to which this can be varied simply trough varying the initial coin state [Tregenna et al. 23] leading to many other applications than the Hadamard walk. 3. Quantum walks in a two-dimensional finite lattice Now we restrict the walk to a finite portion of the lattice. Let us analyze the evolution of the quantum walker considering explicitly the four links of each position m,n, as in fig. 4, so eq.(4) must be generalized yielding A 1 j,1 k; m,n (t + 1) = C j+link1 (j,k; m,n),k+link 2 (j,k; m,n); j,k j, k = A j,k ;m+link 1 (j,k; m,n),n+link 2 (j,k; m,n) (12) 214
5 m 1,n + 1 m 1,n 1 link 1,2 (1,;m,n) link 1,2 (1,1;m,n) m,n link 1,2 (,;m,n) link 1,2 (,1;m,n) m + 1,n + 1 m + 1,n 1 Figure 4. The four links at site m,n where link 1 (j,k; m,n) = { ( 1) j, if link to site m + ( 1) j,n + ( 1) k is closed,, if link is open, (13) link 2 (j,k; m,n) = { ( 1) k, if link to site m + ( 1) j,n + ( 1) k is closed,, if link is open, (14) and j,k 1. We easily see that eq.(12) reduces to eq.(4) if there are no broken ( links. When implementing this equation, one must impose that link 1 1 j, 1 k; m + ( 1) j,n + ( 1) k) = if link 1 (j,k; m,n) =, and similarly with link 1. The evolution equation for quantum walks in n-dimensional lattices is a generalization of Eqs. (12), (13), and (14). In this case one needs to use n link functions defined analogously to Eqs. (13) and (14). Eq. (12) must be modified accordingly, adding each link function to its corresponding index. With these equations in hand, it is possible not only to analyze broken-link-type decoherences in n-dimensional lattices, but also to analyze the decoherence-free walks in lattices with reflecting boundary conditions. In fact, one can choose a variety of lattice topologies by permanently breaking the relevant links. So, here we definitely break the appropriated links according to the size of the square. When the particle reaches some broken link to its neighbor site it is forced to remain at that site and the walk starts to be different from the infinite lattice. This is an unitary process and we do not make measurements, so the particle is just prohibited to advance, then it is reflected. A coined quantum walk on a finite two-dimensional square lattice has a Hilbert space H 4 H s, where H 4 is the coin space and H s is the lattice space. Thus the particle is confined to a square lattice whose positions are { m,n,m,n { M,M}} such that m + n is even. We analyze numerically the boundaries effects in the 2-D walk for the Hadamard, Fourier and Grover coins for some square s sizes. Fig.5 shows the evolution of the standard deviation of the Hadamard walk for many values of M. The standard deviation is linear in the number of steps until the walk encounters some boundary, At this time the standard deviation is maximum. Then the particle is reflected and the standard deviation decreases until the walk returns to the origin at this moment σ has a local minimum, so 215
6 9 M=1 M=2 M=4 M= σ Figure 5. Evolution of the standard deviation of the Hadamard walk with square lattice for an initial state (7), in the cases M = 1, M = 2, M = 4, and M =. t Figure 6. The probability distribution of the 2-D QW after iterations using the Grover coin, initial state (11) and square boundaries at M =. the walk spreads again but with another initial state and this process continues indefinitely. In fig.6 we show the probability distribution for the Grover walk after steps, the walk starts to be reflected by the boundaries, in fig. 7 we show the probability after 14 steps, at this time the walk is almost totally reflected and in fig. 8 the standard deviation is minimum and the particle can be found near the origin. In all the moments the probability distribution assumes a very intrincated pattern which is the signature of the quantum world. We observe some different results in the case of finite lattices when compared to infinite lattices. While in the infinite lattice the standard deviation of the Hadamard, Fourier and Grover walks are different when the walker starts at the origin with initial states (7), (9), and (11), respectively, which gives the maximum spreading rates for each case. We still have, in all cases, σ = αt with σ H =.77,σ F =., and σ G =
7 Figure 7. The probability distribution of the 2-D QW after 14 iterations using the Grover coin, initial state (11) and square boundaries at M = Figure 8. The probability distribution of the 2-D QW after 1 iterations using the Grover coin, initial state (11) and square boundaries at M =. [Oliveira et al. 26], respectively with the Grover walk leading to the largest diffusion rate among all the coins considered [Tregenna et al. 23]. In the finite square lattices we observe that all the coins have an oscillatory behavior, besides that the Hadamard walk leads to the largest diffusion rate. Showing that the coins have different sensitivity to boundaries. Now the quantum walk has a finite two-dimensional diamond lattice with a Hilbert space H 4 H s, where H 4 is the coin space and H s is the lattice space. Thus the particle is confined to a diamond lattice whose vertices are { M,, M,,,M,, M } such that M is integer. In fig. 9 we show the evolution of the standard deviation for the Fourier walk in a diamond lattice. In the diamond lattice the Grover and Fourier walks have the greatest spreading rates while the Hadamard walk looses much acessible space thus its standard deviation decreases. As in the square lattices we observe that the standard deviation oscillates reaching the maximum value when the walk beats the boundaries and the minimum when the walk passes towards the origin. 4. Conclusions We have analyzed the the 2-D quantum walks in the infinite and finite lattices. We have used the Hadamard, Fourier and Grover coins, taking as initial condition the one 217
8 6 M=1 M=2 M=4 M= 5 4 σ Figure 9. Evolution of the standard deviation of the Fourier walk with diamond lattice for an initial state (9), in the cases M = 1, M = 2, M = 4, and M =. t that leads to a maximum rate of spread. We observed that the particle is reflected when it reaches some boundary and the walk presents an oscillatory behavior. We have obtained until now only the standard deviation of the walks, in order to comprehend fully the behavior of the quantum walk in finite lattices we will still study the mixing times and the average standard deviation of these walks. References Aharonov, Y., Davidovich, L., and Zagury, N. (1993). Quantum random walks. hys. Rev. A, 48(2): Berggren, K., A.F.Sadreev, and Starikov, A. A. (22). Crossover from regular to irregular behavior in current flow through open billiards. hysical Review E, 66: Farhi, E. and Gutmann, S. (1998). Quantum computation and decision trees. hys. Rev. A, 58: Mackay, T. D., Bartlett, S. D., Stephenson, L. T., and Sanders, B. C. (22). Quantum walks in higher dimensions. J. hys. A, 35:2745. Oliveira, A. C., ortugal, R., and Donangelo, R. (26). Decoherence in 2-d quantum walks. hysical Review A, 74: Shenvi, N., Kempe, J., and Whaley, K. (23). A quantum random walk search algorithm. hys. Rev. A, 67(5):5237. lanl-arxive quant-ph/264. Tregenna, B., Flanagan, W., Maile, R., and Kendon, V. (23). Controlling discrete quantum walks: coins and intitial states. New J. hys., 5:83. lanl-arxive quant-ph/
Decoherence on Szegedy s Quantum Walk
Decoherence on Szegedy s Quantum Walk Raqueline A. M. Santos, Renato Portugal. Laboratório Nacional de Computação Científica (LNCC) Av. Getúlio Vargas 333, 25651-075, Petrópolis, RJ, Brazil E-mail: raqueline@lncc.br,
More informationarxiv: v1 [quant-ph] 10 Sep 2012
Quantum Walks on Sierpinski Gaskets arxiv:1209.2095v1 [quant-ph] 10 Sep 2012 Pedro Carlos S. Lara, Renato Portugal, and Stefan Boettcher May 2, 2014 Abstract We analyze discrete-time quantum walks on Sierpinski
More informationLong-time Entanglement in the Quantum Walk
WECIQ 6 - Artigos Long-time Entanglement in the Quantum Walk Gonzalo Abal 1, Raul Donangelo, Hugo Fort 3 1 Instituto de Física, Facultad de Ingeniería, Universidad de la República, C.C. 3, C.P. 11, Montevideo,
More informationarxiv: v1 [quant-ph] 24 Mar 2008
The QWalk Simulator of Quantum Walks F.L. Marquezino a,1, R. Portugal a, arxiv:83.3459v1 [quant-ph] 24 Mar 28 Abstract a LNCC, Laboratório Nacional de Computação Científica Av. Getúlio Vargas 333, CEP
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 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 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 informationImplementing the quantum random walk
PHYSICAL REVIEW A, VOLUME 5, Implementing the quantum random walk B. C. Travaglione* and G. J. Milburn Centre for Quantum Computer Technology, University of Queensland, St. Lucia, Queensland, Australia
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 informationNon-unitary quantum walks:
Non-unitary quantum walks: exploring the space between classical and quantum computing Viv Kendon Review article on decoherence in quantum walks quant-ph/0606016 Quantum Information School of Physics &
More informationarxiv: v3 [quant-ph] 29 Oct 2009
Efficient quantum circuit implementation of quantum walks B L Douglas and J B Wang School of Physics, The University of Western Australia, 6009, Perth, Australia arxiv:07060304v3 [quant-ph] 29 Oct 2009
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 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 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 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 informationQuantum walk on a line with two entangled particles
Quantum walk on a line with two entangled particles Y. Omar SQIG, Instituto de Telecomunicações and CEMAPRE, ISEG, Universidade Técnica de Lisboa, P-1200-781 Lisbon, Portugal. Paunković SQIG, Instituto
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 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 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 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 informationarxiv: v1 [quant-ph] 1 Mar 2011
Quantum walk with a four dimensional coin Craig S. Hamilton 1, Aurél Gábris 1, Igor Jex 1 and Stephen M. Barnett 1, 1 Department of Physics Faculty of Nuclear Sciences and Physical Engineering, Czech Technical
More informationarxiv: v1 [quant-ph] 11 Oct 2017
Playing a true Parrondo s game with a three state coin on a quantum walk Jishnu Rajendran and Colin Benjamin School of Physical Sciences, National Institute of Science Education & Research, HBNI, Jatni-752050,
More informationImplementing Quantum walks
Implementing Quantum walks P. Xue, B. C. Sanders, A. Blais, K. Lalumière, D. Leibfried IQIS, University of Calgary University of Sherbrooke NIST, Boulder 1 Reminder: quantum walk Quantum walk (discrete)
More informationarxiv: v1 [quant-ph] 15 Nov 2018
Lackadaisical quantum walk for spatial search Pulak Ranjan Giri International Institute of Physics, Universidade Federal do Rio Grande do orte, Campus Universitario, Lagoa ova, atal-r 59078-970, Brazil
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 informationarxiv:quant-ph/ v2 14 Jul 2005
Entanglement in coined quantum walks on regular graphs arxiv:quant-ph/5442 v2 4 Jul 25 Ivens Carneiro, Meng Loo, Xibai Xu, Mathieu Girerd, 2, Viv Kendon,, and Peter L. Knight QOLS, Blackett Laboratory,
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 informationQuantum walks on circles in phase space via superconducting circuit quantum electrodynamics
Quantum walks on circles in phase space via superconducting circuit quantum electrodynamics Peng Xue, 1 Barry C. Sanders, 1 Alexandre Blais, 2 and Kevin Lalumière 2 1 Institute for Quantum Information
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 informationPseudo Memory Effects, Majorization and Entropy in Quantum Random Walks
Pseudo Memory Effects, Majorization and Entropy in uantum Random Wals arxiv:quant-ph/0402187v1 25 Feb 2004 Anthony J. Bracen, Demosthenes Ellinas and Ioannis Tsohanjis University of ueensland, entre for
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 informationDiscrete Single-Photon Quantum Walks with Tunable Decoherence
Discrete Single-Photon Quantum Walks with Tunable Decoherence The Harvard community has made this article openly available. Please share how this access benefits you. Your story matters. Citation Published
More informationarxiv: v1 [quant-ph] 14 May 2007
The meeting problem in the quantum random walk arxiv:75.1985v1 [quant-ph] 14 May 7 M. Štefaňák (1), T. Kiss (), I. Jex (1) and B. Mohring (3) (1) Department of Physics, FJFI ČVUT, Břehová 7, 115 19 Praha
More informationarxiv: v2 [quant-ph] 7 Jun 2018
epl draft Playing a true Parrondo s game with a three state coin on a quantum walk Jishnu Rajendran and Colin Benjamin School of Physical Sciences National Institute of Science Education & Research HBNI
More informationarxiv:quant-ph/ v3 26 Nov 2006
Under consideration for publication in Math. Struct. in Comp. Science Decoherence in quantum walks - a review arxiv:quant-ph/0606016v3 26 Nov 2006 VIV KENDON School of Physics and Astronomy, University
More informationarxiv:quant-ph/ v1 16 Jan 2003
Grover s Algorithm: Quantum Database Search arxiv:quant-ph/3179v1 16 Jan 3 C. Lavor Instituto de Matemática e Estatística Universidade do Estado do Rio de Janeiro - UERJ Rua São Francisco Xavier, 54, 6
More informationarxiv:quant-ph/ v5 9 Oct 2008
Quantum walk on the line: entanglement and non-local initial conditions G. Abal, R. Siri, A. Romanelli, and R. Donangelo Instituto de Física, Universidad de la República C.C. 30, C.P. 11000, Montevideo,
More informationOptical cavity implementations of the quantum walk
Optics Communications 227 (2003) 147 157 www.elsevier.com/locate/optcom Optical cavity implementations of the quantum walk Peter L. Knight, Eugenio Roldan *, J.E. Sipe 1 Optics Section, Blackett Laboratory,
More informationQuantum random walks with history dependence
Quantum random walks with history dependence A P Flitney, D Abbott and N F Johnson Centre for Biomedical Engineering (CBME) and Department of Electrical and Electronic Engineering, The University of Adelaide,
More informationRenormalization Group for Quantum Walks
Renormalization Group for Quantum Walks CompPhys13 Stefan Falkner, Stefan Boettcher and Renato Portugal Physics Department Emory University November 29, 2013 arxiv:1311.3369 Funding: NSF-DMR Grant #1207431
More informationEnergy Level Sets for the Morse Potential
Energy Level Sets for the Morse Potential Fariel Shafee Department of Physics Princeton University Princeton, NJ 08540 Abstract: In continuation of our previous work investigating the possibility of the
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More informationarxiv: v2 [quant-ph] 21 Dec 2016
The Lackadaisical Quantum Walker is NOT Lazy at all arxiv:6203370v2 [quant-ph] 2 Dec 206 Kun Wang, Nan Wu,, Ping Xu, 2 and Fangmin Song State Key Laboratory for Novel Software Technology, Department of
More informationIntoduction to topological order and topologial quantum computation. Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009
Intoduction to topological order and topologial quantum computation Arnau Riera, Grup QIC, Dept. ECM, UB 16 de maig de 2009 Outline 1. Introduction: phase transitions and order. 2. The Landau symmetry
More informationEqual Superposition Transformations and Quantum Random Walks
Equal Superposition Transformations and Quantum Random Walks arxiv:0709.3406v1 [quant-ph] 1 Sep 007 Preeti Parashar Physics and Applied Mathematics Unit Indian Statistical Institute 03 B T Road, Kolkata
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 informationarxiv:quant-ph/ v1 8 Mar 2004
arxiv:quant-ph/4366v1 8 Mar 24 Quantum walks on graphs and quantum scattering theory Edgar Feldman and Mark Hillery Abstract. A number of classical algorithms are based on random walks on graphs. It is
More informationClassically efficient graph isomorphism algorithm using quantum walks. Abstract
Classically efficient graph isomorphism algorithm using quantum walks Brendan L Douglas and Jingbo B Wang School of Physics, The University of Western Australia, 6009, Perth, Australia. Abstract Given
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 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 informationNoisy quantum Parrondo games
Noisy quantum Parrondo games David A. Meyer* Project in Geometry and Physics, Department of Mathematics University of California/San Diego, La Jolla, CA 9093-011 ABSTRACT Alternating two fair coin flipping
More informationarxiv: v2 [quant-ph] 12 Mar 2018
A new time-series model based on quantum walk Norio Konno Department of Applied Mathematics, Faculty of Engineering, Yokohama National University Hodogaya, Yokohama 40-850, Japan arxiv:80.04805v [quant-ph]
More informationarxiv: v2 [quant-ph] 18 Apr 2008
Continuous-time quantum walks on one-dimension regular networks Xin-Ping Xu 1,2 1 Institute of Particle Physics, HuaZhong Normal University, Wuhan 430079, China 2 Institute of High Energy Physics, Chinese
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 informationarxiv: v2 [quant-ph] 6 Feb 2018
Quantum Inf Process manuscript No. (will be inserted by the editor) Faster Search by Lackadaisical Quantum Walk Thomas G. Wong Received: date / Accepted: date arxiv:706.06939v2 [quant-ph] 6 Feb 208 Abstract
More informationQuantum Channels as Quantum Games
WECIQ 2006 - Artigos Quantum Channels as Quantum Games Jean Faber 1, Renato Portugal 2 and Luiz Pinguelli Rosa 1 1 Universidade Federal do Rio de Janeiro, COPPE/IF-UFRJ; Caixa Postal 68565 - CEP 21945970
More informationControlled Alternate Quantum Walks based Quantum Hash Function
www.nature.com/scientificreports Received: 3 August 7 Accepted: 3 December 7 Published: xx xx xxxx OPEN Controlled Alternate Quantum Walks based Quantum Hash Function Dan Li, Yu-Guang Yang, Jing-Lin Bi,
More informationarxiv: v2 [quant-ph] 16 Nov 2018
aaacxicdvhlsgmxfe3hv62vvswncwelkrmikdlgi7cqc1yfwyro+mthmasibkjlgg+wk3u/s2/wn8wfsxs1qsjh3nuosckjhcuhb8fry5+yxfpejyawv1bx2jxnm8tto1hftcs23ui7aohciwcjnxieojjf/xphvrdcxortlqhqykdgj6u6ako5kjmwo5gtsc0fi/qtgbvtaxmolcnxuap7gqihlspyhdblqgbicil5q1atid3qkfhfqqo+1ki6e5f+cyrt/txh1f/oj9+skd2npbhlnngojzmpd8k9tyjdw0kykioniem9jfmxflvtjmjlaseio9n9llpk/ahkfldycthdga3aj3t58/gwfolthsqx2olgidl87cdyigsjusbud182x0/7nbjs9utoacgfz/g1uj2phuaubx9u6fyy7kljdts8owchowj1dsarmc6qvbi39l78ta8bw9nvoovjv1tsanx9rbsmy8zw==
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 informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More informationTransport Properties of Quantum Walks, Deterministic and Random
Transport Properties of Quantum Walks, Deterministic and Random Alain JOYE i f INSTITUT FOURIER AQOS, Autrans, 8-19/7/2013 p.1/29 Unitary Quantum Walks Interdisciplinary Concept Quantum from Quantum Physics
More informationarxiv: v1 [quant-ph] 12 Mar 2019
Quantum Walk and Quantum Billiards. Towards a better understanding of Quantum Chaos César Alonso-Lobo and Manuel Martínez-Quesada Departamento de Óptica, Optometría y Ciencias de la Visión, Universidad
More informationContinuous Time Quantum Walk on finite dimensions. Shanshan Li Joint work with Stefan Boettcher Emory University QMath13, 10/11/2016
Continuous Time Quantum Walk on finite dimensions Shanshan Li Joint work with Stefan Boettcher Emory University QMath3, 0//206 Grover Algorithm: Unstructured Search! #$%&' Oracle $()*%$ f(x) f (x) = (
More informationQuantum walks: Definition and applications
Quantum walks: Definition and applications 尚云 2017 年 5 月 5 日 ( 量子计算与密码分析讨论班 ) Talk structure Introduction to quantum walks Defining a quantum walk...on the line...on the graphs Applications of quantum
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 informationQuantum Stochastic Walks: A Generalization of Classical Random Walks and Quantum Walks
Quantum Stochastic Walks: A Generalization of Classical Ranom Walks an Quantum Walks The Harvar community has mae this article openly available. Please share how this access benefits you. Your story matters
More informationarxiv: v1 [quant-ph] 11 Nov 2018
Hitting time for quantum walks of identical particles Alexey A. Melnikov a,b, Aleksandr P. Alodjants b, and Leonid E. Fedichkin a,c,d arxiv:1814482v1 [quant-ph] 11 Nov 2018 a Institute of Physics and Technology,
More informationReversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016
Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
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 informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More informationQuantum Information Processing with Liquid-State NMR
Quantum Information Processing with Liquid-State NMR Pranjal Vachaspati, Sabrina Pasterski MIT Department of Physics (Dated: May 8, 23) We demonstrate the use of a Bruker Avance 2 NMR Spectrometer for
More informationPh 219b/CS 219b. Exercises Due: Wednesday 20 November 2013
1 h 219b/CS 219b Exercises Due: Wednesday 20 November 2013 3.1 Universal quantum gates I In this exercise and the two that follow, we will establish that several simple sets of gates are universal for
More informationLogic gates. Quantum logic gates. α β 0 1 X = 1 0. Quantum NOT gate (X gate) Classical NOT gate NOT A. Matrix form representation
Quantum logic gates Logic gates Classical NOT gate Quantum NOT gate (X gate) A NOT A α 0 + β 1 X α 1 + β 0 A N O T A 0 1 1 0 Matrix form representation 0 1 X = 1 0 The only non-trivial single bit gate
More informationarxiv:quant-ph/ v1 21 Nov 2003
Analytic solutions for quantum logic gates and modeling pulse errors in a quantum computer with a Heisenberg interaction G.P. Berman 1, D.I. Kamenev 1, and V.I. Tsifrinovich 2 1 Theoretical Division and
More informationarxiv: v1 [quant-ph] 19 Jan 2019
The quantum algorithm for graph isomorphism problem Xi Li School of Cyber Science and Engineering, Southeast University, Nanjing 296, China Hanwu Chen School of Computer Science and Engineering, Southeast
More informationLecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II
Lecture 8 Nature of ensemble: Role of symmetry, interactions and other system conditions: Part II We continue our discussion of symmetries and their role in matrix representation in this lecture. An example
More informationarxiv:quant-ph/ v1 13 Mar 2003
Quantum random walks - an introductory overview J. Kempe CNRS-LRI, UMR 63, Université de Paris-Sud, 905 Orsay, France Computer Science Division and Department of Chemistry, University of California, Berkeley
More informationarxiv:quant-ph/ v1 29 Mar 2003
Finite-Dimensional PT -Symmetric Hamiltonians arxiv:quant-ph/0303174v1 29 Mar 2003 Carl M. Bender, Peter N. Meisinger, and Qinghai Wang Department of Physics, Washington University, St. Louis, MO 63130,
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationWhat is possible to do with noisy quantum computers?
What is possible to do with noisy quantum computers? Decoherence, inaccuracy and errors in Quantum Information Processing Sara Felloni and Giuliano Strini sara.felloni@disco.unimib.it Dipartimento di Informatica
More informationarxiv: v2 [quant-ph] 26 Mar 2019
Interference-induced localization in quantum random walk on clean cyclic graph Jayanth Jayakumar, Sreetama Das, Aditi Sen(De), and Ujjwal Sen Harish-Chandra Research Institute, HBNI, Chhatnag Road, Jhunsi,
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 informationQuantum formalism for classical statistics
Quantum formalism for classical statistics C. Wetterich c.wetterich@thphys.uni-heidelberg.de Universität Heidelberg, Institut für Theoretische Physik, Philosophenweg 16, D-69120 Heidelberg arxiv:1706.01772v3
More informationQuantum Computing with NMR: Deutsch-Josza and Grover Algorithms
Quantum Computing with NMR: Deutsch-Josza and Grover Algorithms Charles S. Epstein and Ariana J. Mann MIT Department of Physics (Dated: March 4, ) A Bruker Avance NMR Spectrometer was used to perform simple
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 informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationThe Quantum Heisenberg Ferromagnet
The Quantum Heisenberg Ferromagnet Soon after Schrödinger discovered the wave equation of quantum mechanics, Heisenberg and Dirac developed the first successful quantum theory of ferromagnetism W. Heisenberg,
More informationQuantum Random Walk: Naive Approach
Quantum Random Walk: Naive Approach by José Luis Gómez-Muñoz http://homepage.cem.itesm.mx/lgomez/quantum/ jose.luis.gomez@itesm.mx Introduction The quantum random walker (Y. Aharonov, L. Davidovich, and
More informationarxiv: v3 [quant-ph] 17 Sep 2017
Quantum Error Correction using Hypergraph States Shashanka Balakuntala and Goutam Paul # Department of Applied Mathematics and Computational Sciences, PSG College of Technology, Coimbatore 641 004, India,
More informationQuantum random walks in one dimension via generating functions
Discrete Mathematics and Theoretical Computer Science (subm, by the authors, 1 rev Quantum random walks in one dimension via generating functions Andrew Bressler and Robin Pemantle University of Pennsylvania,
More informationGraphs in Quantum Information Theory
Graphs in Quantum Information Theory David Feder, University of Calgary 1 Introduction The fascinating properties of graphs have been studied since ancient times. Modern graph theory originated fairly
More informationIBM Systems for Cognitive Solutions
IBM Q Quantum Computing IBM Systems for Cognitive Solutions Ehningen 12 th of July 2017 Albert Frisch, PhD - albert.frisch@de.ibm.com 2017 IBM 1 st wave of Quantum Revolution lasers atomic clocks GPS sensors
More informationarxiv: v4 [quant-ph] 25 Sep 2017
Grover Search with Lackadaisical Quantum Walks Thomas G Wong Faculty of Computing, University of Latvia, Raiņa ulv. 9, Rīga, LV-586, Latvia E-mail: twong@lu.lv arxiv:50.04567v4 [quant-ph] 5 Sep 07. Introduction
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 informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationarxiv:quant-ph/ v4 12 Sep 2006
Implementing the one-dimensional quantum (Hadamard) walk using a Bose-Einstein condensate C. M. Chandrashekar Atomic and Laser Physics, University of Oxford, Oxford OX1 3PU, United Kingdom arxiv:quant-ph/0603156v4
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 informationGeneralized Manna Sandpile Model with Height Restrictions
75 Brazilian Journal of Physics, vol. 36, no. 3A, September, 26 Generalized Manna Sandpile Model with Height Restrictions Wellington Gomes Dantas and Jürgen F. Stilck Instituto de Física, Universidade
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More information