analiza aiqbench
This research establishes the existence of "bound information" in classical cryptography by demonstrating correlations that are costly to create yet yield no extractable secret bits, mirroring quantum bound entanglement. The study reveals a fundamental gap between different informational comparisons regarding eavesdroppers and clarifies which specific measurement purifications actually exhibit this irreversibility rather than standard-basis outcomes. This work deepens the theoretical understanding of resource limitations in information theory without relying on direct AI or machine learning applications.
Bipartite Bound Information Exists
arXiv:2607.25838v1 Announce Type: new Abstract: Bound entanglement is an extreme irreversibility of quantum theory: certain states cost entanglement to create, yet no singlet can be distilled from them. Twenty-five years ago, Gisin and Wolf asked whether classical cryptography admits the same phenomenon. Are there correlations, shared by two parties and an eavesdropper, that cost secret bits to create although none can be extracted? We show that such bound information exists and give an explicit example, a distribution of two bits and a trit. The proof exploits a gap between two ways of comparing eavesdroppers: one can be better informed than another in every mutual-information comparison and nevertheless unable to simulate the other's data. We further prove that the distributions which motivated the conjecture, standard-basis measurements of bound-entangled qutrit states, are not themselves examples: a secret key is extractable from them whenever their creation costs any secrecy. Other measurements of their purifications, in contrast, do yield bound information, even for the separable states among them. The analogy is thus one of resources, not of individual states and their measurement outcomes.
Abstract:Bound entanglement is an extreme irreversibility of quantum theory: certain states cost entanglement to create, yet no singlet can be distilled from them. Twenty-five years ago, Gisin and Wolf asked whether classical cryptography admits the same phenomenon. Are there correlations, shared by two parties and an eavesdropper, that cost secret bits to create although none can be extracted? We show that such bound information exists and give an explicit example, a distribution of two bits and a trit. The proof exploits a gap between two ways of comparing eavesdroppers: one can be better informed than another in every mutual-information comparison and nevertheless unable to simulate the other's data. We further prove that the distributions which motivated the conjecture, standard-basis measurements of bound-entangled qutrit states, are not themselves examples: a secret key is extractable from them whenever their creation costs any secrecy. Other measurements of their purifications, in contrast, do yield bound information, even for the separable states among them. The analogy is thus one of resources, not of individual states and their measurement outcomes.
arXiv:2607.25838 [quant-ph]
(or arXiv:2607.25838v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2607.25838 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
example3_parity_family.py
verify_bound_information.py
verify_example3_four_copy.py
verify_example3_two_copy.py
verify_fixed_horodecki_bound_information.py
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 · 270 cuvinte
Subiecte conexe

A random quantum state of three qubits is not always entangled
Quantum Zeitgeist · 14 oct. 2026

Thermalisation Timescale Grows Logarithmically With Qubit Region Distance
Quantum Zeitgeist · 20 aug. 2026
Accessible Quantum Correlations Under Complexity Constraints
arXiv · 1 oct. 2026
Object Detection Using Quantum Transfer Learning
arXiv · 15 sept. 2026