Cited by 1,373Quantum Information and CryptographyCryptography and Data SecurityQuantum Computing Algorithms and Architecture

The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.

How to Share a Quantum Secret

Open access
Cleve, Richard, Gottesman, Daniel, Lo, Hoi-Kwong·1999·Physical Review Letters

Abstract

We investigate the concept of quantum secret sharing. In a $(k,n)$ threshold scheme, a secret quantum state is divided into $n$ shares such that any $k$ of those shares can be used to reconstruct the secret, but any set of $k\ensuremath{-}1$ or fewer shares contains absolutely no information about the secret. We show that the only constraint on the existence of threshold schemes comes from the quantum ``no-cloning theorem,'' which requires that $n<2k$, and we give efficient constructions of all threshold schemes. We also show that, for $k\ensuremath{\le}n<2k\ensuremath{-}1$, then any $(k,n)$ threshold scheme must distribute information that is globally in a mixed state.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.83.648

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Flagged first, then by citations

Show all 25 references

Research works printed but not linked: 2

  1. G. Blakely, 1979, Proceedings of the National Computer Conference, New York, 1979
  2. D. Aharonov, 1998, Proceedings of the 29th ACM Symposium on Theory of Computing

Cited by

Sorted by citations

Items 601–700 of 1,000

Metadata

Authors
Cleve, R., Gottesman, D., & Lo, H.-K.
Affiliations
  • University of Calgary (CA)
  • Los Alamos National Laboratory (US)
  • Hewlett-Packard (United Kingdom) (GB)
Venue
Physical Review Letters
Published
1999-07-19
Volume
83
Issue
3
Pages
648-651
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2083019346
Cited by
1,373
References
25
Citations by year
2026: 43 · 2025: 87 · 2024: 63 · 2023: 56 · 2022: 38 · 2021: 66 · 2020: 65 · 2019: 64 · 2018: 72 · 2017: 56 · 2016: 51 · 2015: 64 · 2014: 60 · 2013: 69 · 2012: 65
FWCI
14.90
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Computer Networks and Communications › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
quantum secret sharing, threshold schemes, no-cloning theorem, quantum information, secret reconstruction, mixed states, quantum cryptography, information distribution

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review