Searcharxiv⌕ Search

arXiv subjects

Hirak Ghosh

Publications and source records attributed to Hirak Ghosh.

2 recordsLinked to original sources

Lower bounds for testing the completely depolarizing channel

We study lower bounds to the query complexity of testing whether an unknown quantum channel mapping a $d_{\mathrm{in}}$-dimensional input to a $d_{\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 $Ω(d_{\mathrm{in}}d_{\mathrm{out}}/\varepsilon^2)$ queries; (ii) any ancilla-assisted, coherent, non-adaptive tester requires at least $\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.

quant-ph↗

Unitary Channel Testing Under a Depolarizing Noise Assumption

We present fast algorithms $\unicode{x2013}$ under the depolarizing noise assumption, often made in fault-tolerant quantum computations $\unicode{x2013}$ to test its strength. Our optimal algorithms answer the following question: is the quantum channel implemented by a given black box identical to a target unitary or $\varepsilon$-far from it in the diamond distance, assuming that the deviation is a depolarizing channel with unknown parameter? Our algorithm has a query complexity of $Θ(1/\varepsilon).$ The query complexity of the relaxed problem of testing whether the black-box channel is $\varepsilon_1$-close to a target unitary or $\varepsilon_2$-far in the diamond distance is $Θ\bigl(\varepsilon_2/(\varepsilon_2 - \varepsilon_1)^2\bigr).$ In both cases, we provide matching lower bounds that hold even for adaptive, ancilla-assisted protocols with multi-outcome incoherent measurements.

quant-ph↗