Quantum walk

Quantum walks are quantum analogs of classical random walks. In contrast to the classical random walk, where the walker occupies definite states and the randomness arises due to stochastic transitions between states, in quantum walks randomness arises through (1) quantum superposition of states, (2) non-random, reversible unitary evolution and (3) collapse of the wave function due to state measurements. Quantum walks are a technique for building quantum algorithms.

As with classical random walks, quantum walks admit formulations in both discrete time and continuous time.

Motivation

Quantum walks are motivated by the widespread use of classical random walks in the design of randomized algorithms and are part of several quantum algorithms. For some oracular problems, quantum walks provide an exponential speedup over any classical algorithm.^[1]^[2] Quantum walks also give polynomial speedups over classical algorithms for many practical problems, such as the element distinctness problem,^[3] the triangle finding problem,^[4] and evaluating NAND trees.^[5] The well-known Grover search algorithm can also be viewed as a quantum walk algorithm.

Distinction from classical random walks

Quantum walks exhibit very different features from classical random walks. In particular, they do not converge to limiting distributions and due to the power of quantum interference, they may spread significantly faster or slower than their classical equivalents. There is also no randomness in quantum walks. Due to the laws of quantum mechanics, the evolution of an isolated quantum system is deterministic. This means that by using current conditions, you can exactly predict the future behaviors of the system. Randomness only occurs in quantum walks when the system is measured and classical information is gathered. Also, instead of the "coin flip" used in classical systems, quantum walks enlarge the space of the physical system to create more data.^[6]

Continuous time

Continuous-time quantum walks arise when one replaces the continuum spatial domain in the Schrödinger equation with a discrete set. That is, instead of having a quantum particle propagate in a continuum, one restricts the set of possible position states to the vertex set $V$ of some graph $G=(V,E)$ which can be either finite or countably infinite. Under particular conditions, continuous-time quantum walks can provide a model for universal quantum computation.^[7]

Relation to non-relativistic Schrödinger dynamics

Consider the dynamics of a non-relativistic, spin-less free quantum particle with mass $m$ propagating on an infinite one-dimensional spatial domain. The particle's motion is completely described by its wave function $\psi :\mathbb {R} \times \mathbb {R} _{\geq 0}\to \mathbb {C}$ which satisfies the one-dimensional, free particle Schrödinger equation

{\textbf {i}}\hbar {\frac {\partial \psi }{\partial t}}=-{\frac {\hbar ^{2}}{2m}}{\frac {\partial ^{2}\psi }{\partial x^{2}}}

where ${\textbf {i}}={\sqrt {-1}}$ and $\hbar$ is the reduced Planck constant. Now suppose that only the spatial part of the domain is discretized, $\mathbb {R}$ being replaced with $\mathbb {Z} _{\Delta x}\equiv \{\ldots ,-2\,\Delta x,-\Delta x,0,\Delta x,2\,\Delta x,\ldots \}$ where $\Delta x$ is the separation between the spatial sites the particle can occupy. The wave function becomes the map $\psi :\mathbb {Z} _{\Delta x}\times \mathbb {R} _{\geq 0}\to \mathbb {C}$ and the second spatial partial derivative becomes the discrete laplacian

{\frac {\partial ^{2}\psi }{\partial x^{2}}}\to {\frac {L_{\mathbb {Z} }\psi (j\,\Delta x,t)}{\Delta x^{2}}}\equiv {\frac {\psi \left((j+1)\,\Delta x,t\right)-2\psi \left(j\,\Delta x,t\right)+\psi \left((j-1)\,\Delta x,t\right)}{\Delta x^{2}}}

The evolution equation for a continuous time quantum walk on $\mathbb {Z} _{\Delta x}$ is thus

{\textbf {i}}{\frac {\partial \psi }{\partial t}}=-\omega _{\Delta x}L_{\mathbb {Z} }\psi

