arXiv subjects

Hongjin He

Publications and source records attributed to Hongjin He.

21 records · Page 2Linked to original sources

arXiv2015

Quantum marginal inequalities and the conjectured entropic inequalities

A conjecture -- \emph{the modified super-additivity inequality} of relative entropy -- was proposed in \cite{Zhang2012}: There exist three unitary operators $U_A\in \unitary{\cH_A},U_B\in \unitary{\cH_B}$, and $U_{AB}\in \unitary{\cH_A\ot \cH_B}$ such that $$ \rS(U_{AB}ρ_{AB}U^\dagger_{AB}||σ_{AB}) \geqslant \rS(U_Aρ_AU^\dagger_A||σ_A) + \rS(U_Bρ_BU^\dagger_B||σ_B), $$ where the reference state $σ$ is required to be full-ranked. A numerical study on the conjectured inequality is conducted in this note. The results obtained indicate that the modified super-additivity inequality of relative entropy seems to hold for all qubit pairs.

quant-ph↗

arXiv2015

On the cone eigenvalue complementarity problem for higher-order tensors

In this paper, we consider the tensor generalized eigenvalue complementarity problem (TGEiCP), which is an interesting generalization of matrix eigenvalue complementarity problem (EiCP). First, we given an affirmative result showing that TGEiCP is solvable and has at least one solution under some reasonable assumptions. Then, we introduce two optimization reformulations of TGEiCP, thereby beneficially establishing an upper bound of cone eigenvalues of tensors. Moreover, some new results concerning the bounds of number of eigenvalues of TGEiCP further enrich the theory of TGEiCP. Last but not least, an implementable projection algorithm for solving TGEiCP is also developed for the problem under consideration. As an illustration of our theoretical results, preliminary computational results are reported.

math.OC↗

arXiv2015

Error analysis of approximation algorithm for standard bi-quadratic programming

We consider the problem of approximately solving a standard bi-quadratic programming (StBQP), which is NP-hard. After reformulating the original problem as an equivalent copositive tensor programming, we show how to approximate the optimal solution by approximating the cone of copositive tensors via a serial polyhedral cones. The established quality of approximation shows that, a polynomial time approximation scheme (PTAS) for solving StBQP exists and can be extended to solving standard multi-quadratic programming. Some numerical examples are provided to illustrate our approach.

math.OC↗