Francesca Cibrario

2papers

2 Papers

61.7QUANT-PHJun 3
Digital Quantum Reservoir Computing for ATM Time Series Prediction

Chiara Vercellino, Giacomo Vitali, Valeria Zaffaroni et al.

We investigate a digital quantum reservoir computing (QRC) framework for multi-step forecasting of automated teller machine (ATM) cash demand time series on near-term quantum devices. The proposed approach uses parametrized four-qubit reservoirs with a fixed structure exploiting partial measurement and reset, where temporal data is encoded in rotation angles. Training is restricted to a classical Ridge-regression readout. We systematically analyze the impact of the circuit ansatzë, reservoir memory, measurement-derived observables, and the execution backend on the forecasting performance. Experiments are performed with noiseless simulation, noise-aware emulation, and a real IQM Spark quantum processor. Although the QRC models do not outperform the classical Prophet benchmark in terms of Mean Absolute Error and Normalized Mean Squared Error metrics, they achieve more competitive results in Dynamic Time Warping metric, indicating a partial ability to capture temporal structure. These findings provide an empirical assessment of digital QRC for realistic financial forecasting and highlight both its current limitations and its potential on near-term quantum hardware.

25.4ETMar 27
A new approach to rating scale definition with quantum-inspired optimization

Patrizio Spada, Laura Cappelli, Francesca Cibrario et al.

In finance, assessing the creditworthiness of loan applicants requires lenders to cluster borrowers using rating scales. Financial institutions must define the scales in compliance with strict institutional constraints, resulting in solving a complex combinatorial constrained optimization problem. This contribution studies how to solve this problem using a Quadratic Unconstrained Binary Optimization (QUBO) model, a formulation suitable for quantum hardware. We validate this approach by testing the proposed formulation with classical heuristics. We then benchmark the results against a brute-force method to demonstrate consistent solution quality and highlight the framework's suitability for more complex scenarios.