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 investigates the fragility of local indistinguishability in quantum information processing, demonstrating that specific sets of states become perfectly distinguishable when additional copies are supplied or candidate sets are reduced. The study provides explicit constructions of inclusion-minimal locally indistinguishable product-state sets, offering new insights into the structure of quantum nonlocality and its implications for distributed tasks like secret sharing.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Inclusion-Minimal local indistinguishability: a weak form of nonlocality

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

arXiv:2608.22393v1 Announce Type: new Abstract: Local discrimination of quantum states is a fundamental task in distributed quantum information processing and underlies applications such as quantum communication, data hiding, and secret sharing. Here we investigate a weak form of local indistinguishability by asking how easily it can disappear when the candidate set is reduced or an additional copy of the unknown state is supplied. We introduce inclusion-minimal locally indistinguishable sets, namely, locally indistinguishable sets for which every proper subset is perfectly distinguishable by local operations and classical communication (LOCC), and show that every finite locally indistinguishable set contains such a subset. We further find that any inclusion-minimal locally indistinguishable sets becomes perfectly distinguishable by LOCC when two identical copies are available, although a single copy is insufficient. Fininally, We construct explicit inclusion-minimal locally indistinguishable product-state sets in $(\mathbb C^d)^{\otimes n}$ for every odd $d=2k+1$ and $n\ge2$. These results show that local indistinguishability can be nontrivial at the single-copy level yet fragile under either the removal of candidate states or a modest increase in copy resources, providing a complementary perspective on the structure of quantum nonlocality.

Abstract:Local discrimination of quantum states is a fundamental task in distributed quantum information processing and underlies applications such as quantum communication, data hiding, and secret sharing. Here we investigate a weak form of local indistinguishability by asking how easily it can disappear when the candidate set is reduced or an additional copy of the unknown state is supplied. We introduce inclusion-minimal locally indistinguishable sets, namely, locally indistinguishable sets for which every proper subset is perfectly distinguishable by local operations and classical communication (LOCC), and show that every finite locally indistinguishable set contains such a subset. We further find that any inclusion-minimal locally indistinguishable sets becomes perfectly distinguishable by LOCC when two identical copies are available, although a single copy is insufficient. Fininally, We construct explicit inclusion-minimal locally indistinguishable product-state sets in $(\mathbb C^d)^{\otimes n}$ for every odd $d=2k+1$ and $n\ge2$. These results show that local indistinguishability can be nontrivial at the single-copy level yet fragile under either the removal of candidate states or a modest increase in copy resources, providing a complementary perspective on the structure of quantum nonlocality.

arXiv:2608.22393 [quant-ph]

(or arXiv:2608.22393v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.22393 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

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