3 papers
math.OC2025
Time-varying Gaussian Process Bandit Optimization with Experts: no-regret in logarithmically-many side queries
Eliabelle Mauduit, Eloïse Berthier, Andrea Simonetto
We study a time-varying Bayesian optimization problem with bandit feedback, where the reward function belongs to a Reproducing Kernel Hilbert Space (RKHS). We approach the problem…
quant-ph2025
Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Ugo Nzongani, Dylan Laplace Mermoud, Giuseppe Di Molfetta +1
We introduce SamBa-GQW, a novel quantum algorithm for solving binary combinatorial optimization problems of arbitrary degree with no use of any classical optimizer. The algorithm i…
quant-ph2025
Non-unitary enhanced transfer efficiency in quantum walk search on complex networks
Ugo Nzongani, Andrea Simonetto, Giuseppe Di Molfetta
The task of finding an element in an unstructured database is known as spatial search and can be expressed as a quantum walk evolution on a graph. In this article, we modify the us…