Home banking and digital payments diffusion has greatly increased in recent years. As a result, fraud has also dramatically grown, resulting in the loss of billions of dollars worldwide every year. Therefore, banks and financial institutions are required to offer clients increasingly effective and sophisticated services for illegal transaction detection. Machine learning strategies are commonly employed for this crucial application. However, classical models are not satisfactory enough in highly unbalanced classification tasks like fraud detection. Quantum machine learning, working intrinsically in a higher dimensional computation space thanks to superposition and entanglement, can express more complex models than its classical counterpart and thus could provide a significant advantage in identifying potential illegal transactions. This work aims to analyze the potential of quantum classifiers in the fraud detection context, focusing on the Variational Quantum Circuit (VQC) model. The study has been led by exploiting a dataset based on real transactions provided by Intesa Sanpaolo of 500000 items with 15 features. Considering the limitations of contemporary Noisy Intermediate-Scale Quantum (NISQ) computers and quantum simulators, the dataset has been reduced in the number of transactions and features, exploiting Principal Component Analysis (PCA). The results obtained have been compared on equal terms with those of the most commonly employed classical methods, such as Logistic Regression, Random Forest, XGBoost, Support Vector Machine, and Neural Networks, obtaining a better classification quality in terms of recall. Even though this work is preliminary, the results are encouraging and prove the quantum models’ potential in highly unbalanced classification tasks.

Credit risk analysis (CRA) quantum algorithms aim at providing a quadratic speedup over classical analogous methods. Despite this, experts in the business domain have identified significant limitations in the existing approaches. Thus, we proposed a new variant of the CRA quantum algorithm to address these limitations. In particular, we improved the risk model for each asset in a portfolio by enabling it to consider multiple systemic risk factors, resulting in a more realistic and complex model for each asset’s default probability. Additionally, we increased the flexibility of the loss-given-default input by removing the constraint of using only integer values, enabling the use of real data from the financial sector to establish fair benchmarking protocols. Furthermore, all proposed enhancements were tested both through classical simulation of quantum hardware and, for this new version of our work, also using QPUs from IBM Quantum Experience in order to provide a baseline for future research. Our proposed variant of the CRA quantum algorithm addresses the significant limitations of the current approach and highlights an increased cost in terms of circuit depth and width. In addition, it provides a path to a substantially more realistic software solution. Indeed, as quantum technology progresses, the proposed improvements will enable meaningful scales and useful results for the financial sector.

Quantum Computing (QC) promises to revolutionize the computing domain with its ability to outperform classical computing in various applications. This article explores the potential of QC and its impact on the financial industry, among other domains. It focuses on the Quantum Competence Center at Intesa Sanpaolo, the largest bank in Italy. The Quantum Competence Center aims at leveraging quantum technologies to drive innovation and enhance banking and financial services. This article discusses the establishment of this corporate entity, its objectives, collaborations with academic institutions and quantum providers, workforce development initiatives, future perspectives, and the challenge of integrating quantum computing into the bank's operational workflow.

This work introduces a novel approach to price rainbow options, a type of path-independent multi-asset derivatives, with quantum computers. Leveraging the Iterative Quantum Amplitude Estimation method, we present an end-to-end quantum circuit implementation, emphasizing efficiency by delaying the transition to price space. Moreover, we analyze two different amplitude loading techniques for handling exponential functions. Experiments on the IBM QASM simulator validate our quantum pricing model, contributing to the evolving field of quantum finance.

The optimization of investment portfolios represents a pivotal task within the field of financial economics. Its objective is to identify asset combinations that meet specified criteria for return and risk. Traditionally, the maximization of the Sharpe Ratio, often achieved through quadratic programming, has constituted a popular approach for this purpose. However, real-world scenarios frequently necessitate more complex considerations, particularly in relation to portfolio diversification with a view to mitigating sector-specific risks and enhancing stability. The incorporation of diversification alongside the Sharpe Ratio into the optimization model creates a joint optimization task, which can be formulated as Quadratic Unconstrained Binary Optimization (QUBO) and addressed using quantum annealing or hybrid computing techniques. These techniques offer promising solutions. We present a novel QUBO formulation for this optimization, detailing its mathematical formulation and demonstrating its advantages over classical methods, particularly in handling diversification objectives. By leveraging available QUBO solvers and hybrid approaches, we explore the feasibility of handling large-scale problems while highlighting the importance of diversification in achieving robust portfolio performance. We finally elaborate on the results showing the trade-off between the observed values of the portfolio’s Sharpe Ratio and diversification, as a natural consequence of solving a multi-objective optimization problem.

Noisy and Intermediate-Scale Quantum, or NISQ, processors are sensitive to noise, prone to quantum decoherence, and are not yet capable of continuous quantum error correction for fault-tolerant quantum computation. Hence, quantum algorithms designed in the pre-fault-tolerant era cannot neglect the noisy nature of the hardware, and investigating the relationship between quantum hardware performance and the output of quantum algorithms is essential. In this work, we experimentally study how hardware-aware variational quantum circuits on a superconducting quantum processing unit can model distributions relevant to specific use-case applications for Credit Risk Analysis, e.g., standard Gaussian distributions for latent factor loading in the Gaussian Conditional-Independence model. We use a transpilation technique tailored to the specific quantum hardware topology, which minimizes gate depth and connectivity violations, and we calibrate the gate rotations of the circuit to achieve an optimized output from quantum algorithms. Our results demonstrate the viability of quantum adaptation on a small-scale, proof-of-concept model inspired by financial applications and offer a good starting point for understanding the practical use of NISQ devices.