15 citations · 18 across the 15 of their papers we have counts for
19 papers
Counterdiabatic quantum optimization for efficient state preparation in the Schwinger model
Ethan Laval, Bipasha Chakraborty, Stefano Cipolla
The Quantum Approximate Optimization Algorithm (QAOA), whose design is underpinned by the adiabatic theorem, is one of the leading variational quantum algorithms for preparing the…
A Barrier Primal Dual Hybrid Gradient Method for Solving Linear Programming Problems
Yingxin Zhou, Stefano Cipolla, Phan T. Vuong
Primal Dual Hybrid Gradient (PDHG) method has been verified to exhibit a two stage convergence behavior, in which a prolonged active set identification phase may be a major issue o…
A single loop method for quadratic minmax optimization
Stefano Cipolla, Oliver Stein, Alain Zemkoho
We consider a quadratic minmax problem with coupled inner constraints and propose a method to compute a class of stationary points. To motivate the need to compute such stationary…
Pauli-Sparse regularised Counterdiabatic Shortcuts for Linear-Ramp QAOA
Stefano Cipolla, Fabio Durastante
Combinatorial optimization is a leading target for quantum algorithms, but finite-depth QAOA can suffer from strong diabatic errors when the interpolation Hamiltonian has small, or…
Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach
Stefano Cipolla, Fabio Durastante, Miryam Gnazzo +1
Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motiv…
Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability
F. Picariello, G. Turati, R. Antonelli +10
The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, t…