Quantum secret sharing with continuous variable graph state
From MaRDI portal
Publication:2454259
DOI10.1007/S11128-013-0713-7zbMATH Open1291.81124DBLPjournals/qip/WuCHZ14arXiv1304.4477OpenAlexW2080261902WikidataQ59758746 ScholiaQ59758746MaRDI QIDQ2454259FDOQ2454259
Authors: Yadong Wu, Runze Cai, Guang-Qiang He, Jun Zhang 
Publication date: 13 June 2014
Published in: Quantum Information Processing (Search for Journal in Brave)
Abstract: In this paper we study the protocol implementation and property analysis for several practical quantum secret sharing (QSS) schemes with continuous variable graph state (CVGS). For each QSS scheme, an implementation protocol is designed according to its secret and communication channel types. The estimation error is derived explicitly, which facilitates the unbiased estimation and error variance minimization. It turns out that only under infinite squeezing can the secret be perfectly reconstructed. Furthermore, we derive the condition for QSS threshold protocol on a weighted CVGS. Under certain conditions, the perfect reconstruction of the secret for two non-cooperative groups is exclusive, i.e. if one group gets the secret perfectly, the other group cannot get any information about the secret.
Full work available at URL: https://arxiv.org/abs/1304.4477
Recommendations
- Quantum secret sharing based on continuous-variable GHZ states
- Five-partite continuous-variable quantum state sharing
- Continuous-variable \((3, 3)\)-threshold quantum secret sharing based on one-sided device-independent security
- Continuous variable quantum secret sharing via quantum teleportation
- Efficient sharing of a continuous-variable quantum secret
Cites Work
- Quantum information with continuous variables
- Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
- Quantum data hiding
- Graph states for quantum secret sharing
- Quantum secret sharing
- Quantum cryptography
- Multiparty entanglement in graph states
- Nonadditive quantum error-correcting code
- Universal teleportation via continuous-variable graph states
Cited In (19)
- New protocols and lower bounds for quantum secret sharing with graph states
- Quantum private comparison protocol based on continuous variables
- Quantum teleportation based on non-maximally entangled graph states
- Limited resource semiquantum secret sharing
- Verifiable threshold quantum secret sharing with sequential communication
- Quantum secret sharing based on continuous-variable GHZ states
- Quantum secret sharing for a class of special hypergraph access structures
- Analysis of weighted quantum secret sharing based on matrix product states
- Network-based arbitrated quantum signature scheme with graph state
- Continuous variable quantum secret sharing via quantum teleportation
- Efficient sharing of a continuous-variable quantum secret
- Quantum anonymous voting with unweighted continuous-variable graph states
- Eavesdropping on semi-quantum secret sharing scheme of specific bits
- On weak odd domination and graph-based quantum secret sharing
- Graph state-based quantum secret sharing with the Chinese remainder theorem
- Continuous-variable \((3, 3)\)-threshold quantum secret sharing based on one-sided device-independent security
- Sequential quantum secret sharing in noisy environments
- Five-partite continuous-variable quantum state sharing
- Graph states for quantum secret sharing
This page was built for publication: Quantum secret sharing with continuous variable graph state
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454259)
