On the application of matrix congruence to QUBO formulations for systems of linear equations
Quantum Physics
2021-11-02 v1
Abstract
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively parallelize quadratic unconstrained binary optimization (QUBO) formulations of systems of linear equations. In this paper, we simplify these formulations by exploiting congruence of real symmetric matrices to diagonal matrices. We further exhibit computational merits of the proposed QUBO models, which can outperform classical algorithms such as QR and SVD decomposition.
Keywords
Cite
@article{arxiv.2111.00747,
title = {On the application of matrix congruence to QUBO formulations for systems of linear equations},
author = {Sun Woo Park and Hyunju Lee and Byung Chun Kim and Youngho Woo and Kyungtaek Jun},
journal= {arXiv preprint arXiv:2111.00747},
year = {2021}
}