Related papers: Operator-Schmidt decomposition of the quantum Four…
Affine transformations (dilatations and translations) are used to define a deformation of one-dimensional $N=2$ supersymmetric quantum mechanics. Resulting physical systems do not have conserved charges and degeneracies in the spectra.…
Building on results of Haagerup and Schultz, we decompose an arbitrary operator in a diffuse, finite von Neumann algebra into the sum of a normal operator and an s.o.t.-quasinilpotent operator. We also prove an analogue of Weyl's inequality…
Schmidt decomposition is a powerful tool in quantum information. While Schmidt decomposition is universal for bipartite states, its not for multipartite states. In this article, we review properties of bipartite Schmidt decompositions and…
Tensor decomposition methodologies are proposed to reduce the memory requirement of translation operator tensors arising in the fast multipole method-fast Fourier transform (FMM-FFT)-accelerated surface integral equation (SIE) simulators.…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
Quantum state preparation (QSP) for a general $n$-qubit state requires $O(2^n)$ CNOT gates and circuit depth, making exact amplitude encoding (EAE) impractical for near-term quantum hardware. We introduce an ancilla-free hybrid…
We present the method of calculation of radiative decays of composite quark-antiquark systems with different J^{PC}: (Q\bar Q)_{in} -> gamma (Q\bar Q)_{out}. The method is relativistic invariant, it is based on the double dispersion…
We use the venerable "fooling set" method to prove new lower bounds on the quantum communication complexity of various functions. Let f:X x Y-->{0,1} be a Boolean function, fool^1(f) its maximal fooling set size among 1-inputs, Q_1^*(f) its…
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…
We solve the problem of Fourier transformation for the one-dimensional $q$-deformed Heisenberg algebra. Starting from a matrix representation of this algebra we observe that momentum and position are unbounded operators in the Hilbert…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
Recently, the Fischer decomposition for polynomials on superspace R^{m|2n} (that is, polynomials in m commuting and 2n anti-commuting variables) has been obtained unless the superdimension M=m-2n is even and non-positive. In this case, it…
While out-of-time-order correlators establish a causal light cone for operator spreading, they do not guarantee that the parameter sensitivity carried by the operator remains locally recoverable. We examine the distinction between operator…
The Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform…
The initial value problem for the cubic defocusing nonlinear Schr\"odinger equation $i \partial_t u + \Delta u = |u|^2 u$ on the plane is shown to be globally well-posed for initial data in $H^s (\R^2)$ provided $s>1/2$. The proof relies…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
For parameter estimation from an $N$-component composite quantum system, it is known that a separable preparation leads to a mean-squared estimation error scaling as $1/N$ while an entangled preparation can in some conditions afford a…
In this paper, we introduce an $N\times N$ matrix $\epsilon^{a\bar{b}}$ in the quantum groups $SU_{q}(N)$ to transform the conjugate representation into the standard form so that we are able to compute the explicit forms of the important…
The quantum Fourier transform (QFT) has been implemented on a three bit nuclear magnetic resonance (NMR) quantum computer, providing a first step towards the realization of Shor's factoring and other quantum algorithms. Implementation of…
We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…