arXiv subjects

Matteo Vandelli

Publications and source records attributed to Matteo Vandelli.

12 recordsLinked to original sources

arXiv2026

Combinatorial optimization of connected UAV communication bridges for emergency response

We present a combinatorial optimization problem for the strategic deployment of UAVs equipped with 5G antennas to assist rescue operations in regions hit by natural disasters. Our goal is to optimize the placement of UAVs to provide coverage in flying ad-hoc networks among given candidate sites. Our formulation aims to maximize signal coverage and minimize interference while ensuring network connectivity. To mitigate interference effects, we incorporate the use of multiple frequencies. We formulate this problem as an integer quadratic program (IQP). We present numerical solutions obtained via the CPLEX solver and conduct a preliminary analysis of the problem's scalability in realistic network configurations. Our findings reveal a significant exponential increase in Time-to-Solution (TTS) as the number of sites grows, which poses a critical challenge in urgent, time-sensitive scenarios. To address this issue, approximate suboptimal solutions can be produced by enforcing a time limit on the solver. Although these solutions are not optimal, they preserve connectivity in most cases, providing a practical trade-off between solution quality and computational times that remain within feasible limits for real-time UAV redeployment. Recognizing the limitations of classical solvers in these contexts, we explore quantum computing as a promising alternative. Specifically, we reformulate the problem as a quadratic unconstrained binary optimization (QUBO) problem, suitable for most quantum algorithms. Through high-performance computing emulation, we show that the quantum adiabatic algorithm (QAA) can accurately solve small-scale instances, paving the way for future application of quantum computing to large-scale, time-critical optimization problems in disaster response.

quant-ph↗

arXiv2026

Feasibility-driven QAOA with penalty scheduling

Most available quantum algorithms address constrained optimization problems by treating constraints as soft penalty terms within a QUBO formulation. This approach requires careful adjustment of the penalty coefficients, which scales poorly with the number of constraints and lacks a proper strategy to balance feasibility and solution quality. In this work, we introduce two extensions of standard linear-ramp QAOA (lr-QAOA) tailored to problems with multiple heterogeneous constraints. We first construct $\Lambda$-lr-QAOA, in which each penalty term is assigned its own linear-ramp schedule, promoting penalty weights from external hyperparameters to internal variational parameters of QAOA, similarly to the objective and mixer parameters. By optimizing all schedules jointly in a single run, this approach eliminates nested penalty tuning and scales more efficiently to multiple constraints. The optimization is guided by a feasibility-driven loss function that pushes the quantum state towards high-quality feasible solutions. As a further refinement, we introduce piecewise-ramp QAOA, in which the linear ramps are replaced by two-segment piecewise schedules, enhancing the expressiveness of the Ansatz at the cost of a small parameter overhead independent of the circuit depth. We benchmark both methods on Earth-observation satellite mission planning tasks formulated as budget-constrained Maximum Weight Independent Set problems. Numerical results show that piecewise-ramp QAOA consistently outperforms lr-QAOA and $\Lambda$-lr-QAOA across circuit depths and system sizes. Furthermore, both $\Lambda$-lr-QAOA and piecewise-ramp QAOA exhibit a high feasibility rate, which is crucial in industrial applications. Our analysis highlights an intrinsic feasibility-optimality trade-off, which we address by introducing a filtered variant of the loss providing a single hyperparameter to tune this balance.

quant-ph↗

arXiv2026

Emergency hub placement with a neutral-atom quantum computer

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 locations. This task can be formulated as a minimum dominating set problem on a graph encoding reachability within a target response time. We propose a hybrid quantum-classical approximation framework that leverages neutral-atom quantum computers as independent set samplers. Candidate dominating sets are constructed from both small maximal independent sets and complements of large independent sets, and are subsequently refined via a lightweight classical procedure. We benchmark the approach on synthetic instances and realistic case studies, and implement it on the Fresnel quantum processor by Pasqal, solving instances of up to 100 nodes. Our results show that quantum-generated samples, despite hardware noise, enable near-optimal solutions of the placement problem. Overall, our results demonstrate that neutral-atom devices operating in analog mode can already be used to tackle graph optimization problems for real-world applications.

quant-ph↗

arXiv2026