where $\omega _{\Delta x}\equiv \hbar /2m\,\Delta x^{2}$ is a characteristic frequency. This construction naturally generalizes to the case that the discretized spatial domain is an arbitrary graph $G=(V,E)$ and the discrete laplacian $L_{\mathbb {Z} }$ is replaced by the graph Laplacian $L_{G}\equiv D_{G}-A_{G}$ where $D_{G}$ and $A_{G}$ are the degree matrix and the adjacency matrix, respectively. Common choices of graphs that show up in the study of continuous time quantum walks are the d-dimensional lattices $\mathbb {Z} ^{d}$ , cycle graphs $\mathbb {Z} /N\mathbb {Z}$ , d-dimensional discrete tori $(\mathbb {Z} /N\mathbb {Z} )^{d}$ , the d-dimensional hypercube $\mathbb {Q} ^{d}$ and random graphs.

Discrete time

Discrete-time quantum walks on $\mathbb {Z}$

The evolution of a quantum walk in discrete time is specified by the product of two unitary operators: (1) a "coin flip" operator and (2) a conditional shift operator, which are applied repeatedly. The following example is instructive here.^[8] Imagine a particle with a spin-1/2-degree of freedom propagating on a linear array of discrete sites. If the number of such sites is countably infinite, we identify the state space with $\mathbb {Z}$ . The particle's state can then be described by a product state

|\Psi \rangle =|s\rangle \otimes |\psi \rangle

consisting of an internal spin state

|s\rangle \in {\mathcal {H}}_{C}=\left\{a_{\uparrow }|{\uparrow }\rangle +a_{\downarrow }|{\downarrow }\rangle :a_{\uparrow /\downarrow }\in \mathbb {C} \right\}

and a position state

|\psi \rangle \in {\mathcal {H}}_{P}=\left\{\sum _{x\in \mathbb {Z} }\alpha _{x}|x\rangle :\sum _{x\in \mathbb {Z} }|\alpha _{x}|^{2}<\infty \right\}

where ${\mathcal {H}}_{C}=\mathbb {C} ^{2}$ is the "coin space" and ${\mathcal {H}}_{P}=\ell ^{2}(\mathbb {Z} )$ is the space of physical quantum position states. The product $\otimes$ in this setting is the Kronecker (tensor) product. The conditional shift operator for the quantum walk on the line is given by

S=|{\uparrow }\rangle \langle {\uparrow }|\otimes \sum \limits _{i}|i+1\rangle \langle i|+|{\downarrow }\rangle \langle {\downarrow }|\otimes \sum \limits _{i}|i-1\rangle \langle i|,

i.e. the particle jumps right if it has spin up and left if it has spin down. Explicitly, the conditional shift operator acts on product states according to

S(|{\uparrow }\rangle \otimes |i\rangle )=|{\uparrow }\rangle \otimes |i+1\rangle

S(|{\downarrow }\rangle \otimes |i\rangle )=|{\downarrow }\rangle \otimes |i-1\rangle

If we first rotate the spin with some unitary transformation $C:{\mathcal {H}}_{C}\to {\mathcal {H}}_{C}$ and then apply $S$ , we get a non-trivial quantum motion on $\mathbb {Z}$ . A popular choice for such a transformation is the Hadamard gate $C=H$ , which, with respect to the standard z-component spin basis, has matrix representation

H={\frac {1}{\sqrt {2}}}{\begin{pmatrix}1&\;\;1\\1&-1\end{pmatrix}}

When this choice is made for the coin flip operator, the operator itself is called the "Hadamard coin" and the resulting quantum walk is called the "Hadamard walk". If the walker is initialized at the origin and in the spin-up state, a single time step of the Hadamard walk on $\mathbb {Z}$ is

|{\uparrow }\rangle \otimes |0\rangle \;\,{\overset {H}{\longrightarrow }}\;\,{\frac {1}{\sqrt {2}}}(|{\uparrow }\rangle +|{\downarrow }\rangle )\otimes |0\rangle \;\,{\overset {S}{\longrightarrow }}\;\,{\frac {1}{\sqrt {2}}}(|{\uparrow }\rangle \otimes |1\rangle +|{\downarrow }\rangle \otimes |{-1}\rangle ).

