相关论文: Boundary-Aware QFT Block-Encoding of Fractional La…
One of the major promises of quantum computing is the realization of SIMD (single instruction - multiple data) operations using the phenomenon of superposition. Since the dimension of the state space grows exponentially with the number of…
On a relatively compact strictly pseudoconvex domain with smooth boundary in a complex manifold of dimension $n$ we consider a Toeplitz operator $T_R$ with symbol a Reeb-like vector field $R$ near the boundary. We show that the kernel of a…
We introduce a quantum algorithm to perform the Laplace transform on quantum computers. Already, the quantum Fourier transform (QFT) is the cornerstone of many quantum algorithms, but the Laplace transform or its discrete version has not…
The quantum Fourier transform (QFT) is a key ingredient of several quantum algorithms and a qudit-specific implementation of the QFT is hence an important step toward the realization of qudit-based quantum computers. This work develops a…
This paper presents a generalized circuit framework for constructing Shih-type fractionalizations of unitary operators of dyadic order, i.e., operators $U$ satisfying $U^{2^n}=I$. Building upon the architecture of the quantum fractional…
We consider Toeplitz operators associated with the renormalized Bochner-Laplacian on high tensor powers of a positive line bundle on a compact symplectic manifold. We study the asymptotic behavior, in the semiclassical limit, of low-lying…
This paper is concerned with networks of identical linear quantum stochastic systems which interact with each other and external bosonic fields in a translation invariant fashion. The systems are associated with sites of a multidimensional…
We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact $N$-point Quantum Fourier Transform (QFT) for arbitrary $N$. Our construction factors the $N$-dimensional QFT unitary into three diagonal quadratic-phase…
The Quantum Fourier Transform (QFT) is a key component of many important quantum algorithms, most famously as being the essential ingredient in Shor's algorithm for factoring products of primes. Given its remarkable capability, one would…
The purpose of this work is the study of solution techniques for problems involving fractional powers of symmetric coercive elliptic operators in a bounded domain with Dirichlet boundary conditions. These operators can be realized as the…
We formulate $\lambda$-deformed $\sigma$-models as QFTs in the upper-half plane. For different boundary conditions we compute correlation functions of currents and primary operators, exactly in the deformation parameter $\lambda$ and for…
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual…
Consider an elliptic self-adjoint pseudodifferential operator $A$ acting on $m$-columns of half-densities on a closed manifold $M$, whose principal symbol is assumed to have simple eigenvalues. Relying on a basis of pseudodifferential…
We study the gate-based implementation of the binary reflected Gray code (BRGC) and binary code of the unitary time evolution operator due to the Laplacian discretized on a lattice with periodic boundary conditions. We find that the…
The fractional Laplacian operator, $-(-\triangle)^{\frac{\alpha}{2}}$, appears in a wide class of physical systems, including L\'evy flights and stochastic interfaces. In this paper, we provide a discretized version of this operator which…
Conventional approaches to fault-tolerant quantum computing realize logical circuits gate-by-gate, synthesizing each gate independently on one or more code blocks. This incurs excess overhead and doesn't leverage common structures in…
We present an asymptotically improved algorithm for implementing the Quantum Fourier Transform (QFT) in both the exact and approximate settings. Historically, the approximate QFT has been implemented in $\Theta(n \log n)$ gates, and the…
In this article, we study a model problem featuring a L\'evy process in a domain with semi-transparent boundary by considering the following perturbed fractional Laplacian operator \[\mathscr{L}_{b,q} := (-\Delta)^t +…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
In this paper, we investigate how quantum architectures affect the efficiency of the execution of the quantum Fourier transform (QFT) and linear transformations, which are essential parts of the stabilizer/Clifford group circuits. In…