Quantum spatial search in two-dimensional waveguide arrays
arXiv:2106.03867 · doi:10.1103/PhysRevApplied.16.054036
Abstract
Continuous-time quantum walks (CTQW) have shown the capability to perform efficiently the spatial search of a marked site on many kinds of graphs. However, most of such graphs are hard to realize in an experimental setting. Here we study CTQW spatial search on a planar triangular lattice by means of both numerical simulations and experiments. The experiments are performed using three-dimensional waveguide arrays fabricated by femtosecond laser pulses, illuminated by coherent light. We show that the retrieval of the marked site by the quantum walker is accomplished with higher probability than the classical counterpart, in a convenient time window placed early in the evolution.
arXiv comment10 pages, version accepted by Phys. Rev. Appl
References in corpus (30)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Exponential algorithmic speedup by quantum walk
- Spatial search by quantum walk
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Universal quantum computation using the discrete time quantum walk
- An example of the difference between quantum and classical random walks
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search by quantum walk is optimal for almost all graphs
- Photonic realization of the quantum Rabi model
- Quantum walks of correlated photon pairs in two-dimensional waveguide arrays
- Experimental Quantum Fast Hitting on Hexagonal Graphs
- Fast Escape from Quantum Mazes in Integrated Photonics
- Connectivity is a Poor Indicator of Fast Quantum Search
- Spatial search by continuous-time quantum walks on crystal lattices
- On the optimality of spatial search by continuous-time quantum walk
- Quantum search on graphene lattices
- A quantum-walk-inspired adiabatic algorithm for graph isomorphism
- Continuous-Time Quantum Search on Balanced Trees
- Microwave Experiments Simulating Quantum Search and Directed Transport in Artificial Graphene
- Noise-assisted quantum transport and computation
- Quantum state transfer via Bloch oscillations
- Finding paths in tree graphs with a quantum walk
- Spatial quantum search in a triangular network
- Continuous-time quantum walk spatial search on the Bollobás scale-free network
- Quantum-classical dynamical distance and quantumness of quantum walks
- Impact of global and local interaction on quantum spatial search on chimera graph
Cited by in corpus (14)
- Review on Quantum Walk Computing: Theory, Implementation, and Application
- Programmable high-dimensional Hamiltonian in a photonic waveguide array
- Feedback-assisted quantum search by continuous-time quantum walks
- Multiparameter estimation of continuous-time Quantum Walk Hamiltonians through Machine Learning
- Quantum search in many-body interacting system with long-range interaction
- Identifying network topologies via quantum walk distributions
- Enhanced quantum transport in chiral quantum walks
- Walking on Vertices and Edges by Continuous-Time Quantum Walk
- Multimarked Spatial Search by Continuous-Time Quantum Walk
- Scalable Structure For Chiral Quantum Routing
- Expanding Hardware-Efficiently Manipulable Hilbert Space via Hamiltonian Embedding
- Implementation of Continuous-Time Quantum Walks on Quantum Computers
- Directionality and quantum backfire in continuous-time quantum walks from delocalized states: Exact results
- Temporal nonclassicality in continuous-time quantum walks