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.
Quantum secret sharing
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Structure of Circle Graph States
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.