Bounds on the information rate of quantum-secret-sharing schemes

Journal Article · Fri Apr 15 00:00:00 EDT 2011 · Physical Review. A

DOI:https://doi.org/10.1103/PHYSREVA.83.042324· OSTI ID:21544591

Sarvepalli, Pradeep ^[1]

---

1. Department of Physics and Astronomy, University of British Columbia, Vancouver, British Columbia, V6T 1Z1 (Canada)

An important metric of the performance of a quantum-secret-sharing scheme is its information rate. Beyond the fact that the information rate is upper-bounded by one, very little is known in terms of bounds on the information rate of quantum-secret-sharing schemes. Furthermore, not every scheme can be realized with rate one. In this paper we derive upper bounds for the information rates of quantum-secret-sharing schemes. We show that there exist quantum access structures on n players for which the information rate cannot be better than O((log{sub 2}n)/n). These results are the quantum analogues of the bounds for classical-secret-sharing schemes proved by Csirmaz.

• OSTI ID: 21544591
• Journal Information: Physical Review. A, Vol. 83, Issue 4; Other Information: DOI: 10.1103/PhysRevA.83.042324; (c) 2011 American Institute of Physics; ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

71 CLASSICAL AND QUANTUM MECHANICS
GENERAL PHYSICS
METRICS
PERFORMANCE
QUANTUM CRYPTOGRAPHY
QUANTUM INFORMATION
SECRECY PROTECTION
CRYPTOGRAPHY
INFORMATION