A complex-valued gradient flow for the entangled bipartite low rank approximation

DOI10.1016/J.CPC.2021.108185MaRDI QIDQ6156953zbMATH OpenOpenAlexFDO

Authors Moody T. Chu, Matthew M. Lin

Publication date 19 June 2023

Published in Computer Physics Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cpc.2021.108185

zbMATH Keywords

bipartite systementanglementgradient dynamicslow-rank approximationquantum statesseparabilityWirtinger calculus

Mathematics Subject Classification ID

Quantum theory (81-XX) Statistical mechanics, structure of matter (82-XX)

Cites work

• A matrix realignment method for recognizing entanglement
• A tensor product matrix approximation problem in quantum physics
• Behind and beyond the MATLAB ODE suite
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Classical capacity of a noiseless quantum channel assisted by noisy entanglement
• Classical complexity and quantum entanglement
• Complexity and algorithms for nonlinear optimization problems
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions
• Detecting quantum entanglement.
• Entangled quantum systems and the Schmidt decomposition
• scientific article; zbMATH DE number 3888314 (Why is no real title available?)
• scientific article; zbMATH DE number 5157305 (Why is no real title available?)
• scientific article; zbMATH DE number 3980094 (Why is no real title available?)
• scientific article; zbMATH DE number 1305633 (Why is no real title available?)
• scientific article; zbMATH DE number 1324524 (Why is no real title available?)
• scientific article; zbMATH DE number 705150 (Why is no real title available?)
• scientific article; zbMATH DE number 741107 (Why is no real title available?)
• Introduction to Applied Nonlinear Dynamical Systems and Chaos
• Introduction to information retrieval and quantum mechanics
• Introduction to matrix analysis and applications
• Matrix pencils and entanglement classification
• Most tensor problems are NP-hard
• Necessary conditions for optimality of decomposable entanglement witnesses
• Nonlinear power-like iteration by polar decomposition and its application to tensor approximation
• Nonlinear programming
• Nonnegative solutions of ODEs
• On the Łojasiewicz--Simon gradient inequality.
• Proof of the gradient conjecture of R. Thom.
• Quantum computation and quantum information. 10th anniversary edition
• Quantum Computing
• Quantum cryptography based on Bell’s theorem
• Quantum entanglement
• Quantum entanglement in electron optics. Generation, characterization, and applications
• Quantum information theory
• Quantum Information Theory
• Quantum states with Einstein-Podolsky-Rosen correlations admitting a hidden-variable model
• Separability Criterion for Density Matrices
• Separability of mixed states: necessary and sufficient conditions.
• Skepticism of quantum computing
• Strong NP-hardness of the quantum separability problem
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The MATLAB ODE Suite
• The ubiquitous Kronecker product
• Unconstrained Optimization of Real Functions in Complex Variables

Cited in

(2)

• Quantifying measurement-induced disturbance to distinguish correlations as classical or quantum
• Optimization flow for approximating a matrix state involving orthonormal constraints

This page was built for publication: A complex-valued gradient flow for the entangled bipartite low rank approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156953)