research

Quantum Gauss Jordan Elimination

Abstract

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×NN\times N matrix using QGJE procedure. The main theorem asserts that QGJE has computation time of order 2N/22^{N/2}

    Similar works

    Full text

    thumbnail-image

    Available Versions