133 citations · 637 across the 18 of their papers we have counts for
18 papers
Spatial quantum search in a triangular network
G. Abal, R. Donangelo, M. Forets +1
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…
Mixing Times in Quantum Walks on Two-Dimensional Grids
F. L. Marquezino, R. Portugal, G. Abal
Mixing properties of discrete-time quantum walks on two-dimensional grids with torus-like boundary conditions are analyzed, focusing on their connection to the complexity of the co…
Spatial search in a honeycomb network
G. Abal, R. Donangelo, F. L. Marquezino +1
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…
Decoherence in Search Algorithms
G. Abal, R. Donangelo, F. L. Marquezino +2
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked verte…
Asymptotic entanglement in a two-dimensional quantum walk
Mostafa Annabestani, Mohammad Reza Abolhasani, Gonzalo Abal
The evolution operator of a discrete-time quantum walk involves a conditional shift in position space which entangles the coin and position degrees of freedom of the walker. After…
Mixing Times in Quantum Walks on the Hypercube
F. L. Marquezino, R. Portugal, G. Abal +1
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform dist…