arXiv subjects

Andrea Vinci

Publications and source records attributed to Andrea Vinci.

6 recordsLinked to original sources

arXiv2026

Assessing Projected Quantum Kernels for the Classification of IoT Data

The use of quantum computing for machine learning is among the most promising applications of quantum technologies. Quantum models inspired by classical algorithms are developed to explore some possible advantages over classical approaches. A primary challenge in the development and testing of Quantum Machine Learning (QML) algorithms is the scarcity of datasets designed specifically for a quantum approach. Existing datasets, often borrowed from classical machine learning, need modifications to be compatible with current quantum hardware. In this work, we utilize a dataset generated by Internet-of-Things (IoT) devices in a format directly compatible with the proposed quantum data process, eliminating the need for feature reduction. Among quantum-inspired machine learning algorithms, the Projected Quantum Kernel (PQK) stands out for its elegant solution of projecting the data encoded in the Hilbert space into a classical space. For a prediction task concerning office room occupancy, we compare PQK with the standard Quantum Kernel (QK) and their classical counterparts to investigate how different feature maps affect the encoding of IoT data. Our findings show that the PQK demonstrates comparable effectiveness to classical methods when the proposed shallow circuit is used for quantum encoding.

quant-ph↗

arXiv2025

Efficient Variational Quantum Algorithms for the Generalized Assignment Problem

Quantum algorithms offer a compelling new avenue for addressing difficult NP-complete optimization problems, such as the Generalized Assignment Problem (GAP). Given the operational constraints of contemporary Noisy Intermediate-Scale Quantum (NISQ) devices, hybrid quantum-classical approaches, specifically Variational Quantum Algorithms (VQAs) like the Variational Quantum Eigensolver (VQE), promises to be effective approaches to solve real-world optimization problems. This paper proposes an approach, named VQGAP, designed to efficiently solve the GAP by optimizing quantum resources and reducing the required parametrized quantum circuit width with respect to standard VQE. The main idea driving our proposal is to decouple the qubits of ansatz circuits from the binary variables of the General Assignment Problem, by providing encoding/decoding functions transforming the solutions generated by ansatze in the limited quantum space in feasible solutions in the problem variables space, by exploiting the constraints of the problem. Preliminary results, obtained through both noiseless and noisy simulations, indicate that VQGAP exhibits performance and behavior very similar to VQE, while effectively reducing the number of qubits and circuit depth.

quant-ph↗

arXiv2024

Variational Quantum Algorithms for the Allocation of Resources in a Cloud/Edge Architecture

Modern Cloud/Edge architectures need to orchestrate multiple layers of heterogeneous computing nodes, including pervasive sensors/actuators, distributed Edge/Fog nodes, centralized data centers and quantum devices. The optimal assignment and scheduling of computation on the different nodes is a very difficult problem, with NP-hard complexity. In this paper, we explore the possibility of solving this problem with Variational Quantum Algorithms, which can become a viable alternative to classical algorithms in the near future. In particular, we compare the performances, in terms of success probability, of two algorithms, i.e., Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). The simulation experiments, performed for a set of simple problems, %CM230124 that involve a Cloud and two Edge nodes, show that the VQE algorithm ensures better performances when it is equipped with appropriate circuit \textit{ansatzes} that are able to restrict the search space. Moreover, experiments executed on real quantum hardware show that the execution time, when increasing the size of the problem, grows much more slowly than the trend obtained with classical computation, which is known to be exponential.

quant-ph↗

arXiv2023

Assessing Quantum Computing Performance for Energy Optimization in a Prosumer Community

The efficient management of energy communities relies on the solution of the "prosumer problem", i.e., the problem of scheduling the household loads on the basis of the user needs, the electricity prices, and the availability of local renewable energy, with the aim of reducing costs and energy waste. Quantum computers can offer a significant breakthrough in treating this problem thanks to the intrinsic parallel nature of quantum operations. The most promising approach is to devise variational hybrid algorithms, in which quantum computation is driven by parameters that are optimized classically, in a cycle that aims at finding the best solution with a significant speed-up with respect to classical approaches. This paper provides a reformulation of the prosumer problem, allowing to address it with a hybrid quantum algorithm, namely, Quantum Approximate Optimization Algorithm (QAOA), and with a recent variant, the Recursive QAOA. We report on an extensive set of experiments, on simulators and real quantum hardware, for different problem sizes. Results are encouraging in that Recursive QAOA is able, for problems involving up to 10 qubits, to provide optimal and admissible solutions with good probabilities, while the computation time is nearly independent of the system size

quant-ph↗

arXiv2023

Optimal Coordination and Discount Allocation in Residential Renewable Energy Communities with Smart Home Appliances

This paper proposes an optimal management strategy for a Renewable Energy Community defined according to the Italian legislation. The specific case study is composed by a set of houses equipped with smart appliances, that share a PV plant. The objective is to minimize the cost of electrical energy use for each member of the community, taking into account the discount achievable from government incentives with proper shaping of the community daily consumption. Such incentives are indeed proportional to the shared energy, i.e. the portion of the renewable energy consumed at each hour by community members. The management algorithm allows an optimal coordination of houses power demands, according to the degree of flexibility granted by users. Moreover, a policy to fairly distribute the obtained discount is introduced. Simulation results show the potentialities of the approach.

eess.SY↗

arXiv2022

A Backside-Illuminated Charge-Focusing Silicon SPAD with Enhanced Near-Infrared Sensitivity

A backside-illuminated (BSI) near-infrared enhanced silicon single-photon avalanche diode (SPAD) for time-of-flight (ToF) light detection and ranging applications is presented. The detector contains a 2 $μ$m wide multiplication region with a spherically-uniform electric field peak enforced by field-line crowding. A charge-focusing electric field extends into a 10 $μ$m deep absorption volume, whereby electrons generated in all corners of the device can move efficiently towards the multiplication region. The SPAD is integrated with a customized 130 nm CMOS technology and a dedicated BSI process. The device has a pitch of 15 $μ$m, which has the potential to be scaled down without significant performance loss. Furthermore, the detector achieves a photon detection efficiency of 27% at 905 nm, with an excess bias of 3.5 V that is controlled by integrated CMOS electronics, and a timing resolution of 240 ps. By virtue of these features, the device architecture is well-suited for large format ToF imaging arrays with integrated electronics.

physics.ins-det↗