AI & ML
Quantitative Universal Approximation for Noisy Quantum Neural Networks
arXiv cs.NA0 views
arXiv:2604.02064v4 Announce Type: replace-cross Abstract: We prove a quantitative universal approximation theorem for noisy quantum neural networks (QNNs), with explicit non-asymptotic error bounds in terms of the number of accuracy blocks, the qubit count, the number of two-qubit gates, and hardware noise parameters. Motivated by quantitative finance, where target functions are expectations of payoffs, we first extend existing noiseless bounds to expectation functions and derive explicit constants for exponential Levy models, covering the Black-Scholes price of (truncated) European Put options. We then formulate the noisy circuit via quantum channels, obtain a fidelity-based bound for general noise models, and specialise to depolarising noise with readout error, calibrated to real hardware. Finally, we provide a detailed numerical analysis for option pricing in the Black-Scholes model, testing our results on actual noisy quantum hardware.
Source:https://arxiv.org/abs/2604.02064PreviousVertex interpolation by bivariate $C^1$ cubic splines: counterexamples, geometric stability, and indecomposable defectsNextDeepRitzSplit: A Variational Neural Operator Framework for Gradient Flows with Application to Dendritic Growth
Related posts
How much of GPT-6 Astra's weight-editing demo is the harness?
0dev.to Machine Learning
How Pet Groomers Can Track Appointments, Pet Notes and Rebookings
0dev.to Tutorial
Symmetrical Components in Plain English: Fortescue Without the Fog
0dev.to Tutorial
When P2P Pays You and the Account Freezes Anyway
0dev.to Career
Your Company Will Pay for the Course if You Agree to Pay It Back When You Leave
0dev.to Career
Massachusetts Layoffs November 2026: WARN Numbers Explained
0dev.to Career