Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0603103 · Reports on Mathematical Physics

Hermitian tensor product approximation of complex matrices and separability

Shao-Ming Fei, Naihuan Jing, Bao-Zhi Suna

Published Apr 1, 2006• 4 citations
arXivHTMLPDF
DOI
10.1016/s0034-4877(06)80021-2

Related papers

Linear maps preserving determinant of tensor products of Hermitian matrices

Yuting Ding, Ajda Fošner, Jinli Xu +1 more

Journal of Mathematical Analysis and Applications•Aug 31, 2016•4 citations

A tensor product matrix approximation problem in quantum physics

Geir Dahl, Jon Magne Leinaas, Jan Myrheim +1 more

Linear Algebra and its Applications•Oct 18, 2006•93 citations

On the Approximation of Functionals of Very Large Hermitian Matrices represented as Matrix Product Operators

Moritz August, Mari Carmen Bañuls, Thomas Huckle

We present a method to approximate functionals $\text{Tr} \, f(A)$ of very high-dimensional hermitian matrices $A$ represented as Matrix Product Operators (MPOs). Our method is based on a reformulation of a block Lanczos algorithm in tensor network format. We state main properties of the method and show how to adapt the basic Lanczos algorithm to the tensor network formalism to allow for high-dimensional computations. Additionally, we give an analysis of the complexity of our method and provide numerical evidence that it yields good approximations of the entropy of density matrices represented by MPOs while being robust against truncations.

arXiv:1610.06086•Oct 19, 2016•4 citations

Optimal commuting approximation of Hermitian operators

Francesco Ticozzi

Linear Algebra and its Applications•Jan 26, 2005•0 citations

Linear Transformations between Multipartite Quantum Systems That Map the Set of Tensor Product of Idempotent Matrices into Idempotent Matrix Set

Jinli Xu, Baodong Zheng, Hongmei Yao

Let H n be the set of n × n complex Hermitian matrices and 𝒫 n (resp., 𝒯 n ) be the set of all idempotent (resp., tripotent) matrices in H n . In l -partite quantum system H m 1 T m l = ⊗ 1 l H m i , ⊗ 1 l 𝒫 m i (resp., ⊗ 1 l 𝒯 m i ) denotes the set of all decomposable elements ⊗ 1 l A i such that A i ∈ 𝒫 m i (resp., A i ∈ 𝒯 m

Journal of Function Spaces and Applications•Jan 1, 2013•6 citations

QUANTUM ENTANGLEMENT AND APPROXIMATION BY POSITIVE MATRICES

Xiaofen Huang, Naihuan Jing

We give an exact solution to the nonlinear optimization problem of approximating a Hermitian matrix by positive semi-definite matrices. Our algorithm was then used to judge whether a quantum state is entangled or not. We show that the exact approximation of a density matrices by tensor product of positive semi-definite operators is determined by the additivity property of the density matrix.

arXiv:1207.2827•Oct 1, 2011•0 citations
We present a method to approximate functionals Tr f(A)\text{Tr} \, f(A)Trf(A) of very high-dimensional hermitian matrices AAA represented as Matrix Product Operators (MPOs). Our method is based on a reformulation of a block Lanczos algorithm in tensor network format. We state main properties of the method and show how to adapt the basic Lanczos algorithm to the tensor network formalism to allow for high-dimensional computations. Additionally, we give an analysis of the complexity of our method and provide numerical evidence that it yields good approximations of the entropy of density matrices represented by MPOs while being robust against truncations.