相关论文: Infinite quantum signal processing for arbitrary S…
Quantum signal processing (QSP) represents a real scalar polynomial of degree $d$ using a product of unitary matrices of size $2\times 2$, parameterized by $(d+1)$ real numbers called the phase factors. This innovative representation of…
Elucidating a connection with nonlinear Fourier analysis, we extend a well known algorithm in quantum signal processing to represent measurable signals by square summable sequences. Each coefficient of the sequence is Lipschitz continuous…
Quantum signal processing (QSP) and quantum singular value transformation (QSVT) are powerful techniques for the development of quantum procedures. They allow to derive circuits preparing desired polynomial transformations. Recent research…
This paper presents two efficient and stable algorithms for recovering phase factors in quantum signal processing (QSP), a crucial component of many quantum algorithms. The first algorithm, the ``Half Cholesky" method, which is based on…
The quantum Fourier transform and quantum wavelet transform have been cornerstones of quantum information processing. However, for non-stationary signals and anomaly detection, the Hilbert transform can be a more powerful tool, yet no prior…
Quantum signal processing and quantum singular value transformation are powerful tools to implement polynomial transformations of block-encoded matrices on quantum computers, and has achieved asymptotically optimal complexity in many…
Quantum Mechanics and Signal Processing in the line R, are strictly related to Fourier Transform and Weyl-Heisenberg algebra. We discuss here the addition of a new discrete variable that measures the degree of the Hermite functions and…
Quantum computing is a promising new area of computing with quantum algorithms offering a potential speedup over classical algorithms if fault tolerant quantum computers can be built. One of the first applications of the classical computer…
It is developed the theory of the Dirichlet problem for harmonic functions. On this basis, for the nondegenerate Beltrami equations in the quasidisks and, in particular, in the smooth domains, it is proved the existence of regular solutions…
Quantum computing can provide speedups in solving many problems as the evolution of a quantum system is described by a unitary operator in an exponentially large Hilbert space. Such unitary operators change the phase of their eigenstates…
Quantum signal processing (QSP) provides a representation of scalar polynomials of degree $d$ as products of matrices in $\mathrm{SU}(2)$, parameterized by $(d+1)$ real numbers known as phase factors. QSP is the mathematical foundation of…
We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly…
Given a representation of the circle group by semiclassical Fourier integral operators, we construct an algebra of semiclassical pseudodifferential operators that are a quantum analogue of the notion of symplectic cutting of Lerman, and we…
We study the quantum Riemann-Hilbert problems determined by the refined Donaldson-Thomas theory on the resolved conifold. Using the solutions to classical Riemann-Hilbert problems by Beidgeland, we give explicit solutions in terms of…
In this thesis a general procedure to represent the integral Bethe Ansatz equations in the form of the Reimann-Hilbert problem is given. This allows us to study in simple way integrable spin chains in the thermodynamic limit. Based on the…
Symmetric quantum signal processing provides a parameterized representation of a real polynomial, which can be translated into an efficient quantum circuit for performing a wide range of computational tasks on quantum computers. For a given…
The joint state of a continuously monitored quantum system and the classical filtered measurement record has recently been shown to be described by a quantum Fokker-Planck master equation [Phys. Rev. Lett. 129, 050401 (2022)]. We present a…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in…
The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…