Spatial search using the discrete time quantum walk
From MaRDI portal
Publication:1761706
DOI10.1007/S11047-011-9279-4zbMath1251.68116arXiv1010.4705OpenAlexW2165067255WikidataQ62269965 ScholiaQ62269965MaRDI QIDQ1761706
Matthew Everitt, Daniel Mosby, Neil B. Lovett, Matthew Trevers
Publication date: 15 November 2012
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1010.4705
Information storage and retrieval of data (68P20) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Lackadaisical quantum walk for spatial search ⋮ Quantum walks on Sierpinski gasket and Sierpinski tetrahedron ⋮ The quantum walk search algorithm: factors affecting efficiency
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hitting times of quantum versus random walks
- Spatial search on a honeycomb network
- Spatial search and the Dirac equation
- Quantum Walk Based Search Algorithms
- Exponential algorithmic speedup by a quantum walk
- Finding Is as Easy as Detecting for Quantum Walks
- Strengths and Weaknesses of Quantum Computing
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Search on a hypercubic lattice using a quantum random walk. II.<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline"><mml:mrow><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:math>
- Faster quantum-walk algorithm for the two-dimensional spatial search
- One-dimensional quantum walks
- Quantum walks on graphs
- Decoherence in quantum walks – a review
This page was built for publication: Spatial search using the discrete time quantum walk
