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>

DOI10.1103/PhysRevA.82.032331zbMath1255.81114arXiv1003.5564MaRDI QIDQ4903074

M.D. Aminoor Rahaman, K. S. Raghunathan, Apoorva Patel

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.5564

zbMATH Keywords

hypercubic lattice

Mathematics Subject Classification ID

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

Related Items (8)

The staggered quantum walk model ⋮ Robust quantum spatial search ⋮ Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs ⋮ The quantum walk search algorithm: factors affecting efficiency ⋮ 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> ⋮ Quantum walks: a comprehensive review ⋮ Spatial search using the discrete time quantum walk ⋮ Moments of coinless quantum walks on lattices

Cites Work

• Spatial search and the Dirac equation
• 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>
• 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. 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>