相关论文: Operator-Schmidt decomposition of the quantum Four…

Parton fragmentation functions (FFs) are indispensable for understanding processes of hadron production ubiquitously existing in high-energy collisions, but their first principle determination has never been realized due to the…

The partition function of a 3d $\mathcal{N}=4$ gauge theory with rank $N$ can be computed using supersymmetric localization in terms of a matrix model, which often can be formulated as an ideal Fermi gas with a non-trivial one-particle…

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

Quantum Fourier transformation is important in many quantum algorithms. In this paper, we generalize quantum Fourier transformation over the Abelian group $\mathbb{Z}_N$ from two different points to get more efficient unitary…

Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodicity. The fact that Fourier transforms can also be used to…

We analyze a class of quantum operations based on a geometrical representation of $d-$level quantum system (or qudit for short). A sufficient and necessary condition of complete positivity, expressed in terms of the quantum Fourier…

We present a spatially efficient decomposition of matrices and arbitrary-order tensors as linear combinations of tensor products of $\{-1, 1\}$-valued vectors. For any matrix $A \in \mathbb{R}^{m \times n}$, $$A - R_w = S_w C_w T_w^\top =…

- In this paper we present a method to compute the coefficients of the fractional Fourier transform (FrFT) on a quantum computer using quantum gates of polynomial complexity of the order O(n^3). The FrFt, a generalization of the DFT, has…

A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). The author of this paper is also the author of a quantum compiler called Qubiter. Qubiter…

We consider a generalized convolution, linking Structure Functions (SF) $F^N_2$ for nucleons, $F^A_2$ for a physical nucleus and $f^{PN,A}$ for a nucleus, composed of point-nucleons. In order to extract $F_2^n$ we employ data on $F_2^{p,A}$…

We characterize and classify quantum correlations in two-fermion systems having 2K single-particle states. For pure states we introduce the Slater decomposition and rank (in analogy to Schmidt decomposition and rank), i.e. we decompose the…

We investigate the utilization of a single generalized dephasing qubit for sensing a quantum reservoir, where the antisymmetric coupling between the qubit and its reservoir is broken. It is found that in addition to the decay factor…

The two-qubit canonical decomposition SU(4) = [SU(2) \otimes SU(2)] Delta [SU(2) \otimes SU(2)] writes any two-qubit quantum computation as a composition of a local unitary, a relative phasing of Bell states, and a second local unitary.…

Decompositions of the unitary group U(n) are useful tools in quantum information theory as they allow one to decompose unitary evolutions into local evolutions and evolutions causing entanglement. Several recursive decompositions have been…

Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…

We introduce the `Fourier transform' F_C on the isotropic cone C associated to an indefinite quadratic form of signature (n_1,n_2) on R^n (n=n_1+n_2: even). This transform is in some sense the unique and natural unitary operator on L^2(C),…

Production and verification of multipartite quantum state are an essential step in quantum information processing. In this work, we propose an efficient method to decompose symmetric multipartite observables, which are invariant under…

We consider the class of functions whose value depends only on the intersection of the input X_1,X_2, ..., X_t; that is, for each F in this class there is an f_F: 2^{[n]} \to {0,1}, such that F(X_1,X_2, ..., X_t) = f_F(X_1 \cap X_2 \cap ...…

The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…

The radially deformed Fourier transform, introduced in [S. Ben Said, T. Kobayashi and B. Orsted, Laguerre semigroup and Dunkl operators, Compositio Math.], is an integral transform that depends on a numerical parameter $a \in R^{+}$. So…