Pith. sign in

REVIEW 2 cited by

Quantum secret sharing with qudit graph states

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 1004.4619 v3 pith:QWPTSSZJ submitted 2010-04-26 quant-ph

Adrian Keet , Ben Fortescue , Damian Markham , Barry C. Sanders This is my paper
classification quant-ph
keywords quantumsecretsharingclassicalgraphstateschannelsconstruct
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Local Equivalences of Graph States

    quant-ph 2025-11 conditional novelty 8.0 of 10

    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.

  2. Combinatorial aspects of holographic quantum secret sharing

    hep-th 2026-07 conditional novelty 6.0 of 10

    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.

Pith tools