Submitted:
20 May 2026
Posted:
21 May 2026
You are already at the latest version
Abstract
Keywords:
MSC: 41A60; 47L90; 81P45; 46L07
1. Introduction
2. Mathematical Framework
2.1. Quantum Channels and Their Smoothness
Fréchet differentiability.
Norms for maps.
2.2. Quantum Neural Network Operators
3. The Quantum Voronovskaya–Damasclin Theorem
- 1.
- Parity: If is odd, then .
- 2.
- Even integer moments: If is even, then
- 3.
- Fractional moments of order : For any ,
- 4.
- Mixed fractional moments of order : Similarly,
- Integer moments.
- Fractional moments.
- The Taylor remainders and . Their diamond-norm is bounded by . The kernel is localised on a scale , so the number of lattice points k within the effective support is . Summing the bounds over these k gives a total of .
- The aliasing errors and , which are for any M and thus negligible.
- The error from replacing exact moments by their asymptotic expansions is of order or higher and can be absorbed into the remainder.
- Higher-order fractional terms (with ) are of order and are also absorbed.
3.1. Quantum Central Limit Theorem for QNNOs
3.2. Optimal Quantum Interpolation via Geodesics
3.3. Quantum Richardson Extrapolation
4. Results and Discussion
- Integer-order polynomial terms. These arise from the standard Fréchet derivatives of the channel and the even integer moments of the kernel . Because the kernel is even, all odd integer moments vanish identically; consequently, the leading polynomial correction for sufficiently smooth channels is of order . This term is the direct quantum analogue of the classical Voronovskaya expansion for Bernstein polynomials, with the second derivative replaced by the second Fréchet derivative of the Liouville representation.
- Fractional corrections. These capture the effect of Hölder regularity of order and involve the Marchaud fractional derivative . They dominate the asymptotic error whenever , i.e., when the channel is not twice Fréchet differentiable in the classical sense. For a channel belonging to , the leading error term scales as , which is slower than the classical rate when . This fractional contribution has no direct counterpart in the theory of Bernstein polynomials and reflects the intrinsic fractional smoothness of the channel.
- Mixed non-commutative terms. These originate from the product of two fractional derivatives and are intrinsically quantum mechanical: they involve the -deformed commutator . This term vanishes identically when the channel is classical (i.e., when its Fréchet derivatives commute), and it has no analogue in classical approximation theory. Its presence reflects the non-commutative geometry of the space of quantum channels and the fact that fractional derivatives do not commute in the operator-valued setting.
- For with , the optimal convergence rate is exactly ; the saturation class (i.e., channels for which the rate is faster) consists of those satisfyingwhich is equivalent to the vanishing of the leading quadratic term in the expansion. This condition is automatically satisfied for channels that are affine in the state (e.g., unitary conjugations) but fails for generic nonlinear channels.
- When (Lipschitz first derivative, hence classical twice differentiability), the rate becomes , which coincides with the classical Voronovskaya rate. For analytic channels (i.e., channels whose Fréchet derivatives of all orders exist and are bounded), the expansion contains only even integer powers, and the Richardson extrapolation can in principle accelerate to arbitrarily high order. However, the bandwidth introduces a logarithmic saturation: the effective order of convergence is limited by , which cannot be overcome by simply increasing m.
- The quantum central limit theorem (Theorem 2) shows that the fluctuations of the QNNO around its mean are asymptotically Gaussian, with a covariance operator determined by the second Fréchet derivatives of the channel. This result is essential for statistical inference with quantum neural networks, including quantum tomography, hypothesis testing, and error bars for quantum machine learning models.
- The optimal interpolation scheme using Kubo–Ando geodesics (Corollary ??) provides a constructive method to generate smooth paths between quantum channels with an error of order . This is particularly relevant for adiabatic quantum computing and for the design of variational quantum circuits where one needs to interpolate between two target channels.
- The quantum Richardson extrapolation method (Theorem ??) reveals a fundamental limitation: fractional smoothness prevents acceleration beyond order . This is a purely quantum phenomenon because in the classical case one can recover the full Romberg convergence (exponential acceleration). The presence of fractional terms in the expansion thus imposes a practical ceiling on the accuracy achievable by extrapolation techniques.
5. Conclusions
Limitations of the Present Work
- Finite-dimensional Hilbert space. The entire analysis assumes . While this is the standard setting for finite-dimensional quantum information, many important quantum systems (e.g., continuous-variable systems, quantum fields) require infinite dimensions. Extending the framework to infinite dimensions would require overcoming technical obstacles such as the lack of trace-norm compactness of the unit ball and the need to define Fréchet derivatives on unbounded operator algebras.
- Strict positivity of the reference state. The expansion requires (strictly positive). For states on the boundary of (e.g., pure states), the uniform bound fails because some would allow deviations of order 1 rather than . Consequently, the error analysis does not directly apply. The result likely still holds by continuity and approximation, but a separate analysis is needed.
- Choice of bandwidth. We fixed based on a bias-variance heuristic. While this choice yields the fastest possible rate for Hölder channels under the given assumptions, it is not adaptive: the optimal bandwidth should depend on the unknown regularity parameters . An adaptive procedure (e.g., cross-validation or Lepski’s method) would be more practical but lies outside our current analysis.
- Logarithmic factor in the remainder. The bound contains , which may not be optimal. Numerical experiments on simple channels (e.g., the depolarising channel) suggest that the true error is without logarithmic corrections, but proving this would require a much more delicate estimation of the aliasing terms in the non-commutative Poisson summation formula and a tighter control on the effective number of lattice points.
- Assumption of Fréchet differentiability. Many quantum channels of practical interest (e.g., the amplitude damping channel) are not Fréchet differentiable on the whole state space due to eigenvalue crossing or non-smooth dependence on parameters. Our theory applies only to channels that are sufficiently smooth in the operator norm sense. Extending to non-differentiable channels would require tools from nonsmooth analysis or finite-difference approximations.
- Computational cost. The QNNO defined in (15) involves a sum over the simplex which contains terms. For large d or large n, this becomes prohibitive. The kernel is localised in the variable , but this does not directly reduce the number of terms because the sum runs over all regardless of the auxiliary operators X. In practice, one would choose the auxiliary operators to have a finite set of eigenvalues (e.g., a finite-dimensional auxiliary space), which restricts the relevant k to those near n times those eigenvalues. Even then, the worst-case complexity remains exponential in d unless additional structure (e.g., product form) is exploited. Efficient sampling or quantum circuit implementations are needed for practical use.
- Measurement of the auxiliary system. The quantum central limit theorem (Theorem 2) assumes that we can measure the commuting observables exactly, i.e., that we have access to the ideal distribution induced by . In a real quantum device, such measurements are subject to noise, finite precision, and imperfect state preparation. A robustness analysis under realistic noise models is required.
Future Research Directions
- Infinite-dimensional systems. Extending the asymptotic expansion to continuous variable quantum channels (e.g., Gaussian channels) would require replacing the finite simplex with an infinite lattice in , using tools from harmonic analysis on and the theory of unbounded operators. The kernel already admits a natural extension, but the Poisson summation formula becomes more delicate due to the absence of a natural discretisation of the state space.
- Adaptive bandwidth selection. The regularity parameters are typically unknown in practice. One could design a Lepski-type procedure that selects (or equivalently, a sequence n) adaptively to achieve the optimal rate without prior knowledge of the smoothness. The asymptotic expansion provides the precise constants needed for such a method, including the leading coefficients and the remainder bound.
- Quantum wavelet approximations. The kernel resembles a scaling function in a multiresolution analysis: it is even, positive, integrates to the identity, and its Fourier transform decays super-exponentially. By choosing appropriately (e.g., ) and constructing wavelet bases from it, one could obtain a quantum wavelet approximation theory with similar asymptotic expansions. This would enable sparse representations of quantum channels and efficient denoising algorithms.
- Applications to quantum machine learning. The quantum central limit theorem can be used to design hypothesis tests for whether a given quantum channel belongs to a certain class (e.g., whether it is unitary). The Richardson extrapolation method can accelerate the convergence of variational quantum algorithms, where each evaluation of corresponds to a circuit of depth . This could lead to practical speedups on near-term devices, especially for optimisation tasks.
- Experimental validation. The asymptotic predictions (e.g., the leading term for smooth channels) could be tested on small-scale quantum processors. One would need to implement the QNNO for a simple channel (e.g., the depolarising channel) using a classical emulation or a real device, and measure the approximation error for increasing n. The logarithmic factor might be detectable with high-precision experiments if the constant is not too small.
- Non-differentiable channels. For channels that are only Hölder continuous with exponent (i.e., not differentiable at all), the expansion would contain only fractional terms and the integer part would be absent. Developing a fractional Taylor expansion directly for such maps would require a different approach, possibly using the theory of pseudo-differential operators on operator algebras or the concepts of fractional derivatives in the sense of Caputo or Riemann–Liouville.
- Relaxing the commutativity assumption. The kernel relies on commuting auxiliary operators to factorise as a tensor product of one-dimensional kernels. In a fully quantum setting, one could consider non-commuting kernels, leading to a whole new family of QNNOs with potentially different approximation properties. This would connect to non-commutative geometry, quantum Lévy processes, and the theory of free probability.
Appendix A. Technical Lemmas: Detailed Proofs
Appendix A.1. Derivation of the Explicit Constant
- Taylor remainder: The Beta integral combines with the factor to give after simplification.
- Dimension factor: From we obtain (using ).
- Poisson summation error: Aliasing is bounded by after a smooth cutoff, contributing a factor .
- Lattice points: Kernel localisation on scale gives relevant points; with and three error sources, we get .
- Combinatorial factor: Number of multi-indices ; summing over yields .
- Gaussian approximation: The kernel differs from a Gaussian by at most , giving a correction factor .
Appendix A.2. Marchaud Fractional Derivative
Appendix A.3. Poisson Summation Error Bound
List of Symbols
| finite-dimensional Hilbert space | |
| algebra of bounded linear operators on | |
| convex set of density operators (quantum states) | |
| set of completely positive trace-preserving maps (quantum channels) | |
| Liouville representation of a channel | |
| diamond norm (completely bounded trace norm) | |
| completely bounded norm (cb-norm) | |
| quantum Hölder space of order | |
| Hölder seminorm of | |
| Quantum Neural Network Operator (QNNO) | |
| quantum kernel with bandwidth | |
| discrete simplex | |
| quantised density operator | |
| operator-valued moments of the kernel | |
| scalar moments (leading asymptotics given in Lemma 2) | |
| Marchaud fractional derivative of order | |
| -deformed commutator | |
| coefficients in the asymptotic expansion (Theorem 1) | |
| remainder term in the expansion | |
| explicit constant in the remainder estimate | |
| Gamma function | |
| multinomial coefficient | |
| multinomial coefficient for bipartition | |
| Hilbert–Schmidt inner product | |
| trace norm (nuclear norm) | |
| identity operator on the auxiliary space |
References
- Voronovskaja, E. (1932). Détermination de la forme asymptotique d’approximation des fonctions par les polynômes de M. Bernstein. CR Acad. Sci. URSS, 79, 79-85.
- Kubo, F., & Ando, T. (1980). Means of positive linear operators. Mathematische Annalen, 246(3), 205-224. [CrossRef]
- Amari, S. I., & Nagaoka, H. (2000). Methods of information geometry (Vol. 191). American Mathematical Soc.
- Paulsen, V. (2002). Completely bounded maps and operator algebras (Vol. 78). Cambridge University Press.
- Nielsen, M. A., & Chuang, I. L. (2010). Quantum computation and quantum information. Cambridge university press.
- Holevo, A. S. (2019). Quantum Systems, Channels. In Information. De Gruyter.
- Anastassiou, G. A. (2023). Parametrized, deformed and general neural networks. Berlin/Heidelberg, Germany: Springer. [CrossRef]
- Samko, S. G. (1993). Fractional integrals and derivatives. Theory and applications.
- Stein, E. M., & Weiss, G. (1971). Introduction to Fourier analysis on Euclidean spaces (Vol. 1). Princeton university press.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).