Related papers: Scaling Hypothesis of Spatial Search on Fractal La…
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…
The spatial search problem on regular lattice structures in integer number of dimensions $d\geq2$ has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in…
The question of whether quantum spatial search in two dimensions can be made optimal has long been an open problem. We report progress towards its resolution by showing that the oracle complexity for target location can be made optimal, by…
We analyse the eigenvalue and eigenvector structure of the flip-flop quantum walk on regular graphs, explicitly demonstrating how it is quadratically faster than the classical random walk. Then we use it in a controlled spatial search…
We investigate the spatial search problem on the two-dimensional square lattice, using the Dirac evolution operator discretised according to the staggered lattice fermion formalism. $d=2$ is the critical dimension for the spatial search…
This research is motivated by the study of the geometry of fractal sets and is focused on uniformization problems: transformation of sets to canonical sets, using maps that preserve the geometry in some sense. More specifically, the main…
We consider the quantum search problem with a continuous time quantum walk for networks of finite spectral dimension d_{s} of the network Laplacian. For general networks of fractal (integer or non-integer) dimension d_{f}, for which in…
We study quantum algorithms for spatial search on finite dimensional grids. Patel et al. and Falk have proposed algorithms based on a quantum walk without a coin, with different operators applied at even and odd steps. Until now, such…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
A quantum walk on a lattice is a paradigm of a quantum search in a database. The database qubit strings are the lattice sites, qubit rotations are tunneling events, and the target site is tagged by an energy shift. For quantum walks on a…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
We model quantum transport, described by continuous-time quantum walks (CTQW), on deterministic Sierpinski fractals, differentiating between Sierpinski gaskets and Sierpinski carpets, along with their dual structures. The transport…
We address the problem of evaluating the number $S_N(t)$ of distinct sites visited up to time t by N noninteracting random walkers all initially placed on one site of a deterministic fractal lattice. For a wide class of fractals, of which…
Quantum walks have been very successful in the development of search algorithms in quantum information, in particular in the development of spatial search algorithms. However, the construction of continuous-time quantum search algorithms in…
Continuous-time quantum walks can be used to solve the spatial search problem, which is an essential component for many quantum algorithms that run quadratically faster than their classical counterpart, in $\mathcal O(\sqrt n)$ time for $n$…
The spatial search problem consists in minimizing the number of steps required to find a given site in a network, under the restriction that only oracle queries or translations to neighboring sites are allowed. In this paper, a quantum…
We investigate the transport and entanglement properties exhibited by quantum walks with coin operators concatenated in a space-time fractal structure. Inspired by recent developments in photonics, we choose the paradigmatic Sierpinski…
We analyze discrete-time quantum walks on Sierpinski gaskets using a flip-flop shift operator with the Grover coin. We obtain the scaling of two important physical quantities: the mean-square displacement and the mixing time as function of…
I study the properties of the quantum critical point of the transverse-field quantum Ising model on various fractal lattices such as the Sierpi\'nski carpet, Sierpi\'nski gasket, and Sierpi\'nski tetrahedron. Using a continuous-time quantum…
Quantum walk has been successfully used to search for targets on graphs with vertices identified as the elements of a database. This spacial search on a two-dimensional periodic grid takes $\mathcal{O}\left(\sqrt{N\log N}\right)$ oracle…