Sparse QROM has optimal Clifford+T cost Θ(√(sm)+√(sn)), yielding matching optimal T-counts for s-sparse state preparation and s-sparse block encoding.
RecSplit: minimal perfect hashing via recursive splitting
1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.
1
Pith paper citing it
2
external citations · OpenAlex
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding
Sparse QROM has optimal Clifford+T cost Θ(√(sm)+√(sn)), yielding matching optimal T-counts for s-sparse state preparation and s-sparse block encoding.