Quantum Algorithms for Matrix Operations Based on Unitary Transformations and Ancillary State Measurements (2501.15137v1)

Abstract: Matrix operations are of great significance in quantum computing, which manipulate quantum states in information processing. This paper presents quantum algorithms for several important matrix operations. By leveraging multi-qubit Toffoli gates and basic single-qubit operations, these algorithms efficiently carry out matrix row addition, row swapping, trace calculation and transpose. By using the ancillary measurement techniques to eliminate redundant information, these algorithms achieve streamlined and efficient computations, and demonstrate excellent performance with the running time increasing logarithmically as the matrix dimension grows, ensuring scalability. The success probability depends on the matrix dimensions for the trace calculation, and on the matrix elements for row addition. Interestingly, the success probability is a constant for matrix row swapping and transpose, highlighting the reliability and efficiency.