arXiv subjects

Paolo Recchia

Publications and source records attributed to Paolo Recchia.

7 recordsLinked to original sources

arXiv2026

Quantum Quasi-Monte Carlo: a window for pre-asymptotic quantum advantage

Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy $\epsilon$ typically requires a number of function evaluations scaling as $O(1/\epsilon^2)$. Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require $2^q$ low discrepancy points, one can prepare a higher-resolution net of size $2^Q$, with $Q>q$, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.

quant-ph↗

arXiv2026

Q-Edge: Symmetry-Reduced Quantum Simulation of Structured Extreme Dependence

High-dimensional simulation of multivariate extremes is fundamentally limited by the combinatorial complexity of dependence, often more than by the scarcity of extreme observations. We show that symmetry admits a lossless orbit-space representation that preserves structured extreme dependence while replacing an exponentially large dependence space with a compact set of symmetry classes. Based on this principle, we develop Q-Edge (Quantum Extreme Dependence Engine), a symmetry-reduced quantum framework that operates directly in orbit space, enabling scalable simulation and digital twins of structured extreme systems. By transferring symmetry into the data representation rather than the quantum circuit, Q-Edge allows unconstrained quantum generative models to exploit dramatically reduced state spaces. For a 30-dimensional problem, approximately 1.6 million angular states collapse to 256 orbit states, reducing the required quantum representation from about 21 qubits to 8. Our results establish a general computational principle for scalable quantum simulation of structured extreme dependence.

quant-ph↗

arXiv2026

SAFE Quantum Machine Learning with Variational Quantum Classifiers

We propose a variational quantum classifier operating on high dimensional deep representations via amplitude encoding, stabilized by a learnable classical pre encoding layer.By combining normalized amplitude embeddings with bounded quantum observables, the resulting model induces a structured and smooth hypothesis class with controlled sensitivity to input variations. Model reliability is assessed using SAFE-AI metrics derived from the Cramer von Mises divergence, enabling consistent evaluation across accuracy, robustness, and explainability dimensions. Empirical results show that the proposed quantum model provides competitive predictive performance compared with strong classical baselines while exhibiting a more balanced SAFE reliability profile, with improved robustness to noise and stability under structured feature removal. These findings suggest that variational quantum circuits offer a principled mechanism for stability oriented SAFE learning in safety critical settings.

cs.LG↗

arXiv2026

Advancing Machine Learning Applications in Quantum Few-Body Systems

This paper presents a general neural network framework for solving quantum few-body systems, extending prior methods to handle diverse particle masses, interaction types, and system configurations. Our architecture, which combines an adaptive step size with the Metropolis-Adjusted Langevin Algorithm for Monte Carlo sampling, accurately approximates the ground-state wave functions of systems featuring harmonic confinement, Gaussian two-body interactions, and including three-body forces. In ten-particle systems, it achieves lower relative energy errors (with respect to the reference values) than previous machine-learning methods. Leveraging GPU-accelerated computation, the method scales favorably with system size while maintaining robust convergence, reduced hyperparameter sensitivity, and stable training. Beyond accurate energy estimation, the model captures spatial distributions and correlation structures, offering physical insights about inter-particle structure. By unifying applicability across identical and nonidentical particles, the proposed approach establishes a versatile computational tool for exploring complex few-body quantum systems, with significant implications for advancing computational models in few-body quantum systems.

physics.comp-ph↗

arXiv2025

Hybrid Quantum Neural Networks with Amplitude Encoding: Advancing Recovery Rate Predictions

Recovery rate prediction plays a pivotal role in bond investment strategies by enhancing risk assessment, optimizing portfolio allocation, improving pricing accuracy, and supporting effective credit risk management. However, accurate forecasting remains challenging due to complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes-conditions under which classical machine learning models are prone to overfitting. We propose a hybrid Quantum Machine Learning (QML) model with Amplitude Encoding, leveraging the unitarity constraint of Parametrized Quantum Circuits (PQC) and the exponential data compression capability of qubits. We evaluate the model on a global recovery rate dataset comprising 1,725 observations and 256 features from 1996 to 2023. Our hybrid method significantly outperforms both classical neural networks and QML models using Angle Encoding, achieving a lower Root Mean Squared Error (RMSE) of 0.228, compared to 0.246 and 0.242, respectively. It also performs competitively with ensemble tree methods such as XGBoost. While practical implementation challenges remain for Noisy Intermediate-Scale Quantum (NISQ) hardware, our quantum simulation and preliminary results on noisy simulators demonstrate the promise of hybrid quantum-classical architectures in enhancing the accuracy and robustness of recovery rate forecasting. These findings illustrate the potential of quantum machine learning in shaping the future of credit risk prediction.

q-fin.CP↗

arXiv2024

The Steepest Slope toward a Quantum Few-body Solution: Gradient Variational Methods for the Quantum Few-body Problem

Quantum few-body systems are deceptively simple. Indeed, with the notable exception of a few special cases, their associated Schrodinger equation cannot be solved analytically for more than two particles. One has to resort to approximation methods to tackle quantum few-body problems. In particular, variational methods have been proposed to ease numerical calculations and obtain precise solutions. One such method is the Stochastic Variational Method, which employs a stochastic search to determine the number and parameters of correlated Gaussian basis functions used to construct an ansatz of the wave function. Stochastic methods, however, face numerical and optimization challenges as the number of particles increases. We introduce a family of gradient variational methods that replace stochastic search with gradient optimization. We comparatively and empirically evaluate the performance of the baseline Stochastic Variational Method, several instances of the gradient variational method family, and some hybrid methods for selected few-body problems. We show that gradient and hybrid methods can be more efficient and effective than the Stochastic Variational Method. We discuss the role of singularities, oscillations, and gradient optimization strategies in the performance of the respective methods.

physics.comp-ph↗

arXiv2022

Subleading contributions to $N$-boson systems inside the universal window

We study bosonic systems in the regime in which the two-body system has a shallow bound state or, equivalently, a large value of the two-body scattering length. Using the effective field theory framework as a guide, we construct a series of potential terms which have decreasing importance in the description of the binding energy of the systems. The leading order potential terms consist of a two-body term, usually attractive, plus a three-body term, usually repulsive; this last term is required to prevent the collapse of systems with more than two particles. At this order, the parametrization of the two-body potential is done to obtain a correct description of the scattering length, which governs the dynamics in this regime, whereas the three-body term fixes a three-body datum. We investigate the role of the cut-off in the leading order description and we extend the exploration beyond the leading order by including the next-to-leading order terms in both, the two- and three-body potentials. We use the requirement of the stability of the N-body system, whose energy is variationally estimated, to introduce the three-body forces. The potential parametrization, as a function of the cut-off, is fixed to describe the energy of 4 He clusters up to seven particles within the expected accuracy. Finally, we also explore the possibility to describe at the same time the atom-dimer scattering length.

physics.atom-ph↗