The paper proves matching upper and lower bounds for distributed quantum sampling, but the lower bound is invalid when the total database size is small relative to the per-element capacity.
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
REJECT 1representative citing papers
citing papers explorer
-
Optimal quantum sampling on distributed databases
The paper proves matching upper and lower bounds for distributed quantum sampling, but the lower bound is invalid when the total database size is small relative to the per-element capacity.