scholarly journals Deterministic spatial search using alternating quantum walks

2021 ◽  
Vol 104 (2) ◽  
Author(s):  
S. Marsh ◽  
J. B. Wang
Keyword(s):  
2020 ◽  
Vol 102 (3) ◽  
Author(s):  
Shantanav Chakraborty ◽  
Leonardo Novo ◽  
Jérémie Roland

Entropy ◽  
2021 ◽  
Vol 23 (11) ◽  
pp. 1441
Author(s):  
Julien Zylberman ◽  
Fabrice Debbasch

Electric Dirac quantum walks, which are a discretisation of the Dirac equation for a spinor coupled to an electric field, are revisited in order to perform spatial searches. The Coulomb electric field of a point charge is used as a non local oracle to perform a spatial search on a 2D grid of N points. As other quantum walks proposed for spatial search, these walks localise partially on the charge after a finite period of time. However, contrary to other walks, this localisation time scales as N for small values of N and tends asymptotically to a constant for larger Ns, thus offering a speed-up over conventional methods.


2018 ◽  
Vol 5 (1) ◽  
pp. 40-49 ◽  
Author(s):  
Matteo A. C. Rossi ◽  
Marco Cattaneo ◽  
Matteo G. A. Paris ◽  
Sabrina Maniscalco

Abstract Continuous-time quantum walks may be exploited to enhance spatial search, i.e., for finding a marked element in a database structured as a complex network. However, in practical implementations, the environmental noise has detrimental effects, and a question arises on whether noise engineering may be helpful in mitigating those effects on the performance of the quantum algorithm. Here we study whether time-correlated noise inducing non-Markovianity may represent a resource for quantum search. In particular, we consider quantum search on a star graph, which has been proven to be optimal in the noiseless case, and analyze the effects of independent random telegraph noise (RTN) disturbing each link of the graph. Upon exploiting an exact code for the noisy dynamics, we evaluate the quantum non-Markovianity of the evolution, and show that it cannot be considered as a resource for this algorithm, since its presence is correlated with lower probabilities of success of the search.


2015 ◽  
Vol 15 (13&14) ◽  
pp. 1233-1247
Author(s):  
Andris Ambainis ◽  
Renato Portugal ◽  
Nikolay Nahimov

We study quantum algorithms for spatial search on finite dimensional grids. Patel \textit{et al.}~and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such algorithms have been studied only using numerical simulations. In this paper, we present the first rigorous analysis for an algorithm of this type, showing that the optimal number of steps is $O(\sqrt{N\log N})$ and the success probability is $O(1/\log N)$, where $N$ is the number of vertices. This matches the performance achieved by algorithms that use other forms of quantum walks.


2019 ◽  
Vol 19 (7&8) ◽  
pp. 555-574
Author(s):  
Abhijith J. ◽  
Apoorva Patel

The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by increasing the number of calls to the walk operator that incorporates the graph structure by a logarithmic factor. Our algorithm does not require amplitude amplification. An important ingredient of our algorithm is the implementation of multi-step quantum walks by graph powering, using a coin space of walk-length dependent dimension, which may be of independent interest. Finally, we demonstrate how to implement quantum walks arising from powers of symmetric Markov chains using our methods.


2015 ◽  
Vol 5 (1) ◽  
Author(s):  
Leonardo Novo ◽  
Shantanav Chakraborty ◽  
Masoud Mohseni ◽  
Hartmut Neven ◽  
Yasser Omar

Sign in / Sign up

Export Citation Format

Share Document