Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

analiza aiqbench

This research establishes rigorous two-sided bounds linking the approximation error of incompatible quantum channels to their generalized robustness, offering a unified framework for analyzing fundamental tradeoffs like disturbance and uncertainty. By demonstrating that these robustness-based evaluations outperform existing algebraic bounds across various dimensions, the study provides critical theoretical tools for optimizing quantum information protocols where exact joint realization is impossible.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Robustness-based bounds for approximate joint realizations of incompatible quantum channels

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2605.11924v2 Announce Type: replace Abstract: Several quantum channels may fail to admit an exact joint realization, a property known as incompatibility. Channel incompatibility unifies various quantum limitations, such as measurement uncertainty, the no-information-without-disturbance principle, and the no-cloning and no-broadcasting theorems. We address how accurately incompatible channels can be approximated by the marginals of a single joint channel, quantified by the minimum total diamond-norm error over all joint realizations. We establish two-sided bounds relating it to the generalized robustness of incompatibility (RoI), a noise-based resource quantifier of incompatibility. For identity channels, we determine both the RoI and the minimum total error exactly. The upper bound is attained by the optimal symmetric universal cloner, while the prefactor in the lower bound is asymptotically optimal as the dimension tends to infinity. Applying this result to measurement channels provides a unified, model-independent framework encompassing error-error and information-error-disturbance tradeoffs. Furthermore, our robustness-based evaluation of disturbance outperforms an algebraic bound for every non-trivial POVM in dimensions up to six.

Abstract:Several quantum channels may fail to admit an exact joint realization, a property known as incompatibility. Channel incompatibility unifies various quantum limitations, such as measurement uncertainty, the no-information-without-disturbance principle, and the no-cloning and no-broadcasting theorems. We address how accurately incompatible channels can be approximated by the marginals of a single joint channel, quantified by the minimum total diamond-norm error over all joint realizations. We establish two-sided bounds relating it to the generalized robustness of incompatibility (RoI), a noise-based resource quantifier of incompatibility. For identity channels, we determine both the RoI and the minimum total error exactly. The upper bound is attained by the optimal symmetric universal cloner, while the prefactor in the lower bound is asymptotically optimal as the dimension tends to infinity. Applying this result to measurement channels provides a unified, model-independent framework encompassing error-error and information-error-disturbance tradeoffs. Furthermore, our robustness-based evaluation of disturbance outperforms an algebraic bound for every non-trivial POVM in dimensions up to six.

arXiv:2605.11924 [quant-ph]

(or arXiv:2605.11924v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2605.11924 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 247 cuvinte

Subiecte conexe