Related papers: Linear combination of unitaries with exponential c…
Simulating general quantum processes that describe realistic interactions of quantum systems following a non-unitary evolution is challenging for conventional quantum computers that directly implement unitary gates. We analyze complexities…
The Hermitian decomposition of a linear operator is generalized to the case of two or more operations. An additive expansion of the product of three octonions into three parts is constructed, wherein each part either preserve or change the…
Synchronization over the special Euclidean group SE(3) aims to recover absolute poses from noisy pairwise relative transformations and is a core primitive in robotics and 3D vision. Standard approaches often require multi-step heuristic…
We prove a uniform spectral gap for complex transfer operators near the critical line associated to overlapping $C^2$ iterated function systems on the real line satisfying a Uniform Non-Integrability (UNI) condition. Our work extends that…
Randomized quantum algorithms have been proposed in the context of quantum simulation and quantum linear algebra with the goal of constructing shallower circuits than methods based on block encodings. While the algorithmic complexities of…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
This paper introduces a quantum-inspired denoising framework that integrates the Quantum Fourier Transform (QFT) into classical audio enhancement pipelines. Unlike conventional Fast Fourier Transform (FFT) based methods, QFT provides a…
Quantum error correction is a critical component for scaling up quantum computing. Given a quantum code, an optimal decoder maps the measured code violations to the most likely error that occurred, but its cost scales exponentially with the…
After summarizing characteristics of antidiagonal operators, we derive three direct sum decompositions characterizing antidiagonalizable linear operators - the first up to permutation-similarity, the second up to similarity, and the third…
Efficient algorithms for computing linear convolutions based on the fast Fourier transform are developed. A hybrid approach is described that combines the conventional practice of explicit dealiasing (explicitly padding the input data with…
This text contains an alternative presentation, and in certain cases an improvement, of the "hyperbolic dispersive estimate" that was proved by Anantharaman and Nonnenmacher and used to make progress towards the quantum unique ergodicity…
We consider the problem of "algebraic reconstruction" of linear combinations of shifts of several known signals $f_1,\ldots,f_k$ from the Fourier samples. Following \cite{Bat.Sar.Yom2}, for each $j=1,\ldots,k$ we choose sampling set $S_j$…
A proof is given that an invertible and a unitary operator can be used to reproduce the effect of a q-deformed commutator of annihilation and creation operators. In other words, the original annihilation and creation operators are mapped…
Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…
Differential equations may possess coefficients that vary on a spectrum of scales. Because coefficients are typically multiplicative in real space, they turn into convolution operators in spectral space, mixing all wavenumbers. However, in…
We exploit the key idea that nonlinear system identification is equivalent to linear identification of the socalled Koopman operator. Instead of considering nonlinear system identification in the state space, we obtain a novel linear…
Although Fourier series approximation is ubiquitous in computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast evaluation of a three-dimensional truncated Fourier series at a set of…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We present substantially generalized and improved quantum algorithms over prior work for inhomogeneous linear and nonlinear ordinary differential equations (ODE). Specifically, we show how the norm of the matrix exponential characterizes…
We present the first numerical implementation of a non-perturbative renormalization method for lattice operators, based on the study of correlation functions in coordinate space at short Euclidean distance. The method is applied to compute…