We devise a protocol to build 1D time-dependent quantum walks in 1D maximizing the spatial spread throughout the procedure. We allow only one of the physical parameters of the coin-tossing operator to vary, i.e. the angle θ, such that for θ = 0 we have the ˆσz, while for θ = π/4 we obtain the Hadamard gate. The optimal θ sequences present non-trivial patterns, with mostly θ ≈ 0 alternated with θ ≈ π/4 values after increasingly long periods. We provide an analysis of the entanglement properties, quasi-energy spectrum and survival probability, providing a full physical picture.peer-reviewed1,34 M
We define and analyze quantum computational variants of random walks on one-dimensional lattices. I...
4 pages and 4 figuresWe generalize the quantum random walk protocol for a particle in a one-dimensio...
Random walks are a powerful tool for the efficient implementation of algorithms in clas-sical comput...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum ...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
We analyse the quantum walk in higher spatial dimensions and compare classical and quantum spreading...
A four-vertex quantum graph was analyzed with the objective of storing the highest ampli- tude of an...
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2004.Includes bibliographica...
Quantum walks and random walks bear similarities and divergences. One of the most remarkable dispari...
The nonlocalized case of the spatial density probability of the two-dimensional Grover walk can be o...
AbstractQuantum versions of random walks on the line and the cycle show a quadratic improvement over...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
International audienceA discrete-time quantum walk (QW) is essentially a unitary operator driving th...
We define and analyze quantum computational variants of random walks on one-dimensional lattices. I...
4 pages and 4 figuresWe generalize the quantum random walk protocol for a particle in a one-dimensio...
Random walks are a powerful tool for the efficient implementation of algorithms in clas-sical comput...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum versions of random walks on the line and cycle show a quadratic improvement in their spreadi...
Quantum walks, both discrete (coined) and continuous time, form the basis of several recent quantum ...
Quantum versions of random walks on the line and the cycle show a quadratic improvement over classic...
We analyse the quantum walk in higher spatial dimensions and compare classical and quantum spreading...
A four-vertex quantum graph was analyzed with the objective of storing the highest ampli- tude of an...
Thesis (S.B.)--Massachusetts Institute of Technology, Dept. of Physics, 2004.Includes bibliographica...
Quantum walks and random walks bear similarities and divergences. One of the most remarkable dispari...
The nonlocalized case of the spatial density probability of the two-dimensional Grover walk can be o...
AbstractQuantum versions of random walks on the line and the cycle show a quadratic improvement over...
The development of quantum algorithms based on quantum versions of random walks is placed in the con...
International audienceA discrete-time quantum walk (QW) is essentially a unitary operator driving th...
We define and analyze quantum computational variants of random walks on one-dimensional lattices. I...
4 pages and 4 figuresWe generalize the quantum random walk protocol for a particle in a one-dimensio...
Random walks are a powerful tool for the efficient implementation of algorithms in clas-sical comput...