betaFeedback

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 dind_{\mathrm{in}}-dimensional input to a doutd_{\mathrm{out}}-dimensional output is the completely depolarizing channel or is ε\varepsilon-far from it in diamond distance. We show that for this task (i) any ancilla-assisted, coherent, adaptive tester requires at least Ω(dindout/ε2)Ω(d_{\mathrm{in}}d_{\mathrm{out}}/\varepsilon^2) queries; (ii) any ancilla-assisted, coherent, non-adaptive tester requires at least max⁡{Ω(din1.5dout/ε2),Ω(din2/ε2)}\max\{Ω(d_{\mathrm{in}}^{1.5}d_{\mathrm{out}}/\varepsilon^2), Ω(d_{\mathrm{in}}^{2}/\varepsilon^2)\} 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 ε\varepsilon-far from the entire set in diamond distance.

Paper details

vlnc:W_cjdu3zfx
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

GPT-5.6 Sol (bare)

View statement
Looking for related papers…