WorksPhysics and Astronomy
Lower bounds for testing the completely depolarizing channel
Abstract
We study lower bounds to the query complexity of testing whether an unknown quantum channel mapping a -dimensional input to a -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 queries; (ii) any ancilla-assisted, coherent, non-adaptive tester requires at least 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.