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

Efficient Non-Uniform Quantum Hermite Transform through Adaptive Sampling — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 7, 2026• 0 citations
Publisher

Abstract

On the span of the first $N$ oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and $N$ weighted position space samples. We implement this transform with $O(N\operatorname{polylog}(N,1/\varepsilon))$ logical gates and polylogarithmic quantum width. The operator-error bound $\varepsilon$ holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound. Source: http://arxiv.org/abs/2609.20739v1 (arXiv:2609.20739v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24029487

Related papers

Efficient Non-Uniform Quantum Hermite Transform through Adaptive Sampling

Nitay Mayo, Aryeh Lev Zabokritskiy

On the span of the first $N$ oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and $N$ weighted position space samples. We implement this transform with $O(N\operatorname{polylog}(N,1/\varepsilon))$ logical gates and polylogarithmic quantum width. The operator-error bound $\varepsilon$ holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound.

quant-pharXiv:2609.20739•Sep 18, 2026•0 citations

Optimal spectrum estimation — E8 Intelligence Research

Andrew Stewart Caldin

We prove that the spectrum of an unknown $d$-dimensional quantum state can be estimated to error $\varepsilon$ in total variation distance using \[ O\!\left(d^2\min\left\{ \frac{1}{(\varepsilon\log d)^4},\; \frac{1}{(\varepsilon\log d)^2} \right\}\right) \] copies. This matches the recent lower bound of Wang. When restricted to unentangled measurements, we give an algorithm with an additional factor of $d$ in copy complexity, which we conjecture to be optimal. We develop a framework for recovering the small eigenvalues of a quantum state by matching Chebyshev moments. We bound the variance of each Chebyshev moment estimate in terms of scalar derivatives of the corresponding polynomial, using classical and quantum Efron--Stein decompositions. Different rescalings of the Chebyshev polynomials balance approximation error and variance, yielding two regimes in our copy complexity bound. Source: http://arxiv.org/abs/2609.30171v1 (arXiv:2609.30171v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Variational Multi-Gaussian Quantum Trajectories — E8 Intelligence Research

Andrew Stewart Caldin

We propose a variational framework for the efficient simulation of stochastic quantum dynamics in interacting bosonic systems. Our method generalizes the time-dependent variational principle to accommodate quantum state diffusion processes and is tailored for describing quantum trajectories unraveled from a master equation. We adopt a wavefunction ansatz composed of a coherent superposition of Gaussian wavepackets, which allows the fully analytical assembly of the variational equations of motion while capturing both the quantum trajectory dynamics and the Lindblad evolution beyond semiclassical approximations. The method is carefully benchmarked on a Bose-Hubbard dimer, and applied to extended Bose-Hubbard lattices in both 1D and 2D. In particular, we show the emergence of a symmetry-breaking phase transition in 2D lattices, which is absent in 1D chains. Source: http://arxiv.org/abs/2609.30225v1 (arXiv:2609.30225v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 13, 2026•0 citations

Efficient Quantum Hermite Transform

Siddhartha Jain, Vishnu Iyer, Rolando D. Somma +2 more

We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that is polylogarithmic in the dimension and the inverse of the allowable error. This transform, which maps basis states to states whose amplitudes are proportional to the Hermite functions, can be interpreted as the Gaussian analogue of the Fourier transform. Our algorithm is based on a method to exponentially fast-forward the evolution of the quantum harmonic oscillator, giving a simulation algorithm with nearly optimal circuit complexity for a fundamental Hamiltonian more than four decades after Feynman posed the simulation of quantum physics as an application of quantum computers.

arXiv:2510.04929•ACM Symposium on Theory of Computing (STOC)•Jun 9, 2026•16 citations

A New Method For Manipulating Circuits, Application To Quantum Adders — E8 Intelligence Research

Andrew Stewart Caldin

We use a new technique for manipulating controlled quantum circuits to convert between two distinct types of quantum adders, one based on the Quantum Fourier Transform and the other based on the Ripple-Carry technique from classical reversible logic. This conversion takes the form of an explicit gate-level transpilation. We also present a new quantum adder with a natural interpretation as a kind of Carry-Lookahead adder that uses no ancillas. Source: http://arxiv.org/abs/2609.26591v1 (arXiv:2609.26591v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 10, 2026•0 citations

The Quantum KKL Inequality — E8 Intelligence Research

Andrew Stewart Caldin