Drone delivery packing problem on a neutral-atom quantum computer

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 independent set constraint on graphs, exploiting the Rydberg blockade mechanism. In this work, we address the Drone Delivery Packing Problem via a hybrid quantum-classical framework leveraging a neutral-atom quantum processing unit (QPU). We reformulate the optimization task as a graph-partitioning problem based on the independent sets (ISs) of a scheduling graph that encodes delivery incompatibilities. Each partition corresponds to deliveries assigned to a single drone, with the objective of minimizing the total number of partitions. While the ISs represent time-feasible schedules, battery-duration constraints are enforced through a classical post-processing routine. This methodology enables the recovery of optimal delivery schedules, provided a sufficient number of samples is collected from the QPU to resolve the solution space. We benchmark the hybrid workflow through numerical emulations and demonstrate its effectiveness on Pasqal's Fresnel QPU, reporting hardware experiments with configurations of up to 100 atoms.

quant-ph↗

arXiv2025

Constraint-preserving quantum algorithm for the multi-frequency antenna placement problem

Quantum algorithms for combinatorial optimization typically encode constraints as soft penalties within the objective function, which can reduce efficiency and scalability compared to state-of-the-art classical methods that instead exploit constraints to guide the search toward high-quality solutions. Although solving this issue for an arbitrary problem is inherently a hard task, we address this challenge for a specific problem in the field of telecommunications, the multi-frequency antenna placement problem, by introducing a constraint-preserving quantum adiabatic algorithm (QAA). To this aim, we construct a quantum circuit that prepares an initial state comprising an equal superposition of all feasible solutions, and define a custom mixer that preserves both the one-hot encoding constraint for vertex coloring and the cardinality constraint on the number of antennas. This scheme can be extended to a broader range of applications characterized by similar constraints. We first benchmark the performance of this quantum algorithm against a basic version of QAA, demonstrating superior performance in terms of feasibility and success probability. We then apply this algorithm to large problem sizes with hundreds of variables using a constraint-aware decomposition method based on the SPLIT framework. Our results indicate competitive performance against other large-scale classical approaches, such as branch-and-bound and simulated annealing. This work supports previous claims that constraint-aware algorithms are crucial for the practical and efficient application of quantum methods in industrial settings.

quant-ph↗

arXiv2025

High-expressibility Quantum Neural Networks using only classical resources

Quantum neural networks (QNNs), as currently formulated, are near-term quantum machine learning architectures that leverage parameterized quantum circuits with the aim of improving upon the performance of their classical counterparts. In this work, we show that some desired properties attributed to these models can be efficiently reproduced without necessarily resorting to quantum hardware. We indeed study the expressibility of parametrized quantum circuit commonly used in QNN applications and contrast it to those of two classes of states that can be efficiently simulated classically: matrix-product states (MPS), and Clifford-enhanced MPS (CMPS), obtained by applying a set of Clifford gates to MPS. In addition to expressibility, we assess the level of primary quantum resources, entanglement and non-stabilizerness (a.k.a. "magic"), in random ensembles of such quantum states, tracking their convergence towards the Haar distribution. While MPS require a large number of parameters to effectively reproduce an arbitrary quantum state, we find that CMPS approach the Haar distribution more rapidly, in terms of both entanglement and magic. Our results on states with up to 20 qubits indicate that high expressibility in QNNs is attainable with purely classical resources.

quant-ph↗

arXiv2025

Parallel splitting method for large-scale quadratic programs

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-specific heuristics. To overcome these limitations, we introduce SPLIT, a general-purpose quantum-inspired framework for decomposing large-scale quadratic programs into smaller subproblems, which are then solved in parallel. SPLIT accounts for cross-interactions between subproblems, which are usually neglected in other decomposition techniques. The SPLIT framework can integrate generic subproblem solvers, ranging from standard branch-and-bound methods to quantum optimization algorithms. We demonstrate its effectiveness through comparisons with commercial solvers on the MaxCut and Antenna Placement Problems, with up to 20,000 decision variables. Our results show that SPLIT is capable of providing drastic reductions in computational time, while delivering high-quality solutions. In these regards, the proposed method is particularly suited for near real-time applications that require a solution within a strict time frame, or when the problem size exceeds the hardware limitations of dedicated devices, such as current quantum computers.

quant-ph↗

arXiv2024

Testing Quantum and Simulated Annealers on the Drone Delivery Packing Problem

