Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.13477

Harmonic analysis and circuit approximation of Sobolev functions on quantum input spaces

Philipp Schmocker

quant-phcs.LGmath.RTmath.SPSubmitted Oct 9, 2026• Announced Oct 12, 2026• 0 citations
arXivHTMLPDF

Abstract

We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By using harmonic analysis on compact groups and compact homogeneous spaces, we characterize the corresponding Peter--Weyl decompositions and Sobolev spaces via irreducible representations and the Laplace--Beltrami operator. Combining spectral truncation with finite-depth quantum-circuit approximation, invoking the Solovay--Kitaev theorem, we establish quantitative rates that separate the spectral truncation error from the circuit approximation error.

AI Summary

The paper studies approximation of scalar-valued Sobolev functions whose inputs are quantum states or unitary operations, rather than classically encoded Euclidean data. It treats the complex sphere $\mathbb S^{2d-1}$, projective state space $\mathbb{CP}^{d-1}$, and groups $\mathrm{SU}(d)$ and $\mathrm{PU}(d)$, with $d=2^n$. The approximation first truncates the function’s Laplace–Beltrami expansion, then evaluates that truncation at a circuit-generated approximation to the input. For $f\in H^s(G)$, $s\geq0$, the common bound is $\|f-\mathcal Q_{K,L}f\|_{L^2(G)}\lesssim_{d,s}[(1+K)^{-s}+(1+K)^{m/2+1}\varepsilon_n(L)]\|f\|_{H^s(G)}$, where $m=\dim G$ and $N_K\asymp_d(1+K)^m$ modes are retained. Thus the two contributions scale as $N_K^{-s/m}$ and $N_K^{1/2+1/m}\varepsilon_n(L)$. Solovay–Kitaev synthesis supplies $\varepsilon_n(L)\leq\exp[-a_nL^{1/c}]$ for sufficiently large $L$, with admissible $c>1.44042$ using a cited refinement. The derivation combines Peter–Weyl decompositions, spectral Sobolev tail estimates, and Bernstein–Nikolskii gradient bounds controlling sensitivity to input perturbations. Representation matrix elements and state harmonics are expressed through tensor-copy circuit matrix elements or expectation values. Two single-qubit numerical examples compare empirical errors with fitted versions of the bounds. The synthesis constants depend on dimension and gate set. Circuit evaluation requires additional implementation assumptions: suitable representation states must be available, or the harmonic matrices must admit efficient implementations. The stated depth controls input synthesis, not a complete evaluation-resource budget. For the analytic numerical target, the fitted spectral exponent is explicitly interpreted as a finite-range effective exponent.

Little sign of AI-generated textIncrementalUnclear noveltyStrong assumptions

Error found: The approximation bounds control exact evaluation at circuit-synthesized inputs, not the additional state-preparation, operator-implementation, and measurement resources needed to evaluate the function on quantum hardware. Section 4 identifies generator word length with circuit depth although its arbitrary generating sets are not required to consist of single-layer circuits; this identification needs an additional assumption or a generator-dependent depth factor. The second numerical experiment incorrectly gives log_phi(2)+10^(-6) as approximately 1.44052 rather than approximately 1.44042109.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
27 pages, 2 figures

Related papers

A Fourier analysis framework for approximate classical simulations of quantum circuits

Cristina Cîrstoiu

What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a suitable truncated multi-path operator basis gives algorithms to evaluate the Fourier coefficients of output distributions or expectation values that are viewed as functions on the group. Under certain conditions, a truncated Fourier series can be efficiently estimated with guaranteed mean-square convergence. For classes of noisy circuits, it leads to algorithms for sampling and mean value estimation under error models with a spectral gap, where the complexity increases exponentially with the gap's inverse and polynomially with the circuit's size. This approach unifies and extends existing algorithms for noisy parametrised or random circuits using Pauli basis paths. For classes of noiseless circuits, mean values satisfying Lipschitz continuity can be on average approximated using efficient sparse Fourier decompositions. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.

arXiv:2410.13856•Oct 17, 2024•20 citations

Approximating Korobov functions via quantum circuits

Junaid Aftab, Haizhao Yang

