English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

An important metric of the performance of a quantum secret sharing scheme isits information rate. Beyond the fact that the information rate is upperbounded by one, very little is known in terms of bounds on the information rateof quantum secret sharing schemes. Further, not every scheme can be realizedwith rate one. In this paper we derive new upper bounds for the informationrates of quantum secret sharing schemes. We show that there exist quantumaccess structures on $n$ players for which the information rate cannot bebetter than $O((\log_2 n)/n)$. These results are the quantum analogues of thebounds for classical secret sharing schemes proved by Csirmaz.

Bounds on the Information Rate of Quantum Secret Sharing Schemes