ﻻ يوجد ملخص باللغة العربية
We conjecture that all connected graphs of order $n$ have von Neumann entropy at least as great as the star $K_{1,n-1}$ and prove this for almost all graphs of order $n$. We show that connected graphs of order $n$ have Renyi 2-entropy at least as great as $K_{1,n-1}$ and for $alpha>1$, $K_n$ maximizes Renyi $alpha$-entropy over graphs of order $n$. We show that adding an edge to a graph can lower its von Neumann entropy.
An alternative method is presented for extracting the von Neumann entropy $-operatorname{Tr} (rho ln rho)$ from $operatorname{Tr} (rho^n)$ for integer $n$ in a quantum system with density matrix $rho$. Instead of relying on direct analytic continuati
The R{e}nyi and von Neumann entropies of the thermal state in the generalized uncertainty principle (GUP)-corrected single harmonic oscillator system are explicitly computed within the first order of the GUP parameter $alpha$. While the von Neumann e
We present a method to measure the von Neumann entanglement entropy of ground states of quantum many-body systems which does not require access to the system wave function. The technique is based on a direct thermodynamic study of entanglement Hamilt
The R{e}nyi and von Neumann entropies of various bipartite Gaussian states are derived analytically. We also discuss on the tripartite purification for the bipartite states when some particular conditions hold. The generalization to non-Gaussian states is briefly discussed.
A unital ring is called clean (resp. strongly clean) if every element can be written as the sum of an invertible element and an idempotent (resp. an invertible element and an idempotent that commutes). T.Y. Lam proposed a question: which von Neumann