Unitarity estimation for quantum channels

TL;DR

This paper introduces a unified, optimal framework for estimating the unitarity of quantum channels using coherent and incoherent access, with implications for quantum device benchmarking.

Contribution

It provides ancilla-efficient algorithms with optimal query complexity for unitarity estimation and resolves the query complexity of distinguishing depolarizing and unitary channels.

Findings

Algorithms with $O(rac{1}{ ext{epsilon}^2})$ and $O(rac{ ext{sqrt}(d)}{ ext{epsilon}^2})$ calls for coherent and incoherent access.

Proved the optimality of the $d$-dependence and $ ext{epsilon}$-dependence in the algorithms.

Established a matching lower bound $ ext{Omega}( ext{sqrt}(d))$ for distinguishing depolarizing and unitary channels.

Abstract

Estimating the unitarity of an unknown quantum channel $\mathcal{E}$ provides information on how much it is unitary, which is a basic and important problem in quantum device certification and benchmarking. Unitarity estimation can be performed with either coherent or incoherent access, where the former in general leads to better query complexity while the latter allows more practical implementations. In this paper, we provide a unified framework for unitarity estimation, which induces ancilla-efficient algorithms that use $O(\epsilon^{-2})$ and $O(\sqrt{d}\cdot\epsilon^{-2})$ calls to $\mathcal{E}$ with coherent and incoherent accesses, respectively, where $d$ is the dimension of the system that $\mathcal{E}$ acts on and $\epsilon$ is the required precision. We further show that both the $d$-dependence and $\epsilon$-dependence of our algorithms are optimal. As part of our results, we settle the query complexity of the distinguishing problem for depolarizing and unitary channels with incoherent access by giving a matching lower bound $\Omega(\sqrt{d})$, improving the prior best lower bound $\Omega(\sqrt[3]{d})$ by Aharonov et al. (Nat. Commun. 2022) and Chen et al. (FOCS 2021).