Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2001.05376 · Physical Review A

Evaluating the advantage of adaptive strategies for quantum channel distinguishability

Vishal Katariya, Mark M. Wilde

Published Nov 8, 2021• 31 citations
arXivHTMLPDF

Abstract

Quantum strategies are a generalization of quantum channels, allowing for multiple interactions over multiple rounds. Here, the authors expand the resource theory of asymmetric distinguishability to quantum strategies. They find that adaptive, sequential strategies may offer an advantage over parallel ones in the discrimination of amplitude damping channels.

DOI
10.1103/physreva.104.052406

Related papers

Resource theory of asymmetric distinguishability for quantum channels

Xin Wang, Mark M. Wilde

The authors propose that distinguishability is a resource that can be quantified and manipulated, similar to energy or entanglement. This take allows to solve problems that were previously unsolved in quantum channel discrimination. Their approach leads to a mathematical formula for the asymptotic rate at which two different quantum channels can be discriminated, when they are called many times and processed in the most general way allowed by quantum mechanics.

arXiv:1907.06306•Physical Review Research•Dec 11, 2019•97 citations

Resource theory of asymmetric distinguishability for quantum channels

Xin Wang, Mark M. Wilde

This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory for states [Matsumoto, arXiv:1010.1030, Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170]. The key constituents of the channel resource theory are quantum channel boxes, consisting of a pair of quantum channels, which can be manipulated for free by means of an arbitrary quantum superchannel (the most general physical transformation of a quantum channel). One main question of the resource theory is the approximate channel box transformation problem, in which the goal is to transform an initial channel box (or boxes) to a final channel box (or boxes), while allowing for an asymmetric error in the transformation. The channel resource theory is richer than its counterpart for states because there is a wider variety of ways in which this question can be framed, either in the one-shot or n-shot regimes, with the latter having parallel and sequential variants. As in our prior work [Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170], we consider two special cases of the general channel box transformation problem, known as distinguishability distillation and dilution. For the one-shot case, we find that the optimal values of the various tasks are equal to the nonsmooth or smooth channel min- or max-relative entropies, thus endowing all of these quantities with operational interpretations. In the asymptotic sequential setting, we prove that the exact distinguishability cost is equal to the channel max-relative entropy and the distillable distinguishability is equal to the amortized channel relative entropy of [Berta, Hirche, Kaur, and Wilde, arXiv:1808.01498]. This latter result can also be understood as a solution to Stein's lemma for quantum channels in the sequential setting. Finally, the theory simplifies significantly for environment-seizable and classical-quantum channel boxes.

Civil War Book Review•Dec 11, 2019•67 citations

Sequential Quantum Channel Discrimination

Yonglong Li, Christoph Hirche, Marco Tomamichel

We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.

arXiv:2210.11079•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•10 citations

Adaptive versus nonadaptive strategies for quantum channel discrimination

Aram W. Harrow, Avinatan Hassidim, Debbie Leung +1 more

We provide a simple example that illustrates the advantage of adaptive over nonadaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by means of an adaptive strategy that requires just two channel evaluations, but for which no nonadaptive strategy can give a perfect discrimination using any finite number of channel evaluations.

arXiv:0909.0256•Physical Review A•Mar 31, 2010•120 citations

Parallelization of Adaptive Quantum Channel Discrimination in the Non-Asymptotic Regime

Bjarne Bergh, Nilanjana Datta, Robert Salzmann +1 more

We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error probability, adaptive strategies are asymptotically not more powerful than parallel ones. We extend this result to the non-asymptotic regime with finitely many channel uses, by explicitly constructing a parallel strategy for any given adaptive strategy, and bounding the difference in their performances, measured in terms of the decay rate of the type II error probability per channel use. We further show that all parallel strategies can be optimized over in time polynomial in the number of channel uses, and hence our result can also be used to obtain a poly-time-computable asymptotically tight upper bound on the performance of general adaptive strategies.

arXiv:2206.08350•IEEE Transactions on Information Theory•Jan 31, 2024•21 citations

