REVIEW 4 cited by
Graph States for Quantum Secret Sharing
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We consider three broad classes of quantum secret sharing with and without eavesdropping and show how a graph state formalism unifies otherwise disparate quantum secret sharing models. In addition to the elegant unification provided by graph states, our approach provides a generalization of threshold classical secret sharing via insecure quantum channels beyond the current requirement of 100% collaboration by players to just a simple majority in the case of five players. Another innovation here is the introduction of embedded protocols within a larger graph state that serves as a one-way quantum information processing system.
Forward citations
Cited by 4 Pith papers
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
Combinatorial aspects of holographic quantum secret sharing
Bulk regions in AdS3/CFT2 get a holographic secret-sharing distance d and thresholds (r,s), with r = n - d + 1; pure states satisfy s = d - 1 while mixed states can satisfy s >= d.
-
Calibrated hypergraph states: II calibrated hypergraph state construction and applications
Calibrated hypergraph states over Galois rings generalize weighted hypergraph states, are stabilizer and locally maximally entangleable, and reduce to the weighted class in the qubit case only.
-
Calibrated hypergraph states: I calibrated hypergraph and multi qudit state monads
Calibrated hypergraphs and multi-qudit states are shown to form graded Ω monads, providing a categorical foundation for a broad generalization of hypergraph states.
Discussion (0). Continue with ORCID to comment.