Table of Contents
Fetching ...

Quantum Channel Certification with Incoherent Strategies

Omar Fawzi, Nicolas Flammarion, Aurélien Garivier, Aadil Oufkir

TL;DR

This work proves that, in the non-adaptive setting, uses of the channel are necessary and sufficient to verify whether it is equal to the depolarizing channel or $\varepsilon-far from it in the diamond norm, and proves a lower bound of $\Omega(d_{\text{in}}^2d-out}}/\varePSilon^2)$ for this problem in the adaptive setting.

Abstract

In the problem of quantum channel certification, we have black box access to a quantum process and would like to decide if this process matches some predefined specification or is $\varepsilon$-far from this specification. The objective is to achieve this task while minimizing the number of times the black box is used. Here, we focus on optimal incoherent strategies for two relevant extreme cases of channel certification. The first one is when the predefined specification is a unitary channel, e.g., a gate in a quantum circuit. In this case, we show that testing whether the black box is described by a fixed unitary operator in dimension $d$ or $\varepsilon$-far from it in the trace norm requires $Θ(d/\varepsilon^2)$ uses of the black box. The second setting we consider is when the predefined specification is a completely depolarizing channel with input dimension $d_{\text{in}}$ and output dimension $d_{\text{out}}$. In this case, we prove that, in the non-adaptive setting, $\tildeΘ(d_{\text{in}}^2d_{\text{out}}^{1.5}/\varepsilon^2)$ uses of the channel are necessary and sufficient to verify whether it is equal to the depolarizing channel or $\varepsilon$-far from it in the diamond norm. Finally, we prove a lower bound of $Ω(d_{\text{in}}^2d_{\text{out}}/\varepsilon^2)$ for this problem in the adaptive setting. Note that the special case $d_{\text{in}} = 1$ corresponds to the well-studied quantum state certification problem.

Quantum Channel Certification with Incoherent Strategies

TL;DR

This work proves that, in the non-adaptive setting, uses of the channel are necessary and sufficient to verify whether it is equal to the depolarizing channel or \Omega(d_{\text{in}}^2d-out}}/\varePSilon^2)$ for this problem in the adaptive setting.

Abstract

In the problem of quantum channel certification, we have black box access to a quantum process and would like to decide if this process matches some predefined specification or is -far from this specification. The objective is to achieve this task while minimizing the number of times the black box is used. Here, we focus on optimal incoherent strategies for two relevant extreme cases of channel certification. The first one is when the predefined specification is a unitary channel, e.g., a gate in a quantum circuit. In this case, we show that testing whether the black box is described by a fixed unitary operator in dimension or -far from it in the trace norm requires uses of the black box. The second setting we consider is when the predefined specification is a completely depolarizing channel with input dimension and output dimension . In this case, we prove that, in the non-adaptive setting, uses of the channel are necessary and sufficient to verify whether it is equal to the depolarizing channel or -far from it in the diamond norm. Finally, we prove a lower bound of for this problem in the adaptive setting. Note that the special case corresponds to the well-studied quantum state certification problem.
Paper Structure (19 sections, 35 theorems, 214 equations, 2 figures, 2 tables, 3 algorithms)

This paper contains 19 sections, 35 theorems, 214 equations, 2 figures, 2 tables, 3 algorithms.

Key Result

Theorem 3.1

There is an incoherent ancilla-free algorithm for testing identity to identity in the trace distance using only $N=\mathcal{O}\left( \frac{d}{\varepsilon^2}\right)$ measurements. Moreover, this algorithm can also solve the testing identity to identity problem in the diamond distance using only $N=\m

Figures (2)

  • Figure 1: Illustration of an ancilla-free incoherent non-adaptive (left) and adaptive (right) strategies for testing identity of quantum channels. The observations $(x_1, \dots, x_{N})$ are then processed with a classical algorithm to answer $H_0$ or $H_1$.
  • Figure 2: Illustration of an ancilla-assisted incoherent non-adaptive (left) and adaptive (right) strategies for testing identity of quantum channels. The observations $(x_1, \dots, x_{N})$ are then processed with a classical algorithm to answer $H_0$ or $H_1$.

Theorems & Definitions (57)

  • Theorem 3.1
  • Lemma 4.1
  • Lemma 4.2
  • Theorem 4.3
  • Theorem 4.4
  • Theorem 4.5
  • Theorem 4.6
  • Lemma A.1
  • proof
  • Lemma A.2
  • ...and 47 more