Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2
Jon Tyson
备注：
9 pages, LaTeX 2e; No changes in results. References and acknowledgments added. Changes in presentation added to satisfy referees: expanded introduction, inclusion of ommitted algebraic steps in the appendix, addition of clarifying footnotes
Operator-Schmidt decompositions of the quantum Fourier transform on C^N1 tensor C^N2 are computed for all N1, N2 > 1. The decomposition is shown to be completely degenerate when N1 is a factor of N2 and when N1>N2. The first known special case, N1=N2=2^n, was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties. [M. A. Nielsen, PhD Thesis, University of New Mexico (1998), Chapter 6, arXiv:quant-ph/0011036.] More generally, the special case N1=2^n1<2^n2=N2 was computed by Nielsen et. al. in their study of strength measures of quantum operations. [M.A. Nielsen et. al, (accepted for publication in Phys Rev A); arXiv:quant-ph/0208077.] Given the Schmidt decompositions presented here, it follows that in all cases the communication cost of exact computation of the quantum Fourier transform is maximal.
The operator-Schmidt decomposition is useful in quantum information theory for quantifying the nonlocality of bipartite unitary operations. We construct a family of unitary operators on C^n tensor C^n whose operator-Schmidt decompositions are computed using the discrete Fourier transform. As a corollary, we produce unitaries on C^3 tensor C^3 with operator-Schmidt number S for every S in {1,...,9}. This corollary was unexpected, since it contradicted reasonable conjectures of Nielsen et al [Phys. Rev. A 67 (2003) 052301] based on intuition from a striking result in the two-qubit case. By the r…
In this note we generalize Nielsen's marjoization criterion for the convertibility of bipartite pure states [Phys. Rev. Lett \textbf{83}, 436(1999)] to a special class of multipartite pure states which have generalized Schmidt decompositions.
Hilbert-Schmidt distance reduces to Euclidean distance in Bell decomposable states. Based on this, entanglement of these states are obtained according to the protocol proposed in Ref. [V. Vedral et al, Phys. Rev. Lett. 78, 2275 (1995)] with Hilbert-Schmidt distance. It is shown that this measure is equal to the concurrence and thus can be used to generate entanglement of formation. We also introduce a new measure of distance and show that under the action of restricted LQCC operations, the associated measure of entanglement transforms in the same way as the concurrence transforms .
We review some results on the equivalence of quantum states under local unitary transformations (LUT). In particular, the classification of two-qubit Schmidt correlated (SC) states under LUT is investigated. By presenting the standard form of quantum states under LUT, the sufficient and necessary conditions of whether two different SC states are local unitary equivalent are provided. The correlations of SC states are also discussed.
We provide numerical evidence that the quantum Fourier transform can be efficiently represented in a matrix product operator with a size growing relatively slowly with the number of qubits. Additionally, we numerically show that the tensors in the operator converge to a common tensor as the number of qubits in the transform increases. Together these results imply that the application of the quantum Fourier transform to a matrix product state with $n$ qubits of maximum Schmidt rank $χ$ can be simulated in $O(n (log(n))^2 χ^2)$ time. We perform such simulations and quantify the error involved in…
This paper considers the control landscape of quantum transitions in multi-qubit systems driven by unitary transformations with single-qubit interaction terms. The two-qubit case is fully analyzed to reveal the features of the landscape including the nature of the absolute maximum and minimum, the saddle points and the absence of traps. The results permit calculating the Schmidt state starting from an arbitrary two-qubit state following the local gradient flow. The analysis of multi-qubit systems is more challenging, but the generalized Schmidt states may also be located by following the local…
We study conditions for the deterministic transformation $\ketψ\longrightarrow\ketϕ$ of a bipartite entangled state by a separable operation. If the separable operation is a local operation with classical communication (LOCC), Nielsen's majorization theorem provides necessary and sufficient conditions. For the general case we derive a necessary condition in terms of products of Schmidt coefficients, which is equivalent to the Nielsen condition when either of the two factor spaces is of dimension 2, but is otherwise weaker. One implication is that no separable operation can reverse a determinis…
The Schmidt number is an entanglement measure whose logarithm quantifies the zero-error entanglement cost of generating a given quantum state using local operations and classical communication (LOCC). %However, the Schmidt number is a notoriously difficult quantity to compute, and its relationship to other entanglement measures is largely unknown. In this paper we show that the Schmidt number is highly non-multiplicative in the sense that for any integer $n$, there exists states whose Schmidt number remains constant when taking $n$ copies of the given state. These states also provide a rare in…
We consider a bipartite mixed state of the form, $ρ=\sum_{α, β=1}^{l}a_{αβ} | ψ_α> < ψ_ β}| $, where $| ψ_α>$ are normalized bipartite state vectors, and matrix $(a_{αβ})$ is positive semidefinite. We provide a necessary and sufficient condition for the state $ρ$ taking the form of maximally correlated states by a local unitary transformation. More precisely, we give a criterion for simultaneous Schmidt decomposability of $| ψ_α>$ for $α=1,2,..., l$. Using this criterion, we can judge completely whether or not the state $ρ$ is equivalent to the maximally correlated state, in which the distilla…
We attempt to construct the exact univariate probability distributions for 2 x 2 quantum systems that yield the (balanced) univariate Hilbert-Schmidt determinantal moments <(|rho| |rho^{PT}|)^n>, obtained by Slater and Dunkl (J. Phys. A, 45, 095305 [2012]). To begin, we follow--to the extent possible--the Mellin transform-based approach of Penson and Zyczkowski in their study of Fuss-Catalan and Raney distributions (Phys. Rev. E, 83, 061118 [2011]). Further, we approximate the y-intercepts (separability/entanglement boundaries)--at which |rho^{PT}|=0-- of the associated probability distributio…
We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric games and obtain a complete set of quantum Nash equilibria. Apart from those available with the maximal entanglement, these quantum Nash equilibria are extensions of the Nash equilibria in classical game theory. The phase structure of the equilibria is determined for all values of entanglement, and thereby the possibility of resolving the dilemmas by entangl…
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 transformations. The obtained unitary transformations are given in concise and explicit formula which can be used directly. A relationship between the generalized quantum Fourier transformation and the dihedral hidden subgroup problem are discussed in this paper. This may lead a way to solve the dihedral hidden subgroup problem. The second goal of this paper is to give an…
NNR siganal will be enhanced by phase pre-whitening of presession of spin followed by quantum Fourier transform. FFT cannot the business as the phase is random.
Quantum Fourier transform is of primary importance in many quantum algorithms. In order to eliminate the destructive effects of decoherence induced by couplings between the quantum system and its environment, we propose a robust scheme for quantum Fourier transform over the intrinsic decoherence-free subspaces. The scheme is then applied to the circuit design of quantum Fourier transform over quantum networks under collective decoherence. The encoding efficiency and possible improvements are also discussed.
In this paper, we introduce an optical analogy to quantum Fourier tanformation based on a pseudorandom phase ensemble. The optical analogy also brings about exponential speedup over classical Fourier tanformation. Using the analogy, we demonstrate three classcial fields to realize Fourier transform similar to three quantum particles.
Fourier transforms are ubiquitous mathematical tools in basic and applied sciences. We here report classical and quantum optical realizations of the discrete fractional Fourier transform, a generalization of the Fourier transform. In the integrated configuration used in our experiments, the order of the transform is mapped onto the longitudinal coordinate, thus opening up the prospect of simultaneously observing all Transformation orders. In the context of classical optics, we implement discrete fractional Fourier transforms, both integer and fractional, of exemplary wave functions and experim…
We show, in a formal way, how a class of complex quasiprobability distribution functions may be introduced by using the fractional Fourier transform. This leads to the Fresnel transform of a characteristic function instead of the usual Fourier transform. We end the manuscript by showing a way in which the distribution we are introducing may be reconstructed by using atom-field interactions.
Istanbul Medeniyet University（伊斯坦布尔梅德尼耶特大学）；Purdue University（普渡大学）
Quantum computers are believed to have the ability to process huge data sizes which can be seen in machine learning applications. In these applications, the data in general is classical. Therefore, to process them on a quantum computer, there is a need for efficient methods which can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these ne…
The present chapter [submitted for publication in "Fourier Transforms, Theory and Applications", G. Nikolic (Ed.), InTech (Open Access Publisher), Vienna, 2011] is concerned with the introduction and study of a quadratic discrete Fourier transform. This Fourier transform can be considered as a two-parameter extension, with a quadratic term, of the usual discrete Fourier transform. In the case where the two parameters are taken to be equal to zero, the quadratic discrete Fourier transform is nothing but the usual discrete Fourier transform. The quantum quadratic discrete Fourier transform plays…
Fourier and fractional-Fourier transformations are widely used in theoretical physics. In this paper we make quantum perspectives and generalization for the fractional Fourier transformation (FrFT). By virtue of quantum mechanical representation transformation and the method of integration within normal ordered product (IWOP) of operators, we find the key point for composing FrFT, and reveal the structure of FrFT. Following this procedure, a full family of generalized fractional transformations are discovered with the usual FrFT as one special case. The eigen-functions of arbitrary GFrT are de…
