A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
Optimal encryption of quantum bits
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 2polarities
background 2representative citing papers
QRQT protects quantum teleportation's classical channel with PQC, showing quantum memory coherence as the central bottleneck that caps secure distance at 191-199 km and produces a non-monotonic joint attack probability.
citing papers explorer
-
Quantum Anonymous Secret Sharing with Permutation Invariant Codes
A quantum anonymous secret sharing scheme is constructed using permutation-invariant codes, with leakage in ramp schemes quantified by quantum conditional min-entropy related to Knill-Laflamme conditions.
-
Quantum-Resistant Quantum Teleportation
QRQT protects quantum teleportation's classical channel with PQC, showing quantum memory coherence as the central bottleneck that caps secure distance at 191-199 km and produces a non-monotonic joint attack probability.