Quantum Secret Sharing Scheme on Hypercyclic Quantum Structures

TL;DR

This paper develops efficient quantum secret sharing schemes for hypercyclic quantum access structures based on hypergraphs with three hyperedges, combining classical geometric methods with quantum systems to optimize information rates.

Contribution

It introduces a novel construction of quantum secret sharing schemes for hypercyclic structures, achieving optimal information rates and extending efficiency concepts from quantum key distribution.

Findings

Classifies hypercycles with three hyperedges into 12 non-isomorphic types.

Constructs classical perfect secret sharing schemes with optimal information rates for hypercyclic structures.

Proves the constructed QSS schemes achieve the highest efficiency among existing solutions.

Abstract

This paper investigates the construction of efficient quantum secret sharing schemes for quantum access structures based on hypergraphs with three hyperedges. We prove that hypercycles with three hyperedges are quantum access structures if and only if they can be classified into 12 non-isomorphic types under hypergraph isomorphism, and these hypercyclic quantum access structures encompass all four hyperstars with three hyperedges.In prior work, efficient and perfect quantum secret sharing schemes were constructed for hyperstar access structures with three hyperedges using single photons in d -dimensional quantum systems. These schemes correspond to classical perfect secret sharing schemes with optimal information rates. However, for hypercyclic access structures with three hyperedges, the method described above fails to yield classical perfect secret sharing schemes with optimal information rates. In this work, we explicitly construct classical perfect secret sharing schemes with optimal information rates for these access structures by combining Simmons' geometric method with Shamir's threshold scheme. Subsequently, we employ single photons in d-dimensional quantum systems to build perfect QSS schemes upon these classical constructions.We introduce the concept of idealized information rate for minimal access structures in perfect QSS schemes. By extending the notion of efficiency proposed by Cabello [Phys. Rev. Lett., vol. 85, no. 26, p. 5635, 2000] for quantum key distribution protocols to QSS, we define the efficiency of minimally authorized subsets. Furthermore, we establish the relationship between the efficiency of minimally authorized subsets and the idealized information rate of minimal access structures. Finally, we rigorously prove that the QSS schemes constructed in this work achieve the highest efficiency among existing solutions.