Quantum walks and quantum search on graphene lattices
arXiv:1501.07543 · doi:10.1103/PhysRevA.91.062323
Abstract
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in two-dimensional lattices has proved difficult, requiring additional degrees of freedom. Here, we demonstrate that continuous-time quantum walk search is possible in two-dimensions by changing the search topology to a graphene lattice, utilising the Dirac point in the energy spectrum. This is made possible by making a change to standard methods of marking a particular site in the lattice. Various ways of marking a site are shown to result in successful search protocols. We further establish that the search can be adapted to transfer probability amplitude across the lattice between specific lattice sites thus establishing a line of communication between these sites.
16 pages, 15 figures
References in corpus (15)
- The electronic properties of graphene
- Universal computation by quantum walk
- Quantum walks of correlated particles
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Discrete single-photon quantum walks with tunable decoherence
- Edge states in Graphene: from gapped flat band to gapless chiral modes
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search and the Dirac equation
- Optimized quantum random-walk search algorithms
- Dirac Point and Edge States in a Microwave Realization of Tight-Binding Graphene-like Structures
- Implementing the one-dimensional quantum (Hadamard) walk using a Bose-Einstein Condensate
- Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene