10 papers
The algebraic structures of social organizations: the operad of cooperative games
Dylan Laplace Mermoud, Victor Roca i Lucio
The main goal of this paper is to settle a conceptual framework for cooperative game theory in which the notion of composition/aggregation of games is the defining structure. This…
Scaling QAOA: transferring optimal adiabatic schedules from small-scale to large-scale variational circuits
Ugo Nzongani, Dylan Laplace Mermoud, Arthur Braida
The Quantum Approximate Optimization Algorithm (QAOA) is a leading approach for combinatorial optimization on near-term quantum devices, yet its scalability is limited by the diffi…
Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond
Dylan Laplace Mermoud, Andrea Simonetto, Sourour Elloumi
We present a quantum variational algorithm based on a novel circuit that generates all permutations that can be spanned by one- and two-qubits permutation gates. The construction o…
On the closest balanced game
Pedro GarcÃa-Segador, Michel Grabisch, Dylan Laplace Mermoud +1
Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the…
Diffusion in dynamic networks with time-varying inputs to allocate responsibility
Rosa van den Ende, Dylan Laplace Mermoud
Responsibility in complex networks extends beyond direct actions: players should also bear responsibility for the indirect effects within their supply chains or network. We introdu…
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…