Renato Portugal

Quantum search by continuous-time quantum walk on t-designs

2023 · arXiv (Cornell University)

This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence matrices, we identify a …

Quantum counting on the complete bipartite graph

2024 · International Journal of Quantum Information

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 and uses the evolution operator of …