Related papers: Scaling Hypothesis of Spatial Search on Fractal La…
In this paper, we present a novel formulation of traditional sampling-based motion planners as database-oracle structures that can be solved via quantum search algorithms. We consider two complementary scenarios: for simpler sparse…
We investigate modified Sierpi\'nski Carpet fractals, constructed by dividing a square into a square $n \times n$ grid, removing a subset of the squares at each step, and then repeating that process for each square remaining in that grid.…
The evolution of a many-particle system on a one-dimensional lattice, subjected to a quantum walk can cause spatial entanglement in the lattice position, which can be exploited for quantum information/communication purposes. We demonstrate…
We numerically explore the interplay of fractal geometry and quantum entanglement by analyzing the von Neumann entropy (known as entanglement entropy) and the entanglement contour in the scaling limit. Adopting quadratic fermionic models on…
High-dimensional limit theorems have been shown useful to derive tuning rules for finding the optimal scaling in random-walk Metropolis algorithms. The assumptions under which weak convergence results are proved are however restrictive: the…
We provide first evidence that under certain conditions, 1/2-spin fermions may naturally behave like a Grover search, looking for topological defects in a material. The theoretical framework is that of discrete-time quantum walks (QW), i.e.…
We study upper estimates of the martingale dimension $d_m$ of diffusion processes associated with strong local Dirichlet forms. By applying a general strategy to self-similar Dirichlet forms on self-similar fractals, we prove that $d_m=1$…
A theory for studying the dynamic scaling properties of branes and relativistic topological defect networks is presented. The theory, based on a relativistic version of the level set method, well-known in other contexts, possesses…
In the typical model, a discrete-time coined quantum walk searching the 2D grid for a marked vertex achieves a success probability of $O(1/\log N)$ in $O(\sqrt{N \log N})$ steps, which with amplitude amplification yields an overall runtime…
The site percolation problem is studied on d-dimensional generalisations of the Kagome' lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q=2d. The site…
A quantum particle evolving by Schr\"odinger's equation in discrete space constitutes a continuous-time quantum walk on a graph of vertices and edges. When a vertex is marked by an oracle, the quantum walk effects a quantum search…
We address memory effects and diffusive properties of a continuous-time quantum walk on a one-dimensional percolation lattice affected by spatially correlated random telegraph noise. In particular, by introducing spatially correlated…
Continuous time quantum walks provide an important framework for designing new algorithms and modelling quantum transport and state transfer problems. Often, the graph representing the structure of a problem contains certain symmetries that…
There is a growing interest in searching for topology in fractal dimensions with the aim of finding different properties and advantages compared to the integer dimensional case. It has previously been shown that the Laughlin state can be…
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…
This paper presents a quantum search approach to combinatorial constraint satisfaction problems, demonstrated through the generation of magic squares. We reformulate magic square construction as a quantum search problem in which a…
Quantum walks are a powerful framework for the development of quantum algorithms, with lackadaisical quantum walks (LQWs) standing out as an efficient model for spatial search. In this work, we investigate how broken-link decoherence…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…
We present results from a detailed numerical study of the small-scale and loop production properties of cosmic string networks, based on the largest and highest resolution string simulations to date. We investigate the non-trivial fractal…