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.
This paper focuses on the core algorithm layer of quan- tum computers and aims to design a set of quantum cir- cuit schemes for implementing basic matrix operations
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 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.