Quantum Neural Networks Learn the Math Behind Optimal Portfolios

Partial differential equations sit at the heart of modern financial mathematics, and one of their most demanding assignments is portfolio optimization. Researchers at Université Paris-Saclay have now explored whether quantum circuits can help solve these equations more efficiently. In a study published in Quantum Machine Intelligence, Letao Wang, Abdel Lisser, Sreejith Sreekumar and Zeno Toffano describe a family of quantum and quantum-inspired physics-informed neural networks designed to learn the solutions of PDEs that govern optimal investment decisions.

Physics-informed neural networks, or PINNs, are a class of machine learning models that embed the governing equations of a physical or financial system directly into their training objective. Instead of relying purely on data, a PINN is penalized when its output violates the differential equation it is meant to solve. The Paris-Saclay team asked what happens when the network that represents the PDE solution is built not from classical neurons but from parameterized quantum circuits, which manipulate quantum states through adjustable gate operations.

The central technical contribution is a parameterized quantum circuit constructed to implement a polynomial based on tensor rank decomposition. This mathematical technique breaks a complicated multivariable function into a sum of simpler separable components. By encoding that structure into the quantum circuit, the researchers reduced the quantum resource complexity from exponential to polynomial, provided the corresponding tensor rank remains moderate. In practical terms, the number of quantum gates and qubits needed no longer explodes with problem size, as long as the solution has exploitable structure.

Building on this circuit, the team developed two related models: a quantum physics-informed neural network, or QPINN, and a Quantum-inspired PINN that mimics the same architecture on classical hardware. Both models carry a theoretical guarantee that an approximation of the PDE solution exists, and that approximation can be written as a polynomial incorporating tensor rank decomposition. This means the models are not merely heuristic; the mathematical form of the solution they seek is provably within their representational reach.

To test the approach, the researchers turned to a benchmark problem from financial mathematics: the Hamilton–Jacobi–Bellman equation arising from the Merton portfolio optimization problem. This PDE determines the optimal fraction of wealth an investor should allocate between a risky asset and a risk-free asset, a foundational question in continuous-time finance. Solving it accurately and quickly is valuable both for theory and for practical asset allocation.

The numerical experiments compared the quantum models against a classical fully connected PINN on this HJB problem. The results showed that the quantum models achieved lower losses and lower approximation errors than the classical baseline while using substantially fewer trainable parameters. Fewer parameters translate directly into smaller memory footprints and potentially faster training, which matters when the model must be evaluated repeatedly across a grid of time and wealth states.

The comparison went a step further. The team also constructed a classical PINN engineered to share a similar inductive bias with the quantum models, meaning it was given comparable structural assumptions about the solution. Even against this strengthened classical competitor, the quantum models performed better in the tested settings. The authors describe this as experimental evidence of a quantum-induced improvement, while carefully noting that the advantage was demonstrated in the specific configurations they tested rather than proven universally.

The significance of the work lies in its resource efficiency. Near-term quantum devices, often called noisy intermediate-scale quantum hardware, have limited numbers of qubits and short coherence times, so algorithms that demand exponential resources are out of reach. By showing that a structured polynomial representation can keep resource requirements polynomial, the study outlines a pathway toward PDE solvers that could run on both classical hardware and near-term quantum machines. The researchers suggest this is particularly relevant for PDEs whose solutions have exploitable structure, a condition satisfied by several important equations in finance and physics.

For portfolio optimization specifically, the Merton problem serves as a proving ground because its solution is well understood, making errors easy to quantify. The finding that quantum and quantum-inspired networks can approximate this solution with fewer parameters hints at a future where hybrid quantum-classical pipelines assist in solving the high-dimensional PDEs that arise when portfolios contain many assets. The study, published as a research article in Volume 8 of Quantum Machine Intelligence, marks a step in that direction, though the authors frame their results as evidence gathered in tested settings rather than a general demonstration of quantum superiority.

Subject of Research: Quantum physics-informed neural networks for solving PDEs in portfolio optimization

Article Title: Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks

Article References: Wang, L., Lisser, A., Sreekumar, S., & Toffano, Z. (2026). Learning PDEs for Portfolio Optimization with Quantum Physics-Informed Neural Networks. Quantum Machine Intelligence, 8(2), Article 119. https://doi.org/10.1007/s42484-026-00466-6

Image Credits: AI Generated

DOI: 10.1007/s42484-026-00466-6

Keywords: quantum computing, physics-informed neural networks, partial differential equations, portfolio optimization, Merton problem, Hamilton–Jacobi–Bellman, tensor rank decomposition, parameterized quantum circuits, financial mathematics, machine learning, Learning, PDEs