A (2,m)-threshold quantum data-hiding scheme is constructed where any pair of m parties can perfectly recover a hidden bit via joint measurement, while LOCC by all parties reveals arbitrarily little information.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
(2,m)-threshold quantum data hiding
A (2,m)-threshold quantum data-hiding scheme is constructed where any pair of m parties can perfectly recover a hidden bit via joint measurement, while LOCC by all parties reveals arbitrarily little information.