Quantum Gauss Jordan Elimination

Abstract

In this paper we construct the Quantum GaußJordan Elimination (QGJE) Algorithm and estimate the complexity time of computation of Reduced Row Echelon Form (RREF) of an $N\times N$ matrix using QGJE procedure. The main theorem asserts that QGJE has computation time of order $2^{N/2}$.

Cited by in corpus (1)

• Quantum Communication and Quantum Multivariate Polynomial Interpolation