Asymptotic Expansions for Neural Network Approximations of Quantum Channels

• URL: http://arxiv.org/abs/2603.18033v1
• Date: Mon, 09 Mar 2026 18:12:57 GMT
• Title: Asymptotic Expansions for Neural Network Approximations of Quantum Channels
• Abstract summary: This paper establishes the Quantum Voronovskaya--Damasclin (QVD) Theorem, providing a complete characterization of Quantum Neural Network Operators.<n>We introduce quantum analogues of Sobolev and Hlder spaces defined through Fréchet differentiability in the Liouville representation.<n>Within this framework, we derive an explicit expansion of the approximation error and identify the fundamental mechanisms governing convergence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: This paper establishes the Quantum Voronovskaya--Damasclin (QVD) Theorem, providing a complete asymptotic characterization of Quantum Neural Network Operators in the approximation of arbitrary quantum channels. The result extends the classical Voronovskaya theorem from scalar approximation to the non-commutative operator framework of quantum information theory. We introduce rigorous quantum analogues of Sobolev and Hölder spaces defined through Fréchet differentiability in the Liouville representation and measured using the completely bounded (diamond) norm. Within this framework, we derive an explicit asymptotic expansion of the approximation error and identify the fundamental mechanisms governing convergence. The expansion separates integer-order differential contributions, fractional corrections associated with limited regularity, and intrinsically non-commutative effects arising from operator algebra structure. We also establish a sharp remainder estimate with explicit dependence on the regularity of the channel and the dimension of the underlying Hilbert space. Several applications demonstrate the scope of the theory. These include a quantum central limit theorem describing the fluctuation regime of quantum neural network operators, an optimal interpolation method based on operator geometric means, and a convergence acceleration procedure inspired by Richardson extrapolation. The results provide a rigorous mathematical foundation for the asymptotic analysis of quantum neural network models and establish a direct connection between classical approximation theory, operator algebras, and quantum information science, with implications for quantum algorithms and quantum machine learning.

Related papers

• A Non-Commutative Voronovskaya Theorem for Quantum Neural Network Operators [0.0]
  We prove a complete expansion for quantum neural network operators when they approximate arbitrary quantum channels.<n>We present a numerical test for a classical analogue that confirms the predicted convergence rate and the logarithmic correction.<n>Our work builds a rigorous bridge between classical approximation theory, fractional calculus, and quantum machine learning.
  arXiv  Detail & Related papers  (2026-07-01T15:34:45Z)
• Quantum simulation of the Liouville equation in classical mechanics with discontinuous potential via Schrödingerization [42.22857110018992]
  We develop quantum simulation algorithms for the Liouville equation of classical mechanics with discontinuous potential.<n>We combine Hamiltonian-preserving schemes by Jin and Wen in Commun. Math. Sci. 3(3), 285-315 (2005) with the Schrdingerization method, which embeds the resulting nonunitary semi-discrete dynamics into a unitary Schrdinger type system.
  arXiv  Detail & Related papers  (2026-06-13T02:49:05Z)
• A PAC-Bayesian approach to generalization for quantum models [0.9543943371833464]
  We provide the first PAC-Bayesian generalization bounds for a broad class of quantum models.<n>This work provides actionable model design insights and establishes a foundational tool for a more nuanced understanding of generalization in quantum machine learning.
  arXiv  Detail & Related papers  (2026-03-24T08:58:54Z)
• Performance Guarantees for Quantum Neural Estimation of Entropies [31.955071410400947]
  Quantum neural estimators (QNEs) combine classical neural networks with parametrized quantum circuits.<n>We study formal guarantees for QNEs of measured relative entropies in the form of non-asymptotic error risk bounds.<n>Our theory aims to facilitate principled implementation of QNEs for measured relative entropies.
  arXiv  Detail & Related papers  (2025-11-24T16:36:06Z)
• Schrodinger Neural Network and Uncertainty Quantification: Quantum Machine [0.0]
  We introduce the Schrodinger Neural Network (SNN), a principled architecture for conditional density estimation and uncertainty.<n>The SNN maps each input to a normalized wave function on the output domain and computes predictive probabilities via the Born rule.
  arXiv  Detail & Related papers  (2025-10-27T15:52:47Z)
• Path integral approach to quantum thermalization [39.25860941747971]
  We introduce a quasiclassical Green function approach describing the unitary yet irreversible dynamics of quantum systems.<n>We show that it is capable of describing a wide range of system classes and disorder models.<n>We present our formalism in a self-contained and pedagogical manner, aiming to provide a transferable toolbox for the first-principles description of many-body chaotic quantum systems.
  arXiv  Detail & Related papers  (2025-09-07T12:10:48Z)
• Generalization Bounds for Quantum Learning via Rényi Divergences [45.45698347373077]
  This work advances the theoretical understanding of quantum learning by establishing a new family of upper bounds on the expected generalization error of quantum learning algorithms.<n>Our primary contribution is the derivation of these bounds in terms of quantum and classical R'enyi divergences.
  arXiv  Detail & Related papers  (2025-05-16T09:21:31Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Assessing the query complexity limits of quantum phase estimation using symmetry aware spectral bounds [0.0]
  computational cost of quantum algorithms for physics and chemistry is closely linked to the spectrum of the Hamiltonian. We introduce a hierarchy of symmetry-aware spectral bounds that provide a unified understanding of the performance of quantum phase estimation algorithms.
  arXiv  Detail & Related papers  (2024-03-07T18:38:49Z)
• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory [44.99833362998488]
  We introduce quantum algorithms that can efficiently simulate certain classes of interactions consisting of correlated changes in multiple quantum numbers. The lattice gauge theory studied is the SU(2) gauge theory in 1+1 dimensions coupled to one flavor of staggered fermions. The algorithms are shown to be applicable to higher-dimensional theories as well as to other Abelian and non-Abelian gauge theories.
  arXiv  Detail & Related papers  (2022-12-28T18:56:25Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions [9.428671399402553]
  We extend three related results from the analysis of influences of Boolean functions to the quantum inequality setting. Our results are derived by a joint use of recently studied hypercontractivity and gradient estimates. We comment on the implications of our results as regards to noncommutative extensions of isoperimetric type inequalities, quantum circuit complexity lower bounds and the learnability of quantum observables.
  arXiv  Detail & Related papers  (2022-09-15T13:12:32Z)
• Neural Networks and Quantum Field Theory [0.0]
  We propose a theoretical understanding of neural networks in terms of Wilsonian effective field theory. The correspondence relies on the fact that many neural networks are drawn from Gaussian processes.
  arXiv  Detail & Related papers  (2020-08-19T18:00:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.