Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This research establishes rigorous security bounds for quantum secret sharing schemes where devices generate qubits from independent resources, proving that leakage remains exponentially small even with correlated inputs. The findings provide critical theoretical guarantees for the robustness of distributed quantum protocols against adversaries possessing arbitrary side information about device marginals.
Sources coveringarXiv, Quantum Zeitgeist
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Quantum Leakage from Shamir Sharing with Correlated Resources

arXiv2 min read

arXiv:2610.06350v1 Announce Type: new Abstract: We study leakage from Shamir secret sharing when each device uses its share to produce one qubit from an initial quantum resource independent of the secret and sharing randomness. We prove exponentially small trace distance between the leakage states of any two secrets, when reconstruction requires a sufficiently large fraction of the shares, for fixed stationary chains satisfying an upper operator mixing condition and for resources generated by fixed finite quantum memories with primitive transfer channels. These guarantees permit arbitrary extensions of the device marginal as adversary side information and hold uniformly over prime fields larger than the number of shares. For independent device--reference pairs, which provide the quantitative input to the argument, we determine the optimal exponential base when reconstruction requires all shares: $2\sqrt2/\pi$ for a qubit and $2/\pi$ for a classical bit, in both cases allowing arbitrary finite references. A comparison of selected marginals with product states converts the bounds for independent device--reference pairs into security guarantees for the correlated resources.

Abstract:We study leakage from Shamir secret sharing when each device uses its share to produce one qubit from an initial quantum resource independent of the secret and sharing randomness. We prove exponentially small trace distance between the leakage states of any two secrets, when reconstruction requires a sufficiently large fraction of the shares, for fixed stationary chains satisfying an upper operator mixing condition and for resources generated by fixed finite quantum memories with primitive transfer channels. These guarantees permit arbitrary extensions of the device marginal as adversary side information and hold uniformly over prime fields larger than the number of shares. For independent device--reference pairs, which provide the quantitative input to the argument, we determine the optimal exponential base when reconstruction requires all shares: $2\sqrt2/\pi$ for a qubit and $2/\pi$ for a classical bit, in both cases allowing arbitrary finite references. A comparison of selected marginals with product states converts the bounds for independent device--reference pairs into security guarantees for the correlated resources.

arXiv:2610.06350 [quant-ph]

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

https://doi.org/10.48550/arXiv.2610.06350 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.

Full text under the publisher's open licence · 254 words

Related coverage