The paper gives algorithms to decompose structured sparse matrices into polylogarithmically many sigma-basis operators and builds quantum circuits for both variational and fault-tolerant use, cutting term counts exponentially versus Pauli decompositions.
Thus, we get a total of 1+2(k−1)+1+1 = 2 k+1 C nX gates completing the proof
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Efficient Quantum Access Model for Sparse Structured Matrices using Linear Combination of Things
The paper gives algorithms to decompose structured sparse matrices into polylogarithmically many sigma-basis operators and builds quantum circuits for both variational and fault-tolerant use, cutting term counts exponentially versus Pauli decompositions.