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.
arXiv comment16 pages, 15 figures
References in corpus (37)
- The electronic properties of graphene
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Algorithms Revisited
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- 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
- Quantum computers can search rapidly by using almost any transformation
- Photons Walking the Line: A quantum walk with adjustable coin operations
- From quantum cellular automata to quantum lattice gases
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Realization of a quantum walk with one and two trapped ions
- Coherent transport of neutral atoms in spin-dependent optical lattice potentials
- Quantum walk of a trapped ion in phase space
- Discrete single-photon quantum walks with tunable decoherence
- Edge states in Graphene: from gapped flat band to gapless chiral modes
- Decoherence can be useful in quantum walks
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search and the Dirac equation
- Optimized quantum random-walk search algorithms
- Quantum walk approach to search on fractal structures
- Dirac Point and Edge States in a Microwave Realization of Tight-Binding Graphene-like Structures
- Quantum walks can find a marked element on any graph
- Experimental realisation of a delayed-choice quantum walk
- Implementing the one-dimensional quantum (Hadamard) walk using a Bose-Einstein Condensate
- Alternate two-dimensional quantum walk with a single-qubit coin
- Spatial search by continuous-time quantum walks on crystal lattices
- Quantum search algorithms on a regular lattice
- Spatial search in a honeycomb network
- Quantum search on graphene lattices
- Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
- Search on a Fractal Lattice using a Quantum Random Walk
- Quantum search algorithms on the hypercube
- Mixing Times in Quantum Walks on Two-Dimensional Grids
Cited by in corpus (10)
- Staggered Quantum Walks on Graphs
- The Dirac equation as a quantum walk over the honeycomb and triangular lattices
- Generalized quantum-classical correspondence for random walks on graphs
- From curved spacetime to spacetime-dependent local unitaries over the honeycomb and triangular Quantum Walks
- Quantum walk transport properties on graphene structures
- Continuous-time quantum walks on planar lattices and the role of the magnetic field
- Strategies to simulate dephasing-assisted quantum transport on digital quantum computers
- Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
- Scaling Hypothesis of Spatial Search on Fractal Lattice Using Quantum Walk
- Nonlinear flip-flop quantum walks through potential barriers