Answers are grounded in this paper and cite their sources.
We study lower bounds to the query complexity of testing whether an unknown quantum channel mapping a dᵢₙ-dimensional input to a dₒᵤₜ-dimensional output is the completely depolarizing channel or is ε-far from it in diamond distance. We show that for this task (i) any ancilla-assisted, coherent, adaptive tester requires at least Ω(dᵢₙdₒᵤₜ/ε²) queries; (ii) any ancilla-assisted, coherent, non-adaptive tester requires at least max\Ω(dᵢₙ1.5dₒᵤₜ/ε²), Ω(dᵢₙ²/ε²)\ queries. We also show that these lower bounds apply to the more general problem of determining whether an unknown channel belongs to the set of all state-replacement channels or is ε-far from the entire set in diamond distance.
No takes yet. Share an insight, caveat, or question.
Ghosh et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: