Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
Sample-optimal quantum process tomography with non-adaptive incoherent measurements
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
The optimal wealth growth rate equals lim n→∞ of n^{-1} times inf KL(Q^n, P) over the bipolar of the n-fold null set, which is achievable and cannot be exceeded.
citing papers explorer
-
Strict Hierarchy for Quantum Channel Certification to Unitary
Optimal algorithms achieve query complexities Θ(d/ε²) for incoherent access, Θ(d/ε) for coherent access, and Θ(√d/ε) for source-code access in quantum channel certification to unitary, exactly matching prior lower bounds.
-
The optimal betting wealth growth rate
The optimal wealth growth rate equals lim n→∞ of n^{-1} times inf KL(Q^n, P) over the bipolar of the n-fold null set, which is achievable and cannot be exceeded.