scholarly journals Optimality of spatial search via continuous-time quantum walks

2020 ◽  
Vol 102 (3) ◽  
Author(s):  
Shantanav Chakraborty ◽  
Leonardo Novo ◽  
Jérémie Roland
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.


Entropy ◽  
2018 ◽  
Vol 20 (8) ◽  
pp. 586 ◽  
Author(s):  
Xin Wang ◽  
Yi Zhang ◽  
Kai Lu ◽  
Xiaoping Wang ◽  
Kai Liu

The isomorphism problem involves judging whether two graphs are topologically the same and producing structure-preserving isomorphism mapping. It is widely used in various areas. Diverse algorithms have been proposed to solve this problem in polynomial time, with the help of quantum walks. Some of these algorithms, however, fail to find the isomorphism mapping. Moreover, most algorithms have very limited performance on regular graphs which are generally difficult to deal with due to their symmetry. We propose IsoMarking to discover an isomorphism mapping effectively, based on the quantum walk which is sensitive to topological structures. Firstly, IsoMarking marks vertices so that it can reduce the harmful influence of symmetry. Secondly, IsoMarking can ascertain whether the current candidate bijection is consistent with existing bijections and eventually obtains qualified mapping. Thirdly, our experiments on 1585 pairs of graphs demonstrate that our algorithm performs significantly better on both ordinary graphs and regular graphs.


2017 ◽  
Vol 96 (4) ◽  
Author(s):  
Matteo A. C. Rossi ◽  
Claudia Benedetti ◽  
Massimo Borrelli ◽  
Sabrina Maniscalco ◽  
Matteo G. A. Paris

2014 ◽  
Vol 90 (3) ◽  
Author(s):  
Zoltán Darázs ◽  
Anastasiia Anishchenko ◽  
Tamás Kiss ◽  
Alexander Blumen ◽  
Oliver Mülken

Sign in / Sign up

Export Citation Format

Share Document