Improving quantum channel discrimination with resourceful states
Kenji Nakahira

TL;DR
This paper establishes a quantitative link between resourcefulness of quantum states and their advantage in channel discrimination, using the robustness measure to evaluate improvements with or without auxiliary systems.
Contribution
It introduces a general framework connecting resource measures to discrimination success, applicable even in non-convex resource theories, and clarifies the operational meaning of robustness.
Findings
Robustness measure precisely quantifies discrimination advantage.
Resource states outperform resourceless states in channel discrimination.
The framework applies to theories with non-convex state spaces.
Abstract
One of the key issues in quantum discrimination problems is understanding the extent of the advantages in discrimination performance when using resource states compared to resourceless states. We show that in any resource theory of states, which may not be convex, the extent to which the maximum average success probability can be improved in quantum channel discrimination problems without using auxiliary systems can be precisely quantified by the robustness measure. This result offers an intuitive operational meaning of the robustness measure in any convex resource theory. Furthermore, we demonstrate that the robustness measure can also quantify the improvement in channel discrimination problems that use auxiliary systems. Using these findings, resources can be fully characterized to achieve higher success probabilities than any state without the given resource in channel discrimination…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture
