Related papers: Scaling Hypothesis of Spatial Search on Fractal La…
The scaling behavior of the closed trajectories of a moving particle generated by randomly placed rotators or mirrors on a square or triangular lattice is studied numerically. For most concentrations of the scatterers the trajectories close…
The task of finding an entry in an unsorted list of $N$ elements famously takes $O(N)$ queries to an oracle for a classical computer and $O(\sqrt{N})$ queries for a quantum computer using Grover's algorithm. Reformulated as a spatial search…
The method of counting loops for calculating the partition function of the Ising model on the two dimensional square lattice is extended to lacunary planar lattices, especially scale invariant fractal lattices, the Sierpi\'nsky carpets with…
Despite extensive research on distance oracles, there are still large gaps between the best constructions for spanners and distance oracles. Notably, there exist sparse spanners with a multiplicative stretch of $1+\varepsilon$ plus some…
Very often traditional approaches studying dynamics of self-similarity processes are not able to give their quantitative characteristics at infinity and, as a consequence, use limits to overcome this difficulty. For example, it is well know…
We investigate the behavior of coherence in scattering quantum walk search on complete graph under the condition that the total number of vertices of the graph is greatly larger than the marked number of vertices we are searching, $N \gg…
In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…
An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially…
We introduce a structured quantum search algorithm that leverages entanglement maps and a fixed-point method to minimize oracle query complexity in unsorted datasets. By partitioning qubits into rows based on their entanglement order, the…
Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers…
We study scattering quantum walks on highly symmetric graphs and use the walks to solve search problems on these graphs. The particle making the walk resides on the edges of the graph, and at each time step scatters at the vertices. All of…
All-sky searches for gravitational-wave pulsars are generally limited in sensitivity by the finite availability of computing resources. Semicoherent searches are a common method of maximizing search sensitivity given a fixed computing…
The present paper focuses on the order-disorder transition of an Ising model on a self-similar lattice. We present a detailed numerical study, based on the Monte Carlo method in conjunction with the finite size scaling method, of the…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
As an emerging complex two-dimensional structure, plane fractal has attracted much attention due to its novel dimension-related physical properties. In this paper, we check the feasibility to create an effective Sierpinski carpet (SC), a…
Continuous-time quantum walks are typically effected by either the discrete Laplacian or the adjacency matrix. In this paper, we explore a third option: the signless Laplacian, which has applications in algebraic graph theory and may arise…
Numerical simulations of quantum magnetism in two spatial dimensions are often constrained by the area law of entanglement entropy, which heavily limits the accessible system sizes in tensor network methods. In this work, we investigate how…
Fractal geometry is the study of sets which exhibit the same pattern at multiple scales. Developing tools to study these sets is of great interest. One step towards developing some of these tools is recognizing the duality between…
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that a database of N items laid out in d spatial…
We present various results on the scheme introduced , which is a quantum spatial-search algorithm on a two-dimensional (2D) square spatial grid, realized with a 2D Dirac discrete-time quantum walk (DQW) coupled to a Coulomb electric field…