I Dirac quantum walks
We consider QW both over the square and the triangular grid, i.e. a grid formed by tiling the plane regularly with equilateral triangles. Consider the line segments along which the facets of the squares (or triangles) are glued, and place a point in the middle. The walker lives on those points. For the square grid we may label these points by their positions in , for the triangular grid this would be a subset of
. The walker’s ‘coin’ or ‘spin’ degree of freedom lies in
, for which we may chose some orthonormal basis . The overall state of the walker lies in the composite Hilbert space and may be thus be written , where the scalar field (resp. ) gives, at position , the amplitude of the particle being there and about to move backward (resp. forward) along a certain direction . We use , to label respectively instants and points in space and let the evolution operator be, in natural units:(1) 
with the set of coinstatedependent discrete translation operators , each along directions , defined as:
(2) 
and . The QW we consider in this paper are Dirac QW, meaning that
(3) 
as we neglect the second order terms in , and with the Dirac Hamiltonian in some wellchosen representation and in units, e.g. .
Square grid.
Let us consider the unit vectors along the
–axis and –axis, namely and use them to specify the directions of the translations and . Eq. (3) then reads:(4) 
where with and a is real constant, namely the mass. In the formal limit for , the Eq. 4 recovers the Dirac Hamiltonian in –spacetime. Iterates of the walk converge towards solutions of the Dirac Eq., as was proven in full rigour in arrighi2014dirac .
Triangular lattice.
For the triangular lattice let us consider the unit vectors , as in Fig. 1 and defined by
(5) 
and use them to specify the directions of the translations . Eq. (3) then reads:
(6) 
with the coin operator. In arrighi_dirac_2018 it has been proved in detail by some of the authors how this particular choice also leads, in the continuum limit, to the Dirac Hamiltonian in –spacetime.
Defects.
A sector of a crystallographic lattice may be inaccessible, e.g. due to surface defects such as the vacancy of an atom (e.g. Schottky point defect) and others. These affect the physical and chemical properties of the material, including electrical resistivity or conductivity. In fact all real solids are impure with about one impurity per atoms ibach1995solid . Here we model these defects in the simplest possible way: locally, a small number of squares or triangles are missing—thereby breaking the translation invariance of the lattice. In other words, the walker is forbidden access to a ball of unit radius, as in Fig. 2. This is done by reflecting those signals that reach the boundary of the ball, simply by letting on the facets around .
Edge states.
In both of these Dirac QW, one may notice that wherever we replace the coin by identity, the walks reduce to just anticlockwise rotation, see Fig. 1. Still, the operators 4 and 6 have different topological properties around . The square lattice walk has vanishing Chern number and trivial topological properties kitagawa2012topological , whereas the triangular walk has topologically nontrivial and Chern number equal to one kitagawa2010exploring . In the triangular case the positive and negative component decouple respectively in the grey and the white triangles, and may be thought of as inducing polarized local topological currents of spin, called edge states verga2017edge . According to verga2017edge , this phenomenon will be observed whenever initial states have an overlap with , elsewhere the walker does not localize and explores the lattice with ballistic speed. Thus, we expect these topological effects to play a role in the triangular case only.
Our conjecture is that, starting from a uniformly superposed wavefunction, the walker will, in finite time, localise around the hole defect in steps, with probability in , with the total number of squares/triangles. In the following we discuss the numerical evidence we have for such a conjecture.
Ii Grover search
Our numerical simulations over the square and triangular grids are exctly in line with a series of results childs2004spatial ; childs2004spatial ; aaronson2003quantum ; tulsi2008faster showing that spatial search can be performed in steps with a probability of success in . With repetitions of the experiment one makes the success probability an , yielding an overall complexity of . Making use of quantum amplitude amplification brassard2002quantum , however, one just needs repetitions of the experiment in order to make the probability an , yielding an overall complexity of . This bound is unlikely to be improved, given the strong arguments given by magniez2012hitting . In particular santha2008quantum ; patel2010search explain why the extra , with respect to Grover’s original algorithm, is unlikely to be removed.
These work were not using Dirac QW, nor defects. Our aim here is demonstrate that QW which recover the Dirac equation, also perform a Grover search, as they propagate over the discrete surface and localise around its defects. More concretely we proceed as follows: (i) Prepare, as the initial state the wavefunction which is uniformly superposed ever every square or triangle, and whose coin degree of freedom is also the uniformly superposed . Notice that amplitude inside the hole defect is zero; (ii) Let the walker evolve with time; (iii) Quantify the number of steps before the walker reaches its peak probability of being localized in a ball of radius
around the center of the hole defect, and estimate this probability; (iv) Characterize
and , i.e. the way the peak recurrence time and the peak probability depend upon the total number of squares/triangles .Indeed the probability of being found around the hole defect has a periodic behavior, see in Fig. 3: for instance over a square lattice of sites, for , the peak recurrence time is , and the maximum probability is . The dependencies in
were interpolated from the data set shown Fig.
4, we observe that and , with a prefactor depending upon . Clearly, repeating the experiment an number of times will make the probability of finding the hole defect as close to as desired, leading to an overall time complexity in . Again we could, instead, propose to use quantum amplitude amplification brassard2002quantum in order to bring the needed number of repetitions down an , leading to an overall time complexity in . But it seems that this would defeat the purpose of this paper to some extent: since our aim is to show that there is a ‘natural implementation’ of the Grover search, we must not rely on higherlevel routines such as quantum amplitude amplification.Over the triangular grid the situation is slightly more intricate, as two phenomena seem to coexist.
On the one hand, the Grover search is again at play. Indeed the data set of Fig. 5, confirms the results obtained over the square grid: the peak recurrence time is again , and its corresponding peak probability is again for large , although this time with a prefactor that depends upon the mass. Again this leads to an overall complexity of , or using amplitude amplification.
On the other hand, a topological effect is at play. Indeed, an edge state rapidly appears, on the boundary of the hole defect. This first peak’s probability also seems to scale as , but with an occurrence time which is constant in whenever . At first this seems extremely promising, suggesting that the hole defect may be found in , breaking Grover’s optimality bound. On second thoughts one realizes that this is overoptimistic, and that this scaling cannot hold for large . Indeed, if the first peak’s occurrence time is constant, then its amplitude can only ever be drawn from the adjacent sites, each of which started with probability . Summing them all yields . Thus is, in the long run an : the first peak brings no complexity advantage. By augmenting the mass as a function of , one can augment and escape this upper bound, but then needs again be an . Still, at the technical level it may be advantageous, for instance, to tune the mass so that equals and have both the Grover search effect and the topological effect interfere constructively.
Iii Conclusion
It is now common knowledge that Quantum Walks (QW) implement the Grover search, and that some QW mimic the free propagation of the electron. Yet, could this mean that free electrons naturally implement the Grover search? Answering this question positively may be the path to a serious technological leap, whereby experimentalist would bypass the need for a fullfledged scalable and errorcorrecting Quantum Computer, and take the shortcut of looking for ‘natural occurrences’ of the Grover search instead.
So far, however, this idea has remained unexplored. The QW used to implement the Grover diffusion step had nothing to do with the Dirac QW used to simulate the electron. Moreover, the Grover oracle step seemed like a rather artificial, involved controlledphase, far from something that could occur in nature. This contribution begins to remedy both these objections.
Indeed, we used Dirac QW over both the triangular and the square grid as the Grover diffusion step. Instead of alternating this with an extrinsic oracle step, we coded for the solution directly inside the grid, by introducing a hole defect. We obtained strong numerical evidence showing that the Dirac QW localize around the hole defect in steps with probability , just like previous QW implementations of the Grover search would. We observed how sometimes topological effects come into play that may be of technical help.
Our next step is to use Dirac QW to locate not just a hole defect, but a particular QR code–like defect, amongst many possible others that could be present on the lattice. This would bring us one step closer to a natural implementation of an unstructured database Grover search.
Acknowledgments
The authors acknowledge inspiring conversations with Fabrice Debbasch, that sparked the idea of Grover searching for surface defects and enlightening discussions on topology with Alberto Verga. This work has been funded by the Pépinière d’Excellence 2018, AMIDEX fondation, project DiTiQuS.
Références
 [1] Scott Aaronson and Andris Ambainis. Quantum search of spatial regions. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pages 200–209. IEEE, 2003.
 [2] G. Abal, R. Donangelo, M. Forets, and R. Portugal. Spatial quantum search in a triangular network. Mathematical Structures in Computer Science, 22(3):521–531, June 2012. arXiv: 1009.1422.
 [3] Andris Ambainis, Andrew M Childs, Ben W Reichardt, Robert Špalek, and Shengyu Zhang. Any andor formula of size n can be evaluated in time n^1/2+o(1) on a quantum computer. SIAM Journal on Computing, 39(6):2513–2530, 2010.
 [4] Pablo Arrighi, Cédric Bény, and Terry Farrelly. A quantum cellular automaton for onedimensional qed. arXiv preprint arXiv:1903.07007, 2019.
 [5] Pablo Arrighi, Giuseppe Di Molfetta, Iván MárquezMartín, and Armando Pérez. The Dirac equation as a quantum walk over the honeycomb and triangular lattices. Physical Review A, 97(6):062111, June 2018. arXiv: 1803.01015.
 [6] Pablo Arrighi, Vincent Nesme, and Marcelo Forets. The dirac equation as a quantum walk: higher dimensions, observational convergence. Journal of Physics A: Mathematical and Theoretical, 47(46):465302, 2014.
 [7] Iwo BialynickiBirula. Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata. Physical Review D, 49(12):6920–6927, June 1994.
 [8] Gilles Brassard, Peter Hoyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. Contemporary Mathematics, 305:53–74, 2002.
 [9] Bruno Chagas, Renato Portugal, Stefan Boettcher, and Etsuo Segawa. Staggered Quantum Walk on Hexagonal Lattices. Physical Review A, 98(5):052310, November 2018. arXiv: 1806.10249.
 [10] Andrew M Childs and Jeffrey Goldstone. Spatial search by quantum walk. Physical Review A, 70(2):022314, 2004.
 [11] Giuseppe Di Molfetta, Marc Brachet, and Fabrice Debbasch. Quantum walks in artificial electric and gravitational fields. Physica A: Statistical Mechanics and its Applications, 397:157–168, 2014.
 [12] Giuseppe Di Molfetta and Fabrice Debbasch. Discretetime quantum walks: continuous limit and symmetries. Journal of Mathematical Physics, 53(12):123302, 2012.
 [13] Giuseppe Di Molfetta and Armando Pérez. Quantum walks as simulators of neutrino oscillations in a vacuum and matter. New Journal of Physics, 18(10):103038, 2016.

