SearcharxivSearch

arXiv subjects

Alicia Negre

Publications and source records attributed to Alicia Negre.

2 recordsLinked to original sources

A quadratic Grassmann manifold optimization problem arising from quantum embedding methods

This article presents a mathematical analysis and numerical strategies for solving the optimization problem of minimizing the quadratic function $J(P) = \text{Tr}(BP)- \frac{1}{2} \text{Tr}(A P A P)$, where $A,B \in \mathbb R^{M \times M}_{\rm sym}$, with $A \succeq 0$, over the Grassmann manifold ${\rm Gr}(m,\mathbb R^M)$. While this problem is non-convex and typically admits non-global local minima - posing challenges for Riemannian optimization and self-consistent field (SCF) algorithms - we identify cases where the global minimizer can be obtained by solving an auxiliary convex problem. When this approach is not directly applicable, the solution to the auxiliary problem still serves as an effective initialization for Riemannian optimization methods and SCF algorithms, significantly improving their performance. This work is motivated by applications in quantum embedding methods, particularly in the construction of bath orbitals, where such optimization problems naturally arise.

math.OC

New perspectives on Density-Matrix Embedding Theory

Quantum embedding methods enable the study of large, strongly correlated quantum systems by (usually self-consistent) decomposition into computationally manageable subproblems, in the spirit of divide-and-conquer methods. Among these, Density Matrix Embedding Theory (DMET) is an efficient approach that enforces self-consistency at the level of one-particle reduced density matrices (1-RDMs), facilitating applications across diverse quantum systems. However, conventional DMET is constrained by the requirement that the global 1-RDM (low-level descriptor) be an orthogonal projector, limiting flexibility in bath construction and potentially impeding accuracy in strongly correlated regimes. In this work, we introduce a generalized DMET framework in which the low-level descriptor can be an arbitrary 1-RDM and the bath construction is based on optimizing a quantitative criterion related to the maximal disentanglement between different fragments. This yields an alternative yet controllable bath space construction for generic 1-RDMs, lifting a key limitation of conventional DMET. We demonstrate its consistency with conventional DMET in appropriate limits and exploring its implications for bath construction, downfolding (impurity Hamiltonian construction), low-level solvers, and adaptive fragmentation. We expect that this more flexible framework, which leads to several new variants of DMET, can improve the robustness and accuracy of DMET.

cond-mat.str-el