Search on a hypercubic lattice using a quantum random walk. I.<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>

DOI10.1103/PhysRevA.82.032330zbMath1255.81115arXiv1003.0065MaRDI QIDQ4903073

Apoorva Patel, M.D. Aminoor Rahaman

Publication date: 19 January 2013

Published in: Physical Review A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1003.0065

zbMATH Keywords

diffusion process

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum stochastic calculus (81S25)

Related Items (6)

Random walk quantum clustering algorithm based on space ⋮ Robust quantum spatial search ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ 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> ⋮ Quantum walks: a comprehensive review ⋮ Quantum transport ind-dimensional lattices

Cites Work

• Quantum random walks do not need a coin toss
• Spatial search and the Dirac equation
• Quantum search algorithms on the hypercube
• Strengths and Weaknesses of Quantum Computing
• 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

This page was built for publication: Search on a hypercubic lattice using a quantum random walk. I.<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>