Measurement of the system's state at this point would reveal an up spin at position 1 or a down spin at position −1, both with probability 1/2. Repeating the procedure would correspond to a classical simple random walk on $\mathbb {Z}$ . In order to observe non-classical motion, no measurement is performed on the state at this point (and therefore do not force a collapse of the wave function). Instead, repeat the procedure of rotating the spin with the coin flip operator and conditionally jumping with $S$ . This way, quantum correlations are preserved and different position states can interfere with one another. This gives a drastically different probability distribution than the classical random walk (Gaussian distribution) as seen in the figure to the right. Spatially one sees that the distribution is not symmetric: even though the Hadamard coin gives both up and down spin with equal probability, the distribution tends to drift to the right when the initial spin is $|{\uparrow }\rangle$ . This asymmetry is entirely due to the fact that the Hadamard coin treats the $|{\uparrow }\rangle$ and $|{\downarrow }\rangle$ state asymmetrically. A symmetric probability distribution arises if the initial state is chosen to be

|\Psi _{0}^{\text{symm}}\rangle ={\frac {1}{\sqrt {2}}}(|{\uparrow }\rangle -{\textbf {i}}|{\downarrow }\rangle )\otimes |0\rangle

Dirac equation

Consider what happens when we discretize a massive Dirac operator over one spatial dimension. In the absence of a mass term, we have left-movers and right-movers.^{[clarification needed]} They can be characterized by an internal degree of freedom, "spin" or a "coin". When we turn on a mass term, this corresponds to a rotation in this internal "coin" space. A quantum walk corresponds to iterating the shift and coin operators repeatedly.

This is very much like Richard Feynman's model of an electron in 1 (one) spatial and 1 (one) time dimension. He summed up the zigzagging paths, with left-moving segments corresponding to one spin (or coin), and right-moving segments to the other. See Feynman checkerboard for more details.

The transition probability for a 1-dimensional quantum walk behaves like the Hermite functions which (1) asymptotically oscillate in the classically allowed region, (2) is approximated by the Airy function around the wall of the potential,^{[clarification needed]} and (3) exponentially decay in the classically hidden region.^[9]

Markov Chains

Another approach to quantizing classical random walks is through continuous-time Markov chains. Unlike the coin-based mechanism used in discrete-time random walks, Markov chains do not rely on a coin flip to determine the direction of movement.^[10] In this framework, time is treated as a continuous variable, allowing the walker to transition between adjacent vertices at any point in time. As time progresses, the probability of finding the walker at a neighboring vertex increases, while the likelihood of remaining at the current vertex decreases. The transition rate between neighboring vertices serves as the probability factor, replacing the need for a coin flip.^[11]

Quantum Walks on Infinite Graphs

Quantum walks on infinite graphs represent a distinctive area of study, characterized by the walk's unbounded spread over time.^[12] In this context, the expected distance from the origin can be quantified by the standard deviation of the probability distribution. This measurement has been explored on both one-dimensional and two-dimensional lattices, where the standard deviation grows in direct proportion to the evolution time. Classically, the standard deviation of the random walk would be proportional to the square root of the evolution time.^[11]

Realization

Atomic lattice is the leading quantum platform in terms of scalability. Coined and coinless discrete-time quantum-walk could be realized in the atomic lattice via a distance-selective spin-exchange interaction.^[13] Remarkably the platform preserves the coherence over couple of hundred sites and steps in 1, 2 or 3 dimensions in the spatial space. The long-range dipolar interaction allows designing periodic boundary conditions, facilitating the QW over topological surfaces.^[13]

References