Understanding the capacity of quantum circuits through the lens of approximation theory is essential for evaluating the complexity of quantum circuits required to solve various problems in scientific computation. We design quantum circuits capable of approximating d-dimensional functions within the Korobov function space. This is achieved by leveraging the quantum signal processing (QSP) and the linear combination of unitaries (LCU) algorithms to build quantum circuits that output Chebyshev polynomials. We also present a quantitative analysis of the approximation error rates and evaluates the computational complexity of implementing the proposed circuits. Since the Korobov function space is a subspace of the certain Sobolev spaces, our work develops a theoretical foundation for implementing a large class of functions suitable for applications on a quantum computer.

arXiv:2404.14570•Communications in Mathematical Sciences•Jan 1, 2025•6 citations

Quantum Simulation on Riemannian Manifolds

Dylan Herman, Jacob Watkins, Guneykan Ozgul +4 more

We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to the metric. Our first algorithms are based on a global spectral method based on the identification of an efficient transform to the eigenbasis of the Laplace--Beltrami operator. We use this method to provide explicit, efficient, quantum simulation algorithms for the Riemannian Schrödinger equation on tori and spheres with their standard metrics, simplices with the Wright--Fisher metric, truncated positive orthants and their invertible affine images with the log-barrier Hessian metric, and $\ell_p$ balls with a metric induced by the Duffy map. Our second algorithm is based on a coherent simulation of local spectral methods on multiple charts, and is in principle applicable to any compact manifold. We first analyze this algorithm in the continuum and derive conditions under which a polynomial spectral cutoff suffices. We also provide a discretization analysis of a polynomial spectral cutoff for tensor-products of constant-dimensional manifolds. Finally, we consider applications of these methods to optimization and physical simulation. For optimization, we provide results including a generalization and convergence analysis of Quantum Hamiltonian Descent for geodesically convex functions that leads to explicit algorithms on the sphere and simplex, and a Riemannian generalization of the Real-Space Adiabatic Algorithm. For physical simulation, we show that our algorithms can simulate certain spatially discretized field theories, including a variant of the nonlinear sigma model.

quant-pharXiv:2610.03673•Oct 5, 2026•0 citations

Algebraic and Mathematical Foundations of Quantum Computation: Hilbert Spaces, Group Structures, and Quantum Algorithms

Bhavesh B. Prajapati

Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.

Communications on Applied Nonlinear Analysis•Jan 24, 2025•0 citations

Lie-Algebraic Analysis of Generators: Approximation-Error Bounds and Barren-Plateau Heuristics

Hiroshi Ohno

Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum circuits can be viewed as trigonometric polynomials whose accessible Fourier modes are determined by the spectra of the generators. In this study, we describe: (1) a minimax lower bound on the $ L^{2} $-approximation error over a Sobolev ball when the circuit's effective frequency set is contained in a radius-$K$ ball, which yields a scaling law of the form $ Ω(K^{\frac{d}{2} - r}) $ for $ r > \frac{d}{2} $ (assuming the target function belongs to the Sobolev space $ W_2^{r}(\mathbb{T}^{d}) $), and we also derive a Jackson-type upper bound on the approximation error of quantum circuits under Sobolev regularity of the target function, expressed in terms of an effective bandwidth determined by generator spectral gaps; (2) a generator-selection rule motivated by enlarging the effective frequency set via non-commuting generators; and (3) a simple heuristic metric based on the trace component of generators, aimed at characterizing training behaviors related to barren plateaus. Simulation experiments on toy problems illustrate the practical implications of the frequency-spectrum perspective and the proposed heuristics.

quant-pharXiv:2602.16094•Feb 19, 2026•0 citations

Quantum harmonic analysis on phase space

Reinhard F. Werner

Relative to an irreducible representation of the canonical commutation relations, convolutions between quantum mechanical operators and between functions and operators are defined, for which the usual Weyl transform acts as a Fourier transform. Basic properties of these operations are developed in close analogy to harmonic analysis on R2n. Using the quantum version of Wiener’s approximation theorem, a natural one-to-one correspondence between the closed, phase-space translation invariant subspaces of classical and quantum observables is established.

