Presents quantum circuits for row addition, row swapping, trace, and transpose of amplitude-encoded matrices, with O(log N) or O(m) gate complexity after state preparation.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Quantum Algorithms for Matrix Operations Based on Unitary Transformations and Ancillary State Measurements
Presents quantum circuits for row addition, row swapping, trace, and transpose of amplitude-encoded matrices, with O(log N) or O(m) gate complexity after state preparation.