In this work, we present an in-depth study of average-case quantum distances introduced in Maciejewski et al. (2022). The average-case distances approximate, up to the relative error, the average Total-Variation (TV) distance between measurement outputs of two quantum processes, in which quantum objects of interest (states, measurements, or channels) are intertwined with random quantum circuits. Contrary to conventional distances, such as trace distance or diamond norm, they quantifyaverage-casestatistical distinguishability via random quantum circuits. We prove that once a family of random circuits forms an$\delta
−approximate4−design,with\delta =o(d^{-8})
,thentheaverage−casedistancescanbeapproximatedbysimpleexplicitfunctionsthatcanbeexpressedviasimpledegreetwopolynomialsinobjectsofinterest.Forsystemsofmoderatedimension,theycanbeeasilyexplicitlycomputed–nooptimizationisneededasopposedtodiamondnormdistancebetweenchannelsoroperationaldistancebetweenmeasurements.Weprovethatthosefunctions,whichwecallquantumaverage−casedistances,haveaplethoraofdesirableproperties,suchassubadditivityw.r.t.tensorproducts,jointconvexity,and(restricted)data−processinginequalities.Notably,alldistancesutilizetheHilbert−Schmidt(HS)norm,whichprovidesthisnormwithanewoperationalinterpretation.Wealsoprovideupperboundsonthemaximalratiobetweenworst−caseandaverage−casedistances,andforeachofthem,weprovideanexamplethatsaturatesthebound.Specifically,weshowthatforeachdimensiond
thisratioisatmostd^{\frac {1}{2}}, d, d^{\frac {3}{2}}$for states, measurements, and channels, respectively. To support the practical usefulness of our findings, we study multiple examples in which average-case quantum distances can be calculated analytically.
The trace distance between two quantum states, $\ensuremath{\rho}$ and $\ensuremath{\sigma}$, is an operationally meaningful quantity in quantum information theory. However, in general it is difficult to compute, involving the diagonalization of $\ensuremath{\rho}\ensuremath{-}\ensuremath{\sigma}$. In contrast, the Hilbert-Schmidt distance can be computed without diagonalization, although it is less operationally significant. Here, we relate the trace distance and the Hilbert-Schmidt distance with a bound that is particularly strong when either $\ensuremath{\rho}$ or $\ensuremath{\sigma}$ is low rank. Our bound is stronger than the bound one could obtain via the norm equivalence of the Frobenius and trace norms. We also consider bounds that are useful not only for low-rank states but also for low-entropy states. Our results have relevance to quantum information theory, quantum algorithm design, and quantum complexity theory.
We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any explicit topology) how far the given element is from the boundary. It is shown that one of the elements from the boundary can be always chosen to be an extremal element. We focus on evaluation of this quantity for quantum sets of states, channels, and observables. We show that boundariness is intimately related to (semi)norms that provide an operational interpretation of this quantity. In particular, the minimum error probability for discrimination of a pair of quantum devices is lower bounded by the boundariness of each of them. We proved that for states and observables this bound is saturated and conjectured this feature for channels. The boundariness is zero for infinite-dimensional quantum objects as in this case all the elements are boundary elements.
We consider the task of distinguishing whether a quantum system is prepared in a state from one of several sets of quantum states. Assuming their convexity and stability under tensor product, we prove that the optimal error exponent for discrimination is precisely given by the regularized quantum Chernoff divergence between the sets, thereby establishing a generalized quantum Chernoff bound for the discrimination of multiple sets of quantum states. This extends the classical and quantum Chernoff bounds to the general setting of composite and correlated quantum hypotheses. Furthermore, leveraging minimax theorems, we show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability. This implies the existence of an optimal state-agnostic test that achieves the minimum error probability for all states in the sets, matching the performance of the optimal state-dependent test for the most difficult pair of states. We provide explicit characterizations of the optimal state-agnostic test in the binary composite case. Finally, we show that the maximum overlap between a pure state and a set of free states, a quantity that frequently arises in quantum resource theories, is equal to the quantum Chernoff divergence between the sets, thereby providing an operational interpretation of this quantity in the context of symmetric hypothesis testing.
We consider the problem of testing multiple quantum hypotheses
{ρ1⊗n,…,ρr⊗n}, where an arbitrary prior distribution is given and each of the
r hypotheses is
n copies of a quantum state. It is known that the minimal average error probability
Pe decays exponentially to zero, that is,
Pe=exp{−ξn+o(n)}. However, this error exponent
ξ is generally unknown, except for the case that
r=2. In this paper, we solve the long-standing open problem of identifying the above error exponent, by proving Nussbaum and Szkoła’s conjecture that
ξ=mini=jC(ρi,ρj). The right-hand side of this equality is called the multiple quantum Chernoff distance, and
C(ρi,ρj):=max0≤s≤1{−logTrρisρj1−s} has been previously identified as the optimal error exponent for testing two hypotheses,
ρi⊗n versus
ρj⊗n. The main ingredient of our proof is a new upper bound for the average error probability, for testing an ensemble of finite-dimensional, but otherwise general, quantum states. This upper bound, up to a states-dependent factor, matches the multiple-state generalization of Nussbaum and Szkoła’s lower bound. Specialized to the case
r=2, we give an alternative proof to the achievability of the binary-hypothesis Chernoff distance, which was originally proved by Audenaert et al.
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary
m mixed quantum states with given prior probabilities. When
m=2, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. Then we further analyze how this lower bound is attainable for ambiguous discrimination of mixed quantum states by presenting necessary and sufficient conditions related to it. Furthermore, with a restricted condition, we work out an upper bound on the minimum-error probability for ambiguous discrimination of mixed quantum states. Therefore, some sufficient conditions are obtained for the minimum-error probability attaining this bound. Finally, under the condition of the minimum-error probability attaining this bound, we compare the minimum-error probability for ambiguously discriminating arbitrary
m mixed quantum states with the optimal failure probability for unambiguously discriminating the same states.