A noncommutative Weyl--Poisson identity compatible with LCHS quadrature is established, and the same polynomial construction is used to implement controlled dissipative families in amplitude--phase separation.
Abstract
We study quantum implementations of the contraction $\exp(-T H^\alpha)$ for $H=H^\dagger\succeq0$ and $\alpha>0$. Poisson summation provides an exact target--alias--tail decomposition whose Fourier samples are compiled classically into a single Chebyshev polynomial, so the quantum circuit uses polynomial eigenvalue transformation rather than a frequency linear combination of unitaries. We compare block encodings of $H/\norm{H}$ and of the shifted signal $2H/\norm{H}-I$. Under ordinary single-sequence QSVT, parity forces the former to use an even extension, which is entire only for even positive integers. An exact quadratic lift for the shifted signal makes every positive integer entire and improves the fixed-scale approximation error for noninteger powers from $\Theta(d^{-\alpha})$ to $\Theta(d^{-2\alpha})$ within the stated access and parity classes. We derive matching degree bounds in the large-scale fixed-error and fixed-scale high-precision limits, including the output-normalization overhead $u_r$. Nearest-neighbor Laplacians give a unit-normalized shifted signal. We further establish a noncommutative Weyl--Poisson identity compatible with LCHS quadrature, and use the same polynomial construction to implement controlled dissipative families in amplitude--phase separation.
We develop a quantum algorithm for slow analytic Hamiltonians $\widetilde H(t)=H(t/T)$ with $\|H(s)\|\leq\alpha$ that achieves nearly additive query complexity and low gate overhead. Our main technical contribution is a periodic Gevrey extension of $H(s)$, together with Fourier component decay and truncation bounds tha...
We prove the first quantum--classical separation for a sampling problem over a continuous domain. For a class of Gibbs states $p\propto e^{-\beta E}$ on the torus $\mathbb{T}^d$ with smooth ($s$-Gevrey) potential and barrier amplitude $\alpha=e^{\beta\Delta}$, where $\Delta = \max E-\min E$, every classical algorithm--...
Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque et al.· 1 citation
A Clifford+T quantum circuit construction that approximately implements any classically specified unitary to within error $\epsilon$ and achieves a worst-case $T$-count with leading exponential scaling of $2^{5n/4}$ whenever $\log(1/\epsilon)=\operatorname{poly}(n)$.
This work gives an unconditional exact quantum implementation in a circuit model permitting single-qubit rotations through efficiently computable angles and combines R'onyai's classical structure theory with R'onyai's classical structure theory to yield the radical and the Wedderburn decomposition.
This work treats the Bessel tail in the Jacobi-Anger series using Kapteyn's and Watson's inequalities, thereby reducing the overhead estimates for all Hamiltonian simulation tasks on quantum computers by a factor of $\approx e/2$.
A hybrid qubit--qumode algorithm for nonlinear ordinary differential equations of the form $\dot{\mathbf{x}}=\mathbf{f}(\mathbf{x})$ with drift of polynomial degree L with bound on the numerical abscissa $\lambda_{\max}(H_{1})$ that fixes the recovery domain of the warped-phase transform and the post-selection cost is...
Kausthubh Chandramouli, Yan Li, Yuan Liu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.