English
Related papers

Related papers: Infinite quantum signal processing for arbitrary S…

200 papers

This paper proposes a new factorization algorithm for computing the phase factors of quantum signal processing. The proposed algorithm avoids root finding of high degree polynomials by using a key step of Prony's method and is numerically…

Quantum Physics · Physics 2022-11-02 Lexing Ying

In 1999 Berry and Keating showed that a regularization of the 1D classical Hamiltonian H = xp gives semiclassically the smooth counting function of the Riemann zeros. In this paper we first generalize this result by considering a phase…

Mathematical Physics · Physics 2008-11-26 German Sierra

In semiclassical theories for chaotic systems such as Gutzwiller's periodic orbit theory the energy eigenvalues and resonances are obtained as poles of a non-convergent series g(w)=sum_n A_n exp(i s_n w). We present a general method for the…

chao-dyn · Physics 2009-10-30 J. Main , V. A. Mandelshtam , G. Wunner , H. S. Taylor

We propose a novel quantum approach to signal processing, including a quantum algorithm for low-pass and high-pass filtering, based on the sequency-ordered Walsh-Hadamard transform. We present quantum circuits for performing the…

Quantum Physics · Physics 2024-02-19 Alok Shukla , Prakash Vedula

Several mathematical views of phase-locking are developed. The classical Huyghens approach is generalized to include all harmonic and subharmonic resonances and is found to be connected to 1/f noise and prime number theory. Two types of…

Mathematical Physics · Physics 2009-11-11 Michel R. P. Planat

Implementing general functions of operators is a powerful tool in quantum computation. It can be used as the basis for a variety of quantum algorithms including matrix inversion, real and imaginary-time evolution, and matrix powers. Quantum…

Quantum Physics · Physics 2022-06-08 Thais de Lima Silva , Lucas Borges , Leandro Aolita

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

Quantum Physics · Physics 2019-03-15 Peng Qian , Wei-Cong Huang , Gui-Lu Long

We study the cubic Szeg\"o equation which is an integrable nonlinear non-dispersive and nonlocal evolution equation. In particular, we present a direct approach for obtaining the multiphase and multisoliton solutions as well as a special…

Exactly Solvable and Integrable Systems · Physics 2024-09-30 Yoshimasa Matsuno

A variant for the Hilbert and Polya spectral interpretation of the Riemann zeta function is proposed. Instead of looking for a self-adjoint linear operator H, whose spectrum coincides with the Riemann zeta zeros, we look for the complex…

High Energy Physics - Theory · Physics 2007-05-23 S. Joffily

Deutsch's algorithm is the first quantum algorithm to show the advantage over the classical algorithm. Here we generalize Deutsch's problem to $n$ functions and propose a new quantum algorithm with indefinite causal order to solve this…

Recently, Lloyd and Montangero have made a brief research proposal on universal quantum computation in integrable systems. The main idea is to encode qubits into quantum action variables and build up quantum gates by the method of resonant…

Quantum Physics · Physics 2022-12-19 Yong Zhang , Konglong Wu

Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct…

Quantum Physics · Physics 2013-03-22 Xiao-Qi Zhou , Pruet Kalasuwan , Timothy C. Ralph , Jeremy L. O'Brien

The Riemann hypothesis states that all nontrivial zeros of the zeta function lie in the critical line $\Re(s)=1/2$. Hilbert and P\'olya suggested that one possible way to prove the Riemann hypothesis is to interpret the nontrivial zeros in…

Mathematical Physics · Physics 2014-01-29 G. Menezes , B. F. Svaiter , N. F. Svaiter

We study nonlinear concentration problems for time-frequency distributions in the Cohen class. Using recent techniques from quantum harmonic analysis (QHA) we provide both positive and negative results, such as sufficient conditions for the…

Functional Analysis · Mathematics 2026-05-29 Erling A. T. Svela , S. Ivan Trapasso

Developing efficient quantum computing algorithms is essential for tackling computationally challenging problems across various fields. This paper presents a novel quantum algorithm, XZ24, for efficiently computing the eigen-energy spectra…

Quantum Physics · Physics 2024-09-30 Qing-Xing Xie , Yan Zhao

This is our third work on Bergman-type operator over bounded domains. In the previous two articles, we systematically study the boundedness, compactness and Schatten membership of Bergman-type on the Hilbert unit ball. In the present paper,…

Functional Analysis · Mathematics 2020-09-24 Lijia Ding

Characterization of quantum processes is a preliminary step necessary in the development of quantum technology. The conventional method uses standard quantum process tomography, which requires $d^2$ input states and $d^4$ quantum…

Quantum Physics · Physics 2020-02-26 Zhibo Hou , Jun-Feng Tang , Christopher Ferrie , Guo-Yong Xiang , Chuan-Feng Li , Guang-Can Guo

We establish versions of Szeg\H{o}'s distance formula and Widom's theorem on invertibility of (a family of) Toeplitz operators in a class of finite codimension subalgebras of uniform algebras, obtained by imposing a finite number of linear…

Functional Analysis · Mathematics 2021-07-07 Douglas T. Pfeffer , Michael T. Jury

We examine the deformation quantization of a single particle moving in one dimension (i) in the presence of an infinite potential wall, (ii) confined by an infinite square well, and (iii) bound by a delta function potential energy. In…

Quantum Physics · Physics 2009-11-10 S. Kryukov , M. A. Walton

Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…