Spatial Search on Sierpinski Carpet Using Quantum Walk
arXiv:1804.06549 · doi:10.7566/JPSJ.87.085003
Abstract
We investigate a quantum spatial search problem on a fractal lattice. A recent study for the Sierpinski gasket and tetrahedron made a conjecture that the dynamics of the search on a fractal lattice is determined by spectral dimension. We tackle this problem for the Sierpinski carpet, and our simulation result supports the conjecture. We also propose a scaling hypothesis of oracle calls for the quantum amplitude amplification.
arXiv comment6 pages, 5 figures
References in corpus (6)
- Quantum Mechanics helps in searching for a needle in a haystack
- A Quantum Random Walk Search Algorithm
- Spatial search in a honeycomb network
- Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
- Search on a Fractal Lattice using a Quantum Random Walk
- Search on a Hypercubic Lattice through a Quantum Random Walk: II. d=2