# Quantum secret sharing with continuous variable graph state

Quantum secret sharing with continuous variable graph state In this paper, we study several physically feasible quantum secret sharing (QSS) schemes using continuous variable graph state (CVGS). Their implementation protocols are given, and the estimation error formulae are derived. Then, we present a variety of results on the theory of QSS with CVGS. Any $$(k,n)$$ ( k , n ) threshold protocol of the three specific schemes satisfying $$\frac{n}{2}<k\le n$$ n 2 < k ≤ n , where $$n$$ n denotes the total number of players and $$k$$ k denotes the minimum number of players who can collaboratively access the secret, can be implemented by certain weighted CVGS. The quantum secret is absolutely confidential to any player group with number less than threshold. Besides, the effect of finite squeezing to these results is properly considered. In the end, the duality between two specific schemes is investigated. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

# Quantum secret sharing with continuous variable graph state

, Volume 13 (5) – Dec 17, 2013
18 pages

/lp/springer_journal/quantum-secret-sharing-with-continuous-variable-graph-state-O7zY1ORj4R
Publisher
Springer US
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-013-0713-7
Publisher site
See Article on Publisher Site

### Abstract

In this paper, we study several physically feasible quantum secret sharing (QSS) schemes using continuous variable graph state (CVGS). Their implementation protocols are given, and the estimation error formulae are derived. Then, we present a variety of results on the theory of QSS with CVGS. Any $$(k,n)$$ ( k , n ) threshold protocol of the three specific schemes satisfying $$\frac{n}{2}<k\le n$$ n 2 < k ≤ n , where $$n$$ n denotes the total number of players and $$k$$ k denotes the minimum number of players who can collaboratively access the secret, can be implemented by certain weighted CVGS. The quantum secret is absolutely confidential to any player group with number less than threshold. Besides, the effect of finite squeezing to these results is properly considered. In the end, the duality between two specific schemes is investigated.

### Journal

Quantum Information ProcessingSpringer Journals

Published: Dec 17, 2013

### References

Yu, S; Chen, Q; Lai, CH; Oh, CH
• Quantum information with continuous variables
Braunstein, SL; Loock, P

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations