Tight constraints on probabilistic convertibility of quantum states
Bartosz Regula

TL;DR
This paper introduces new theoretical methods to precisely characterize the limits of probabilistic quantum state transformations within resource theories, providing tight bounds and necessary conditions for resource distillation.
Contribution
It develops a resource monotone based on the Hilbert projective metric and a convex optimization framework to tightly bound probabilistic quantum state transformations, advancing understanding in resource theories.
Findings
The resource monotone provides necessary and sufficient conditions for one-shot convertibility.
The methods establish tight bounds on probabilistic resource distillation performance.
Application to entanglement distillation demonstrates practical relevance.
Abstract
We develop two general approaches to characterising the manipulation of quantum states by means of probabilistic protocols constrained by the limitations of some quantum resource theory. First, we give a general necessary condition for the existence of a physical transformation between quantum states, obtained using a recently introduced resource monotone based on the Hilbert projective metric. In all affine quantum resource theories (e.g. coherence, asymmetry, imaginarity) as well as in entanglement distillation, we show that the monotone provides a necessary and sufficient condition for one-shot resource convertibility under resource-non-generating operations, and hence no better restrictions on all probabilistic protocols are possible. We use the monotone to establish improved bounds on the performance of both one-shot and many-copy probabilistic resource distillation protocols.…
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 Computing Algorithms and Architecture · Quantum Information and Cryptography · Stochastic Gradient Optimization Techniques