Journal of Mathematical Physics•May 1, 1984•179 citations
We derive approximation rates for Sobolev functions defined on the complex unit sphere and complex projective space, representing quantum states, and on the special and projective unitary groups, representing quantum unitary operations. By using harmonic analysis on compact groups and compact homogeneous spaces, we characterize the corresponding Peter--Weyl decompositions and Sobolev spaces via irreducible representations and the Laplace--Beltrami operator. Combining spectral truncation with finite-depth quantum-circuit approximation, invoking the Solovay--Kitaev theorem, we establish quantitative rates that separate the spectral truncation error from the circuit approximation error.
The paper studies approximation of scalar-valued Sobolev functions whose inputs are quantum states or unitary operations, rather than classically encoded Euclidean data. It treats the complex sphere S2d−1\mathbb S^{2d-1}S2d−1, projective state space CPd−1\mathbb{CP}^{d-1}CPd−1, and groups SU(d)\mathrm{SU}(d)SU(d) and PU(d)\mathrm{PU}(d)PU(d), with d=2nd=2^nd=2n.
The approximation first truncates the function’s Laplace–Beltrami expansion, then evaluates that truncation at a circuit-generated approximation to the input. For f∈Hs(G)f\in H^s(G)f∈Hs(G), s≥0s\geq0s≥0, the common bound is ∥f−QK,Lf∥L2(G)≲d,s[(1+K)−s+(1+K)m/2+1εn(L)]∥f∥Hs(G)\|f-\mathcal Q_{K,L}f\|_{L^2(G)}\lesssim_{d,s}[(1+K)^{-s}+(1+K)^{m/2+1}\varepsilon_n(L)]\|f\|_{H^s(G)}∥f−QK,L​f∥L2(G)​≲d,s​[(1+K)−s+(1+K)m/2+1εn​(L)]∥f∥Hs(G)​, where m=dim⁡Gm=\dim Gm=dimG and NK≍d(1+K)mN_K\asymp_d(1+K)^mNK​≍d​(1+K)m modes are retained. Thus the two contributions scale as NK−s/mN_K^{-s/m}NK−s/m​ and NK1/2+1/mεn(L)N_K^{1/2+1/m}\varepsilon_n(L)NK1/2+1/m​εn​(L). Solovay–Kitaev synthesis supplies εn(L)≤exp⁡[−anL1/c]\varepsilon_n(L)\leq\exp[-a_nL^{1/c}]εn​(L)≤exp[−an​L1/c] for sufficiently large LLL, with admissible c>1.44042c>1.44042c>1.44042 using a cited refinement.
The derivation combines Peter–Weyl decompositions, spectral Sobolev tail estimates, and Bernstein–Nikolskii gradient bounds controlling sensitivity to input perturbations. Representation matrix elements and state harmonics are expressed through tensor-copy circuit matrix elements or expectation values. Two single-qubit numerical examples compare empirical errors with fitted versions of the bounds.
The synthesis constants depend on dimension and gate set. Circuit evaluation requires additional implementation assumptions: suitable representation states must be available, or the harmonic matrices must admit efficient implementations. The stated depth controls input synthesis, not a complete evaluation-resource budget. For the analytic numerical target, the fitted spectral exponent is explicitly interpreted as a finite-range effective exponent.
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a suitable truncated multi-path operator basis gives algorithms to evaluate the Fourier coefficients of output distributions or expectation values that are viewed as functions on the group. Under certain conditions, a truncated Fourier series can be efficiently estimated with guaranteed mean-square convergence. For classes of noisy circuits, it leads to algorithms for sampling and mean value estimation under error models with a spectral gap, where the complexity increases exponentially with the gap's inverse and polynomially with the circuit's size. This approach unifies and extends existing algorithms for noisy parametrised or random circuits using Pauli basis paths. For classes of noiseless circuits, mean values satisfying Lipschitz continuity can be on average approximated using efficient sparse Fourier decompositions. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.
Understanding the capacity of quantum circuits through the lens of approximation theory is essential for evaluating the complexity of quantum circuits required to solve various problems in scientific computation. We design quantum circuits capable of approximating d-dimensional functions within the Korobov function space. This is achieved by leveraging the quantum signal processing (QSP) and the linear combination of unitaries (LCU) algorithms to build quantum circuits that output Chebyshev polynomials. We also present a quantitative analysis of the approximation error rates and evaluates the computational complexity of implementing the proposed circuits. Since the Korobov function space is a subspace of the certain Sobolev spaces, our work develops a theoretical foundation for implementing a large class of functions suitable for applications on a quantum computer.
We investigate algorithms for the quantum simulation of the Schrödinger equation on a Riemannian manifold, where the kinetic operator is defined by the Laplace--Beltrami operator corresponding to the metric. Our first algorithms are based on a global spectral method based on the identification of an efficient transform to the eigenbasis of the Laplace--Beltrami operator. We use this method to provide explicit, efficient, quantum simulation algorithms for the Riemannian Schrödinger equation on tori and spheres with their standard metrics, simplices with the Wright--Fisher metric, truncated positive orthants and their invertible affine images with the log-barrier Hessian metric, and ℓp\ell_pℓp​ balls with a metric induced by the Duffy map. Our second algorithm is based on a coherent simulation of local spectral methods on multiple charts, and is in principle applicable to any compact manifold. We first analyze this algorithm in the continuum and derive conditions under which a polynomial spectral cutoff suffices. We also provide a discretization analysis of a polynomial spectral cutoff for tensor-products of constant-dimensional manifolds. Finally, we consider applications of these methods to optimization and physical simulation. For optimization, we provide results including a generalization and convergence analysis of Quantum Hamiltonian Descent for geodesically convex functions that leads to explicit algorithms on the sphere and simplex, and a Riemannian generalization of the Real-Space Adiabatic Algorithm. For physical simulation, we show that our algorithms can simulate certain spatially discretized field theories, including a variant of the nonlinear sigma model.
Quantum computation is, at bottom, a branch of applied algebra and functional analysis: the state of a quantum register is a unit vector in a finite-dimensional complex Hilbert space, computation is the action of the unitary group on that space, and the structure of the most important quantum algorithms is dictated by the representation theory of finite and continuous groups. This paper develops the mathematical scaffolding of the field from first principles and uses it to explain why quantum computers can outperform classical ones. We review complex inner-product spaces, self-adjoint and unitary operators, the spectral theorem, and the tensor-product construction that gives rise to entanglement and the exponential dimension of the state space. We then describe the qubit and its geometry, the group-theoretic classification of quantum gates (the special unitary groups, the Pauli and Clifford groups, and their Lie-algebraic generators), and the universality results that justify finite gate sets together with the Solovay–Kitaev theorem. With this apparatus we analyse the quantum Fourier transform, phase estimation, and the hidden subgroup problem, showing how Shor’s factoring algorithm, Grover’s search, and the quantum linear-systems algorithm arise as instances of a small number of algebraic templates. Finally we treat the stabilizer formalism of quantum error correction—where finite abelian groups over GF(2) play the central role—and the variational, near-term (NISQ) algorithms that dominate current practice. Throughout, the emphasis is on the algebraic invariants that make quantum speed-ups possible.
Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum circuits can be viewed as trigonometric polynomials whose accessible Fourier modes are determined by the spectra of the generators. In this study, we describe: (1) a minimax lower bound on the $ L^{2} −approximationerroroveraSobolevballwhenthecircuit′seffectivefrequencysetiscontainedinaradius−-approximation error over a Sobolev ball when the circuit's effective frequency set is contained in a radius-−approximationerroroveraSobolevballwhenthecircuit′seffectivefrequencysetiscontainedinaradius−K$ ball, which yields a scaling law of the form $ Ω(K^{\frac{d}{2} - r}) $ for $ r > \frac{d}{2} $ (assuming the target function belongs to the Sobolev space $ W_2^{r}(\mathbb{T}^{d}) $), and we also derive a Jackson-type upper bound on the approximation error of quantum circuits under Sobolev regularity of the target function, expressed in terms of an effective bandwidth determined by generator spectral gaps; (2) a generator-selection rule motivated by enlarging the effective frequency set via non-commuting generators; and (3) a simple heuristic metric based on the trace component of generators, aimed at characterizing training behaviors related to barren plateaus. Simulation experiments on toy problems illustrate the practical implications of the frequency-spectrum perspective and the proposed heuristics.
Relative to an irreducible representation of the canonical commutation relations, convolutions between quantum mechanical operators and between functions and operators are defined, for which the usual Weyl transform acts as a Fourier transform. Basic properties of these operations are developed in close analogy to harmonic analysis on R2n. Using the quantum version of Wiener’s approximation theorem, a natural one-to-one correspondence between the closed, phase-space translation invariant subspaces of classical and quantum observables is established.