

Low Rank Approximation For Entangled Quantum Systems
^{1} Department of Mathematics, North Carolina State University
^{2} Department of Mathematics, National Cheng Kung University




 

➣ Introduction to Quantum Entanglement and Mathematical Models
Quantum entanglement is a marvelous phenomenon that plays an essential task in quantum informatics [1, 2, 3, 4, 5, 6]. The miracle demonstrates how pairs or groups of particles generate, interact, or share properties so that the variation of one particle will instantly transform the characteristics of another particle. In other words, we could imagine that there is a mysterious communication channel which forwards information even faster than the speed of light. To the study of entanglement, we suitably represent quantum states in terms of some properly selected basis over the complex field. Then, we express the rule of entanglement in quantum mechanics systems as Kronecker products between states of density matrices of the subsystems. Subsequently, we can investigate the property of entanglement as the following low rank approximation problem:
①
where * denotes the conjugate transpose, ⨂ stands for the Kronecker product, and ρ ∈ C^{mn×mn} is a positive definite matrix.
➣ Difficulties and Breakthrough
A low rank approximation to an entangled bipartite system represented in ① is fundamentally different from a conventional tensor approximation with several new challenges:
❶ The twist caused by the Kronecker product destroys the multilinearity. The famous alternating least squares techniques can hardly be applied.
❷ To correctly characterize the quantum properties, it is necessary to involve complex variables. The approximation amounts to the optimization of realvalued functions over the complex spaces.
❸ The approximation needs to deal with a proper low rank, which is not known a priori, and to maintain the probability distribution among the states.
Thus, we propose a dynamical system approach to tackle the problem ① with complex variables directly. This method, utilizing the projected gradient flow and the notion of Wirtinger calculus, is concise and can achieve convergence from any starting point. We ensure for no difficulty that the requirement of the combination coefficients θ_{r}'s must be a probability distribution. When needed, we can even obtain the desired lowrank approximation by dynamically adjusting the predicted rank k.
References
1. C.H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, “Teleporting an unknown quantum state via dual classical and EinsteinPodolskyRosen channels,” Phys. Rev. Lett., 70 (1993), pp. 18951899.
2. A. K. Ekert, “Quantum cryptography based on Bell's theorem,” Phys.Rev. Lett., 67 (1991), pp. 661663.
3. M. Hayashi, “Quantum information theory,” Graduate Texts in Physics, SpringerVerlag, Berlin, second ed., 2017.
4. M. Melucci, “Introduction to information retrieval and quantum mechanics,” vol. 35 of The Information Retrieval Series, Springer, Heidelberg, 2015.
5. R. Raussendorf and H. J. Briegel, “A oneway quantum computer,” Phys. Rev. Lett., 86 (2001), pp. 51885191.
6. M. M. Wilde, “Quantum information theory,” Cambridge University Press, Cambridge, second ed., 2017.



  