Using drones to perform human-related tasks can play a key role in various fields, such as defense, disaster response, agriculture, healthcare, and many others. The drone delivery packing problem (DDPP) arises in the context of logistics in response to an increasing demand in the delivery process along with the necessity of lowering human intervention. The DDPP is usually formulated as a combinatorial optimization problem, aiming to minimize drone usage with specific battery constraints while ensuring timely consistent deliveries with fixed locations and energy budget. In this work, we propose two alternative formulations of the DDPP as a quadratic unconstrained binary optimization (QUBO) problem, in order to test the performance of classical and quantum annealing (QA) approaches. We perform extensive experiments showing the advantages as well as the limitations of quantum annealers for this optimization problem, as compared to simulated annealing (SA) and classical state-of-the-art commercial tools for global optimization.

math.CO↗

arXiv2023

Evaluating the Practicality of Quantum Optimization Algorithms for Prototypical Industrial Applications

The optimization of the power consumption of antenna networks is a problem with a potential impact in the field of telecommunications. In this work, we investigate the application of the quantum approximate optimization algorithm (QAOA) and the quantum adiabatic algorithm (QAA), to the solution of a prototypical model in this field. We use statevector emulation in a high-performance computing environment to compare the performance of these two algorithms in terms of solution quality, using selected evaluation metrics. We estimate the circuit depth scaling with the problem size while maintaining a certain level of solution quality, and we extend our analysis up to 31 qubits, which is rarely addressed in the literature. Our calculations show that as the problem size increases, the probability of measuring the exact solution decreases exponentially for both algorithms. This issue is particularly severe when we include constraints in the problem, resulting in full connectivity between the sites. Nonetheless, we observe that the cumulative probability of measuring solutions close to the optimal one remains high also for the largest instances considered in this work. Our findings keep the way open to the application of these algorithms, or variants thereof, to generate suboptimal solutions at scales relevant to industrial use-cases.

quant-ph↗

arXiv2023

Charge Density Wave Ordering in NdNiO$_2$: Effects of Multiorbital Nonlocal Correlations

In this work, we investigate collective electronic fluctuations and, in particular, the possibility of the charge density wave ordering in an infinite-layer NdNiO$_2$. We perform advanced many-body calculations for the ab-initio three-orbital model by taking into account local correlation effects, non-local charge and magnetic fluctuations, and the electron-phonon coupling. We find that in the considered material, electronic correlations are strongly orbital- and momentum-dependent. Notably, the charge density wave and magnetic instabilities originate from distinct orbitals. In particular, we show that the correlation effects lead to the momentum-dependent hybridization between different orbitals, resulting in the splitting and shifting of the flat part of the Ni-$d_{z^2}$ band. This strong renormalization of the electronic spectral function drives the charge density wave instability that is related to the intraband Ni-$d_{z^2}$ correlations. Instead, the magnetic instability stems from the Ni-$d_{x^2-y^2}$ orbital, which remains half-filled through the redistribution of the electronic density between different bands even upon hole doping. Consequently, the strength of the magnetic fluctuations remains nearly unchanged for the considered doping levels. We argue that this renormalization is not inherent to the stoichiometric case but can be induced by hole doping.

cond-mat.str-el↗

arXiv2023

Doping-dependent charge- and spin-density wave orderings in a monolayer of Pb adatoms on Si(111)

In this work we computed the phase diagram as a function of temperature and doping for a system of lead adatoms allocated periodically on a silicon (111) surface. This Si(111):Pb material is characterized by a strong and long-ranged Coulomb interaction, a relatively large value of the spin-orbit coupling, and a structural phase transition that occurs at low temperature. In order to describe the collective electronic behavior in the system, we perform many-body calculations consistently taking all these important features into account. We find that charge- and spin-density wave orderings coexist with each other in several regions of the phase diagram. This result is in agreement with the recent experimental observation of a chiral spin texture in the charge density wave phase in this material. We also find that geometries of the charge and spin textures strongly depend on the doping level. The formation of such a rich phase diagram in the Si(111):Pb material can be explained by a combined effect of the lattice distortion and electronic correlations.

cond-mat.str-el↗

arXiv2022

Multi-band D-TRILEX approach to materials with strong electronic correlations

We present the multi-band dual triply irreducible local expansion (D-TRILEX) approach to interacting electronic systems and discuss its numerical implementation. This method is designed for a self-consistent description of multi-orbital systems that can also have several atoms in the unit cell. The current implementation of the D-TRILEX approach is able to account for the frequency- and channel-dependent long-ranged electronic interactions. We show that our method is accurate when applied to small multi-band systems such as the Hubbard-Kanamori dimer. Calculations for the extended Hubbard, the two-orbital Hubbard-Kanamori, and the bilayer Hubbard models are also discussed.

cond-mat.str-el↗