REVIEW 4 cited by
Quantum secret sharing with qudit graph states
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
Signed reviews
read the original abstract
We present a unified formalism for threshold quantum secret sharing using graph states of systems with prime dimension. We construct protocols for three varieties of secret sharing: with classical and quantum secrets shared between parties over both classical and quantum channels.
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.