6 papers
Feasibility-driven QAOA with penalty scheduling
Francesco Ferrari, Matteo Vandelli, Daniele Dragoni
Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation. This approach requires careful…
Emergency hub placement with a neutral-atom quantum computer
Sara Tarquini, Matteo Vandelli, Francesco Ferrari +2
We study the problem of emergency operation center placement in disaster response, where a minimal number of hubs must be selected to ensure timely coverage of all affected locatio…
High-expressibility Quantum Neural Networks using only classical resources
Marco Maronese, Francesco Ferrari, Matteo Vandelli +1
Quantum neural networks (QNNs), as currently formulated, are near-term quantum machine learning architectures that leverage parameterized quantum circuits with the aim of improving…
Drone delivery packing problem on a neutral-atom quantum computer
Sara Tarquini, Matteo Vandelli, Francesco Ferrari +2
Quantum architectures based on neutral atoms have gained significant attention in recent years as specialized computational machines due to their ability to directly encode the ind…
Constraint-preserving quantum algorithm for the multi-frequency antenna placement problem
Matteo Vandelli, Francesco Ferrari, Daniele Dragoni
Quantum algorithms for combinatorial optimization typically encode constraints as soft penalties within the objective function, which can reduce efficiency and scalability compared…
Parallel splitting method for large-scale quadratic programs
Matteo Vandelli, Francesco Ferrari, Daniele Dragoni
Current algorithms for large-scale industrial optimization problems typically face a trade-off: they either require exponential time to reach optimal solutions, or employ problem-s…