On the application of matrix congruence to QUBO formulations for systems of linear equations
On the application of matrix congruence to QUBO formulations for systems of linear equations
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 …