In this paper, we resolve the quantum KKL conjecture of Montanaro and Osborne \cite{MO2010} for quantum Boolean functions on the $n$-qubit hypercube. More precisely, for every self-adjoint unitary $T$, we bound the largest $L_2$-influence from below by a constant multiple of $\mathrm{Var}(T)\log(n)/n$. The proof heavily depends on upper and lower commutator estimates on the Hilbert space. Source: http://arxiv.org/abs/2609.21900v1 (arXiv:2609.21900v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 9, 2026•0 citations
On the span of the first NNN oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and NNN weighted position space samples. We implement this transform with O(Npolylog⁡(N,1/ε))O(N\operatorname{polylog}(N,1/\varepsilon))O(Npolylog(N,1/ε)) logical gates and polylogarithmic quantum width. The operator-error bound ε\varepsilonε holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound. Source: http://arxiv.org/abs/2609.20739v1 (arXiv:2609.20739v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
On the span of the first NNN oscillator modes, Gauss--Hermite quadrature gives an exact change of basis between mode coefficients and NNN weighted position space samples. We implement this transform with O(Npolylog⁡(N,1/ε))O(N\operatorname{polylog}(N,1/\varepsilon))O(Npolylog(N,1/ε)) logical gates and polylogarithmic quantum width. The operator-error bound ε\varepsilonε holds on arbitrary superpositions and includes all auxiliary registers. The construction uses signed averages on adaptive windows to convert uniform-grid samples into weighted Hermite-root samples. Their varying widths control the amplification cost, giving the near-linear bound.
We prove that the spectrum of an unknown ddd-dimensional quantum state can be estimated to error ε\varepsilonε in total variation distance using O ⁣(d2min⁡{1(εlog⁡d)4,  1(εlog⁡d)2}) O\!\left(d^2\min\left\{ \frac{1}{(\varepsilon\log d)^4},\; \frac{1}{(\varepsilon\log d)^2} \right\}\right) O(d2min{(εlogd)41​,(εlogd)21​}) copies. This matches the recent lower bound of Wang. When restricted to unentangled measurements, we give an algorithm with an additional factor of ddd in copy complexity, which we conjecture to be optimal. We develop a framework for recovering the small eigenvalues of a quantum state by matching Chebyshev moments. We bound the variance of each Chebyshev moment estimate in terms of scalar derivatives of the corresponding polynomial, using classical and quantum Efron--Stein decompositions. Different rescalings of the Chebyshev polynomials balance approximation error and variance, yielding two regimes in our copy complexity bound. Source: http://arxiv.org/abs/2609.30171v1 (arXiv:2609.30171v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We propose a variational framework for the efficient simulation of stochastic quantum dynamics in interacting bosonic systems. Our method generalizes the time-dependent variational principle to accommodate quantum state diffusion processes and is tailored for describing quantum trajectories unraveled from a master equation. We adopt a wavefunction ansatz composed of a coherent superposition of Gaussian wavepackets, which allows the fully analytical assembly of the variational equations of motion while capturing both the quantum trajectory dynamics and the Lindblad evolution beyond semiclassical approximations. The method is carefully benchmarked on a Bose-Hubbard dimer, and applied to extended Bose-Hubbard lattices in both 1D and 2D. In particular, we show the emergence of a symmetry-breaking phase transition in 2D lattices, which is absent in 1D chains. Source: http://arxiv.org/abs/2609.30225v1 (arXiv:2609.30225v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We present a new primitive for quantum algorithms that implements a discrete Hermite transform efficiently, in time that is polylogarithmic in the dimension and the inverse of the allowable error. This transform, which maps basis states to states whose amplitudes are proportional to the Hermite functions, can be interpreted as the Gaussian analogue of the Fourier transform. Our algorithm is based on a method to exponentially fast-forward the evolution of the quantum harmonic oscillator, giving a simulation algorithm with nearly optimal circuit complexity for a fundamental Hamiltonian more than four decades after Feynman posed the simulation of quantum physics as an application of quantum computers.
We use a new technique for manipulating controlled quantum circuits to convert between two distinct types of quantum adders, one based on the Quantum Fourier Transform and the other based on the Ripple-Carry technique from classical reversible logic. This conversion takes the form of an explicit gate-level transpilation. We also present a new quantum adder with a natural interpretation as a kind of Carry-Lookahead adder that uses no ancillas. Source: http://arxiv.org/abs/2609.26591v1 (arXiv:2609.26591v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
In this paper, we resolve the quantum KKL conjecture of Montanaro and Osborne \cite{MO2010} for quantum Boolean functions on the nnn-qubit hypercube. More precisely, for every self-adjoint unitary TTT, we bound the largest L2L_2L2​-influence from below by a constant multiple of Var(T)log⁡(n)/n\mathrm{Var}(T)\log(n)/nVar(T)log(n)/n. The proof heavily depends on upper and lower commutator estimates on the Hilbert space. Source: http://arxiv.org/abs/2609.21900v1 (arXiv:2609.21900v1) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com