^ A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by quantum walk, Proc. 35th ACM Symposium on Theory of Computing, pp. 59–68, 2003, arXiv:quant-ph/0209131.
^ A. M. Childs, L. J. Schulman, and U. V. Vazirani, Quantum algorithms for hidden nonlinear structures, Proc. 48th IEEE Symposium on Foundations of Computer Science, pp. 395–404, 2007, arXiv:0705.2784.
^ Andris Ambainis, Quantum walk algorithm for element distinctness, SIAM J. Comput. 37 (2007), no. 1, 210–239, arXiv:quant-ph/0311001, preliminary version in FOCS 2004.
^ F. Magniez, M. Santha, and M. Szegedy, Quantum algorithms for the triangle problem, Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1109–1117, 2005, quant-ph/0310134.
^ E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the Hamiltonian NAND tree, Theory of Computing 4 (2008), no. 1, 169–190, quant-ph/0702144
^ Kemp, J. (1 February 2008). "Quantum random walks - an introductory overview". Contemporary Physics. 44 (4): 307–327. arXiv:quant-ph/0303081. Bibcode:2003ConPh..44..307K. doi:10.1080/00107151031000110776.
^ Andrew M. Childs, "Universal Computation by Quantum Walk".
^ Kempe, Julia (1 July 2003). "Quantum random walks – an introductory overview". Contemporary Physics. 44 (4): 307–327. arXiv:quant-ph/0303081. Bibcode:2003ConPh..44..307K. doi:10.1080/00107151031000110776. ISSN 0010-7514. S2CID 17300331.
^ T. Sunada and T. Tate, Asymptotic behavior of quantum walks on the line, Journal of Functional Analysis 262 (2012) 2608–2645
^ "Markov Chains explained visually". Explained Visually. Retrieved 20 November 2024.
^ ^a ^b Portugal, R. (2018). Quantum Walks and Search Algorithms (2nd ed.). Switzerland: Springer Cham. ISBN 978-3-319-97812-3.
^ Krovi, Hari; Brun, Todd A. (27 October 2006). "Quantum walks with infinite hitting times". Physical Review A. 74 (4): 042334. arXiv:quant-ph/0606094. doi:10.1103/PhysRevA.74.042334. ISSN 1050-2947.
^ ^a ^b Khazali, Mohammadsadegh (3 March 2022). "Discrete-Time Quantum-Walk & Floquet Topological Insulators via Distance-Selective Rydberg-Interaction". Quantum. 6: 664. arXiv:2101.11412. Bibcode:2022Quant...6..664K. doi:10.22331/q-2022-03-03-664. ISSN 2521-327X. S2CID 246635019.

External links

[1] A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, Exponential algorithmic speedup by quantum walk, Proc. 35th ACM Symposium on Theory of Computing, pp. 59–68, 2003, arXiv:quant-ph/0209131.

[2] A. M. Childs, L. J. Schulman, and U. V. Vazirani, Quantum algorithms for hidden nonlinear structures, Proc. 48th IEEE Symposium on Foundations of Computer Science, pp. 395–404, 2007, arXiv:0705.2784.

[3] Andris Ambainis, Quantum walk algorithm for element distinctness, SIAM J. Comput. 37 (2007), no. 1, 210–239, arXiv:quant-ph/0311001, preliminary version in FOCS 2004.

[4] F. Magniez, M. Santha, and M. Szegedy, Quantum algorithms for the triangle problem, Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1109–1117, 2005, quant-ph/0310134.

[5] E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the Hamiltonian NAND tree, Theory of Computing 4 (2008), no. 1, 169–190, quant-ph/0702144

[6] Kemp, J. (1 February 2008). "Quantum random walks - an introductory overview". Contemporary Physics. 44 (4): 307–327. arXiv:quant-ph/0303081. Bibcode:2003ConPh..44..307K. doi:10.1080/00107151031000110776.

[7] Andrew M. Childs, "Universal Computation by Quantum Walk".

[8] Kempe, Julia (1 July 2003). "Quantum random walks – an introductory overview". Contemporary Physics. 44 (4): 307–327. arXiv:quant-ph/0303081. Bibcode:2003ConPh..44..307K. doi:10.1080/00107151031000110776. ISSN 0010-7514. S2CID 17300331.

[9] T. Sunada and T. Tate, Asymptotic behavior of quantum walks on the line, Journal of Functional Analysis 262 (2012) 2608–2645

[10] "Markov Chains explained visually". Explained Visually. Retrieved 20 November 2024.

[:1-11] Portugal, R. (2018). Quantum Walks and Search Algorithms (2nd ed.). Switzerland: Springer Cham. ISBN 978-3-319-97812-3.

[12] Krovi, Hari; Brun, Todd A. (27 October 2006). "Quantum walks with infinite hitting times". Physical Review A. 74 (4): 042334. arXiv:quant-ph/0606094. doi:10.1103/PhysRevA.74.042334. ISSN 1050-2947.

[:0-13] Khazali, Mohammadsadegh (3 March 2022). "Discrete-Time Quantum-Walk & Floquet Topological Insulators via Distance-Selective Rydberg-Interaction". Quantum. 6: 664. arXiv:2101.11412. Bibcode:2022Quant...6..664K. doi:10.22331/q-2022-03-03-664. ISSN 2521-327X. S2CID 246635019.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

Fahrer / Team für die Suche eingeben: