Solving cluster moment relaxation with hierarchical matrix
<|reference_start|>Solving cluster moment relaxation with hierarchical matrix: Convex relaxation methods are powerful tools for studying the lowest energy of many-body problems. By relaxing the representability conditions for marginals to a set of local constraints, along with a global semidefinite constraint, a polynomial-time solvable semidefinite program (SDP) that provides a lower bound for the energy can be derived. In this paper, we propose accelerating the solution of such an SDP relaxation by imposing a hierarchical structure on the positive semidefinite (PSD) primal and dual variables. Furthermore, these matrices can be updated efficiently using the algebra of the compressed representations within an augmented Lagrangian method. We achieve quadratic and even near-linear time per-iteration complexity. Through experimentation on the quantum transverse field Ising model, we showcase the capability of our approach to provide a sufficiently accurate lower bound for the exact ground-state energy.<|reference_end|>
@article{wang2024solving,
    title={Solving cluster moment relaxation with hierarchical matrix},
    author={Yi Wang and Yuehaw Khoo},
    journal={arXiv preprint arXiv:2408.00235},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.00235},
    primaryClass={math.OC cs.NA math.NA}
}