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

We propose an efficient ${\cal O}(N^2)$-parameter ansatz that consists of a sequence of exponential operators, each of which is a unitary variant of Neuscamman's cluster Jastrow operator. The ansatz can also be derived as a decomposition of…

In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in…

The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…

We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits…

We apply exact WKB methods to the study of the partition function of pure N=2 epsilon_i-deformed gauge theory in four dimensions in the context of the 2d/4d correspondence. We study the partition function at leading order in…

We consider a general reducible gauge theory deformed by mass or/and interaction terms violating gauge invariance. It is shown that in the Abelian case, by using the Stueckelberg-type procedure, this theory with broken gauge symmetry can be…

We introduce a deformation of the Fourier transform on $\mathbb{R}^N$ arising from a representation-theoretic construction associated with $\widetilde{SL}(2,\mathbb{R}) \times O(N)$ that still admits an underlying degree-one operator…

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…

We study the visible compression of a source E of pure quantum signal states, or, more formally, the minimal resources per signal required to represent arbitrarily long strings of signals with arbitrarily high fidelity, when the compressor…

For n an even number of qubits and v a unitary evolution, a matrix decomposition v=k1 a k2 of the unitary group is explicitly computable and allows for study of the dynamics of the concurrence entanglement monotone. The side factors k1 and…

This paper investigates quantum error correction schemes for fully-correlated noise channels on an $n$-qubit system, where error operators take the form $W^{\otimes n}$, with $W$ being an arbitrary $2\times 2$ unitary operator. In previous…

In this paper we consider the kernel of the radially deformed Fourier transform introduced in the context of Clifford analysis in [10]. By adapting the Laplace transform method from [4], we obtain the Laplace domain expressions of the…

Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its…

The nonlinear Fourier transform (NFT) decomposes waveforms propagating through optical fiber into nonlinear degrees of freedom, which are preserved during transmission. By encoding information on the nonlinear spectrum, a transmission…

We study symmetric tensor decompositions, i.e., decompositions of the form $T = \sum_{i=1}^r u_i^{\otimes 3}$ where $T$ is a symmetric tensor of order 3 and $u_i \in \mathbb{C}^n$.In order to obtain efficient decomposition algorithms, it is…

We introduce an approach for estimating the expectation values of arbitrary $n$-qubit matrices $M \in \mathbb{C}^{2^n\times 2^n}$ on a quantum computer. In contrast to conventional methods like the Pauli decomposition that utilize $4^n$…

We resume the investigation of the problem of independent local compression of correlated quantum sources, the classical case of which is covered by the celebrated Slepian-Wolf theorem. We focus specifically on classical-quantum (cq)…

The remarkable capability of quantum Fourier transformation (QFT) to extract the periodicity of a given periodic function has been exhibited by using nuclear magnetic resonance (NMR) techniques. Two separate sets of experiments were…

Discrete Cosine Transform (DCT) is very important in image compression. Classical 1-D DCT and 2-D DCT has time complexity O(NlogN) and O(N²logN) respectively. This paper presents a quantum DCT iteration, and constructs a quantum 1-D…

We show that any unitary operator on the $d_A\times d_B$ system ($d_A\ge 2$) can be decomposed into the product of at most $4d_A-5$ controlled unitary operators. The number can be reduced to $2d_A-1$ when $d_A$ is a power of two. We also…