Quantum search on graphene lattices
arXiv:1312.3852 · doi:10.1103/PhysRevLett.112.070504
Abstract
We present a continuous-time quantum search algorithm on a graphene lattice. This provides the sought-after implementation of an efficient continuous-time quantum search on a two-dimensional lattice. The search uses the linearity of the dispersion relation near the Dirac point and can find a marked site on a graphene lattice faster than the corresponding classical search. The algorithm can also be used for state transfer and communication.
8 pages including supplement
References in corpus (11)
- The electronic properties of graphene
- Detection of Individual Gas Molecules Absorbed on Graphene
- Universal computation 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
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search and the Dirac equation
- A random walk approach to quantum algorithms
- Optimized quantum random-walk search algorithms
- Dirac Point and Edge States in a Microwave Realization of Tight-Binding Graphene-like Structures
Cited by in corpus (20)
- Systematic Dimensionality Reduction for Quantum Walks: Optimal Spatial Search and Transport on Non-Regular Graphs
- Staggered Quantum Walks on Graphs
- Optimal quantum spatial search on random temporal networks
- Spatial search by continuous-time quantum walks on crystal lattices
- On the optimality of spatial search by continuous-time quantum walk
- Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
- Quantum walks and quantum search on graphene lattices
- Finding a marked node on any graph by continuous-time quantum walk
- Quantum spatial search in two-dimensional waveguide arrays
- Continuous Time Quantum Walks in finite Dimensions
- Continuous-time quantum walk spatial search on the Bollobás scale-free network
- From curved spacetime to spacetime-dependent local unitaries over the honeycomb and triangular Quantum Walks
- Analog quantum algorithms for the mixing of Markov chains
- Feedback-assisted quantum search by continuous-time quantum walks
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
- Dimerized Decomposition of Quantum Evolution on an Arbitrary Graph
- Quantum Ultra-Walks: Walks on a Line with Hierarchical Spatial Heterogeneity
- Searching via nonlinear quantum walk on the 2D-grid
- Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum Computer
- A universal adiabatic quantum query algorithm