[14]
Lov K. Grover.
A fast quantum mechanical algorithm for database search.
In
Proceedings of the twentyeighth annual ACM symposium on Theory of computing  STOC ’96
, pages 212–219, Philadelphia, Pennsylvania, United States, 1996. ACM Press.  [15] Mohamed Hatifi, Giuseppe Di Molfetta, Fabrice Debbasch, and Marc Brachet. Quantum walk hydrodynamics. Scientific reports, 9(1):2989, 2019.
 [16] Harald Ibach and Hans Lüth. SolidState Physics: An Introduction to Theory and Experiment. SpringerVerlag, 1995.
 [17] Ioannis G. Karafyllidis. Quantum walks on graphene nanoribbons using quantum gates as coins. Journal of Computational Science, Complete(11):326–330, 2015.
 [18] Takuya Kitagawa. Topological phenomena in quantum walks: elementary introduction to the physics of topological phases. Quantum Information Processing, 11(5):1107–1148, 2012.
 [19] Takuya Kitagawa, Mark S Rudner, Erez Berg, and Eugene Demler. Exploring topological phases with quantum walks. Physical Review A, 82(3):033429, 2010.
 [20] Frédéric Magniez, Ashwin Nayak, Peter C Richter, and Miklos Santha. On the hitting times of quantum versus random walks. Algorithmica, 63(12):91–116, 2012.
 [21] David A. Meyer. From quantum cellular automata to quantum lattice gases. Journal of Statistical Physics, 85(56):551–574, December 1996. arXiv: quantph/9604003.
 [22] Apoorva Patel, KS Raghunathan, and Md Aminoor Rahaman. Search on a hypercubic lattice using a quantum random walk. ii. d= 2. Physical Review A, 82(3):032331, 2010.
 [23] A. Romanelli, A. Auyuanet, and R. Donangelo. Quantum search with resonances. Physica A: Statistical Mechanics and its Applications, 360(2):274 – 284, 2006.
 [24] Miklos Santha. Quantum walk based search algorithms. In International Conference on Theory and Applications of Models of Computation, pages 31–46. Springer, 2008.
 [25] Avatar Tulsi. Faster quantumwalk algorithm for the twodimensional spatial search. Physical Review A, 78(1):012310, 2008.
 [26] Alberto D Verga. Edge states in a twodimensional quantum walk with disorder. The European Physical Journal B, 90(3):41, 2017.
 [27] Guoming Wang. Efficient quantum algorithms for analyzing large sparse electrical networks. Quantum Info. Comput., 17(1112):987–1026, September 2017.
Comments
There are no comments yet.