Faster quantum-walk algorithm for the two-dimensional spatial search
From MaRDI portal
Abstract: We consider the problem of finding a desired item out of items arranged on the sites of a two-dimensional lattice of size . The previous quantum walk based algorithms take steps to solve this problem, and it is an open question whether the performance can be improved. We present a new algorithm which solves the problem in steps, thus giving an improvement over the known algorithms. The improvement is achieved by controlling the quantum walk on the lattice using an ancilla qubit.
Recommendations
Cited in
(49)- Quantum walk, entanglement and thermodynamic laws
- Exceptional quantum walk search on the cycle
- Quantum algorithm design: techniques and applications
- Faster search by lackadaisical quantum walk
- Quantum walks: a comprehensive review
- Spatial search using the discrete time quantum walk
- Quantum search algorithm for set operation
- Generalized quantum teleportation of shared quantum secret: a coined quantum-walk approach
- A new kind of flexible quantum teleportation of an arbitrary multi-qubit state by multi-walker quantum walks
- Quantum search on simplicial complexes
- Quantum walks for the determination of commutativity of finite dimensional algebras
- On the hitting times of quantum versus random walks
- An alternate quantum adiabatic evolution for the Deutsch-Jozsa problem
- Quantum computation and quantum information
- Quantum walks can find a marked element on any graph
- Quantum walk and its application domains: a systematic review
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Spatial quantum search in a triangular network
- Establishing the equivalence between Szegedy's and coined quantum walks using the staggered model
- Search via quantum walks with intermediate measurements
- Symmetry and quantum transport on networks
- QUANTUM HITTING TIME ON THE COMPLETE GRAPH
- Spatial search on a honeycomb network
- Spatial search and the Dirac equation
- Doubling the success of quantum walk search using internal-state measurements
- Robust quantum spatial search
- Search by quantum walks on two-dimensional grid without amplitude amplification
- Analysis of quantum walks with time-varying coin on \(d\)-dimensional lattices
- Controllability of quantum walks on graphs
- Probability distributions for Markov chain based quantum walks
- The quantum walk search algorithm: factors affecting efficiency
- Search on a hypercubic lattice using a quantum random walk. I. \(d>2\)
- Search on a hypercubic lattice using a quantum random walk. II. d=2
- Controllability of system dynamics on networks, quantum walks and random walks
- Lackadaisical quantum walk for spatial search
- Quantum search on Hanoi network
- Simulating continuous-time Hamiltonian dynamics by way of a discrete-time quantum walk
- Connection between continuous and discrete time quantum walks. From \(D\)-dimensional lattices to general graphs
- Lackadaisical quantum walks on 2D grids with multiple marked vertices
- Improvement of quantum walks search algorithm in single-marked vertex graph
- Quantum circuits for discrete-time quantum walks with position-dependent coin operator
- A quantum blockchain-enabled framework for secure private electronic medical records in Internet of medical things
- Spatial search algorithms on graphs with multiple targets using discrete-time quantum walk
- Quantum walk search on a two-dimensional grid with extra edges
- On the relationship between continuous- and discrete-time quantum walk
- Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks
- Spectral approach to quantum searching on the interpolated Markov chains: the complete bipartite graph
- Quantum walk search for exceptional configurations
- Quantum walk search based edge detection of images
This page was built for publication: Faster quantum-walk algorithm for the two-dimensional spatial search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903104)