Stein’s Lemma for Classical-Quantum Channels

Mario Berta, Christoph Hirche, Eneet Kaur +1 more

It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8), 3807 (2009)] showed that in the asymptotic regime, the exponential error rate for the discrimination of classical channels is not improved in the adaptive setting. We show that, for the discrimination of classical-quantum channels, adaptive strategies do not lead to an asymptotic advantage. As our main result, this establishes Stein's lemma for classical-quantum channels. Our proofs are based on the concept of amortized distinguishability of channels, which we analyse using entropy inequalities.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2019•5 citations
Quantum strategies are a generalization of quantum channels, allowing for multiple interactions over multiple rounds. Here, the authors expand the resource theory of asymmetric distinguishability to quantum strategies. They find that adaptive, sequential strategies may offer an advantage over parallel ones in the discrimination of amplitude damping channels.
This paper develops the resource theory of asymmetric distinguishability for quantum channels, generalizing the related resource theory for states [Matsumoto, arXiv:1010.1030, Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170]. The key constituents of the channel resource theory are quantum channel boxes, consisting of a pair of quantum channels, which can be manipulated for free by means of an arbitrary quantum superchannel (the most general physical transformation of a quantum channel). One main question of the resource theory is the approximate channel box transformation problem, in which the goal is to transform an initial channel box (or boxes) to a final channel box (or boxes), while allowing for an asymmetric error in the transformation. The channel resource theory is richer than its counterpart for states because there is a wider variety of ways in which this question can be framed, either in the one-shot or n-shot regimes, with the latter having parallel and sequential variants. As in our prior work [Wang and Wilde, Phys. Rev. Research 1, 033170 (2019)10.1103/PhysRevResearch.1.033170], we consider two special cases of the general channel box transformation problem, known as distinguishability distillation and dilution. For the one-shot case, we find that the optimal values of the various tasks are equal to the nonsmooth or smooth channel min- or max-relative entropies, thus endowing all of these quantities with operational interpretations. In the asymptotic sequential setting, we prove that the exact distinguishability cost is equal to the channel max-relative entropy and the distillable distinguishability is equal to the amortized channel relative entropy of [Berta, Hirche, Kaur, and Wilde, arXiv:1808.01498]. This latter result can also be understood as a solution to Stein's lemma for quantum channels in the sequential setting. Finally, the theory simplifies significantly for environment-seizable and classical-quantum channel boxes.
We consider the sequential quantum channel discrimination problem using adaptive and non-adaptive strategies. In this setting the number of uses of the underlying quantum channel is not fixed but a random variable that is either bounded in expectation or with high probability. We show that, by using adaptive strategies for the discrimination problem, both types of error probabilities decrease to zero exponentially fast and the rates are characterized by the measured relative entropy between two quantum channels. Allowing for quantum memory, we see that the optimal rates are given by the regularized channel relative entropy. We also characterize the error exponents in the discrimination problem if non-adaptive strategies are used.
We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error probability, adaptive strategies are asymptotically not more powerful than parallel ones. We extend this result to the non-asymptotic regime with finitely many channel uses, by explicitly constructing a parallel strategy for any given adaptive strategy, and bounding the difference in their performances, measured in terms of the decay rate of the type II error probability per channel use. We further show that all parallel strategies can be optimized over in time polynomial in the number of channel uses, and hence our result can also be used to obtain a poly-time-computable asymptotically tight upper bound on the performance of general adaptive strategies.
It is well known that for the discrimination of classical and quantum channels in the finite, non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive strategies. However, Hayashi [IEEE Trans. Inf. Theory 55(8), 3807 (2009)] showed that in the asymptotic regime, the exponential error rate for the discrimination of classical channels is not improved in the adaptive setting. We show that, for the discrimination of classical-quantum channels, adaptive strategies do not lead to an asymptotic advantage. As our main result, this establishes Stein's lemma for classical-quantum channels. Our proofs are based on the concept of amortized distinguishability of channels, which we analyse using entropy inequalities.