Pith. sign in

REVIEW 2 cited by

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

arxiv quant-ph/9806063 v2 pith:YIUROAWZ submitted 1998-06-18 quant-ph

Quantum secret sharing

classification quant-ph
keywords partsquantummessagepresenceproceduresecretsharingstates
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Secret sharing is a procedure for splitting a message into several parts so that no subset of parts is sufficient to read the message, but the entire set is. We show how this procedure can be implemented using GHZ states. In the quantum case the presence of an eavesdropper will introduce errors so that his presence can be detected. We also show how GHZ states can be used to split quantum information into two parts so that both parts are necessary to reconstruct the original qubit.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. The Structure of Circle Graph States

    quant-ph 2026-03 unverdicted novelty 7.0

    Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.

  2. Combinatorial aspects of holographic quantum secret sharing

    hep-th 2026-07 conditional novelty 6.0

    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.