In this paper we construct the Quantum Gau\ss Jordan Elimination (QGJE) Algorithm and estimate the complexity time of computation of Reduced Row Echelon Form (RREF) of an N×N matrix using QGJE procedure. The main theorem asserts that QGJE has computation time of order 2N/2.
Cite
@article{arxiv.quant-ph/0511062,
title = {Quantum Gauss Jordan Elimination},
author = {Do Ngoc Diep and Do Hoang Giang},
journal= {arXiv preprint arXiv:quant-ph/0511062},
year = {2017}
}