78 citations · 125 across the 13 of their papers we have counts for
15 papers
Expressivity Limits in Quantum Walk-based Optimization
Guilherme A. Bridi, Debbie Lim, Lirandë Pira +3
Quantum algorithms have emerged as a promising tool to solve combinatorial optimization problems. The quantum walk optimization algorithm (QWOA) is one such variational approach th…
Impact of Bivariate Gaussian Potentials on Quantum Walks for Spatial Search
Franklin de L. Marquezino, Raqueline A. M. Santos
Quantum search algorithms are crucial for exploring large solution spaces, but their robustness to environmental perturbations, such as noise or disorder, remains a critical challe…
Quantum Counting on the Complete Bipartite Graph
Gustavo A. Bezerra, Raqueline A. M. Santos, Renato Portugal
Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. This algorithm is based on the quantum phase estimation algorithm an…
Decoherence on Staggered Quantum Walks
R. A. M. Santos, F. L. Marquezino
Decoherence phenomenon has been widely studied in different types of quantum walks. In this work we show how to model decoherence inspired by percolation on staggered quantum walks…
Quantum state transfer on the complete bipartite graph
R. A. M. Santos
Previously it was shown that (almost) perfect state transfer can be achieved on the complete bipartite graph by a discrete-time coined quantum walk based algorithm when both the se…
Lackadaisical quantum walks on 2D grids with multiple marked vertices
Nikolajs Nahimovs, Raqueline A. M. Santos
Lackadaisical quantum walk (LQW) is a quantum analog of a classical lazy walk, where each vertex has a self-loop of weight . For a regular 2D grid LQW c…
The role of tessellation intersection in staggered quantum walks
Raqueline A. M. Santos
The staggered quantum walk (SQW) model is defined by partitioning the graph into cliques, which are called polygons. We analyze the role that the size of the polygon intersection p…
On the probability of finding marked connected components using quantum walks
Nikolajs Nahimovs, Raqueline A. M. Santos, Kamil Khadiev
Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with…
Exceptional Quantum Walk Search on the Cycle
Thomas G. Wong, Raqueline A. M. Santos
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…
Adjacent vertices can be hard to find by quantum walks
Nikolajs Nahimovs, Raqueline A. M. Santos
Quantum walks have been useful for designing quantum algorithms that outperform their classical versions for a variety of search problems. Most of the papers, however, consider a s…
Szegedy's quantum walk with queries
Raqueline A. M. Santos
When searching for a marked vertex in a graph, Szegedy's usual search operator is defined by using the transition probability matrix of the random walk with absorbing barriers at t…
The Staggered Quantum Walk Model
R. Portugal, R. A. M. Santos, T. D. Fernandes +1
There are at least three models of discrete-time quantum walks (QWs) on graphs currently under active development. In this work we focus on the equivalence of two of them, known as…
Moments of Coinless Quantum Walks on Lattices
Raqueline A. M. Santos, Renato Portugal, Stefan Boettcher
The properties of the coinless quantum walk model have not been as thoroughly analyzed as those of the coined model. Both evolve in discrete time steps but the former uses a smalle…
Decoherence in Quantum Markov Chains
Raqueline A. M. Santos, Renato Portugal, Marcelo D. Fragoso
It is known that under some assumptions the hitting time in quantum Markov chains is quadratically smaller than the hitting time in classical Markov chains. This work extends this…
Quantum Hitting Time on the Complete Graph
R. A. M. Santos, R. Portugal
Quantum walks play an important role in the area of quantum algorithms. Many interesting problems can be reduced to searching marked states in a quantum Markov chain. In this conte…