Unitary quantum space complexity is lower bounded by log approximate span program size, and an explicit function requires (log n)^(2-o(1)) space for monotone phase estimation algorithms.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Span Programs and Quantum Space Complexity
Unitary quantum space complexity is lower bounded by log approximate span program size, and an explicit function requires (log n)^(2-o(1)) space for monotone phase estimation algorithms.