50 citations · 88 across the 7 of their papers we have counts for
8 papers
On the Role of Problem Structure in Single-Layer QAOA
Guilherme Adamatti Bridi, Franklin de Lima Marquezino, Andris Ambainis
Problem structure is widely regarded as a key factor influencing the performance of the Quantum Approximate Optimization Algorithm (QAOA), yet it often remains an informal notion w…
Noise-Resilient Spatial Search with Lackadaisical Quantum Walks
Gabriel Mauricio Oswald Vieira, Nelson Maculan, Franklin de Lima Marquezino
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…
Analytical results for the Quantum Alternating Operator Ansatz with Grover Mixer
Guilherme Adamatti Bridi, Franklin de Lima Marquezino
An important property of QAOA with Grover mixer is that its expectation value is invariant over any permutation of states. As a consequence, the algorithm is independent of the str…
Fourier 1-norm and quantum speed-up
S. A. Grillo, F. L. Marquezino
Understanding quantum speed-up over classical computing is fundamental for the development of efficient quantum algorithms. In this paper, we study such problem within the framewor…
Thermodynamics of N-dimensional quantum walks
Alejandro Romanelli, Raul Donangelo, Renato Portugal +1
The entanglement between the position and coin state of a -dimensional quantum walker is shown to lead to a thermodynamic theory. The entropy, in this thermodynamics, is associa…
Spatial Search Algorithms on Hanoi Networks
Franklin L. Marquezino, Renato Portugal, Stefan Boettcher
We use the abstract search algorithm and its extension due to Tulsi to analyze a spatial quantum search algorithm that finds a marked vertex in Hanoi networks of degree 4 faster th…
Quantum Walks
Daniel Reitzner, Daniel Nagaj, Vladimir Buzek
This tutorial article showcases the many varieties and uses of quantum walks. Discrete time quantum walks are introduced as counterparts of classical random walks. The emphasis is…
Quantum Search Algorithms on Hierarchical Networks
F. L. Marquezino, R. Portugal, S. Boettcher
The "abstract search algorithm" is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and th…