Estimating k powers of a quantum state against one observable simultaneously costs Θ~(k) samples, matching the cost of the single hardest term.
Computation with Unitaries and One Pure Qubit
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We define a semantic complexity class based on the model of quantum computing with just one pure qubit (as introduced by Knill and Laflamme) and discuss its computational power in terms of the problem of estimating the trace of a large unitary matrix. We show that this problem is complete for the complexity class, and derive some further fundamental features of the class. We conclude with a discussion of some associated open conjectures and new oracle separations between classes.
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Simultaneous Estimation of Nonlinear Functionals of a Quantum State
Estimating k powers of a quantum state against one observable simultaneously costs Θ~(k) samples, matching the cost of the single hardest term.