Operator learning for efficient quantum computation
Open Access
- 27 October 2026
- journal article
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (4) , 045097
Abstract
An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation. This limits both the ability of near-term quantum hardware to simulate complex problems and the potential of fault-tolerant algorithms to achieve practical quantum advantage. To address this, we propose a framework that maps discrete operators onto compact, structured quantum circuits. The resulting variational circuits can be tailored to the connectivity and long-range interaction of the target hardware. The learning process employs backpropagation together with a cost function that efficiently optimizes unitary operators and non-unitary—dense or sparse—operators using only a single ancilla qubit for block encoding. Additionally, we introduce a regularization term that reduces the approximation error. The approach is validated for both quantum mechanical and engineering applications. In the former case, we learn propagators that arise in native quantum problems—such as quantum simulation and quantum chemistry—and achieve improved resource scaling in comparison to standard Suzuki–Trotter expansions. In the latter case, we demonstrate the approach’s ability to implement the second-order central finite difference approximation of the Laplace operator—relevant for solving partial differential equations—while improving upon current error metrics. The final example deals with learning a dense, non-unitary operator that arises in the analysis of inviscid potential flow around an airfoil. These results motivate the extension of the framework to a broader class of operator-synthesis problems beyond the prototypical engineering and quantum applications considered here.Keywords
Funding Information
- HORIZON EUROPE Digital, Industry and Space (101080085)
This publication has 79 references indexed in Scilit:
- Quantum-inspired tensor-network fractional-step method for incompressible flow in curvilinear coordinatesComputer Physics Communications, 2026
- Quantum Time‐Marching Algorithms for Solving Linear Transport Problems Including Boundary ConditionsInternational Journal for Numerical Methods in Engineering, 2026
- Boundary treatment for variational quantum simulations of partial differential equations on quantum computersComputers & Fluids, 2024
- Numerical Optimization2006
- Fermionic Quantum ComputationAnnals of Physics, 2002
- An Introduction to Fluid Dynamics2000
- Fractal decomposition of exponential operators with applications to many-body theories and Monte Carlo simulationsPhysics Letters A, 1990
- The finite group velocity of quantum spin systemsCommunications in Mathematical Physics, 1972
- Calculation of potential flow about arbitrary bodiesProgress in Aerospace Sciences, 1967
- Some remarks on the Pariser-Parr-Pople methodTheoretical Chemistry Accounts, 1964