Experimental demonstration of graph-state quantum secret sharing

被引:146
作者
Bell, B. A. [1 ]
Markham, D. [2 ]
Herrera-Marti, D. A. [3 ]
Marin, A. [2 ]
Wadsworth, W. J. [4 ]
Rarity, J. G. [1 ]
Tame, M. S. [5 ,6 ]
机构
[1] Univ Bristol, Dept Elect & Elect Engn, Ctr Commun Res, Bristol BS8 1UB, Avon, England
[2] Telecom ParisTech, Dept Informat & Reseaux, CNRS LTCI, F-75214 Paris, France
[3] Hebrew Univ Jerusalem, Racah Inst Phys, IL-91904 Jerusalem, Israel
[4] Univ Bath, Dept Phys, Ctr Photon & Photon Mat, Bath BA2 7AY, Avon, England
[5] Univ KwaZulu Natal, Sch Chem & Phys, ZA-4001 Durban, South Africa
[6] Univ KwaZulu Natal, Natl Inst Theoret Phys, ZA-4001 Durban, South Africa
基金
英国工程与自然科学研究理事会; 新加坡国家研究基金会;
关键词
ENTANGLEMENT; COMPUTATION;
D O I
10.1038/ncomms6480
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
070301 [无机化学]; 070403 [天体物理学]; 070507 [自然资源与国土空间规划学]; 090105 [作物生产系统与生态工程];
摘要
Quantum communication and computing offer many new opportunities for information processing in a connected world. Networks using quantum resources with tailor-made entanglement structures have been proposed for a variety of tasks, including distributing, sharing and processing information. Recently, a class of states known as graph states has emerged, providing versatile quantum resources for such networking tasks. Here we report an experimental demonstration of graph state-based quantum secret sharing-an important primitive for a quantum network with applications ranging from secure money transfer to multiparty quantum computation. We use an all-optical setup, encoding quantum information into photons representing a five-qubit graph state. We find that one can reliably encode, distribute and share quantum information amongst four parties, with various access structures based on the complex connectivity of the graph. Our results show that graph states are a promising approach for realising sophisticated multi-layered communication protocols in quantum networks.
引用
收藏
页数:12
相关论文
共 57 条
[1]
Aharonov D., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P705, DOI 10.1145/335305.335404
[2]
Simple proof of fault tolerance in the graph-state model [J].
Aliferis, P ;
Leung, DW .
PHYSICAL REVIEW A, 2006, 73 (03)
[3]
Generation of hyperentangled photon pairs [J].
Barreiro, JT ;
Langford, NK ;
Peters, NA ;
Kwiat, PG .
PHYSICAL REVIEW LETTERS, 2005, 95 (26)
[4]
Demonstration of Blind Quantum Computing [J].
Barz, Stefanie ;
Kashefi, Elham ;
Broadbent, Anne ;
Fitzsimons, Joseph F. ;
Zeilinger, Anton ;
Walther, Philip .
SCIENCE, 2012, 335 (6066) :303-308
[5]
Experimental characterization of photonic fusion using fiber sources [J].
Bell, B. ;
Clark, A. S. ;
Tame, M. S. ;
Halder, M. ;
Fulconis, J. ;
Wadsworth, W. J. ;
Rarity, J. G. .
NEW JOURNAL OF PHYSICS, 2012, 14
[6]
Experimental demonstration of a graph state quantum error-correction code [J].
Bell, B. A. ;
Herrera-Marti, D. A. ;
Tame, M. S. ;
Markham, D. ;
Wadsworth, W. J. ;
Rarity, J. G. .
NATURE COMMUNICATIONS, 2014, 5
[7]
Ben-Or M, 2006, ANN IEEE SYMP FOUND, P249
[8]
Blakley G. R., 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK), P313, DOI 10.1109/MARK.1979.8817296
[9]
Experimental quantum secret sharing using telecommunication fiber [J].
Bogdanski, Jan ;
Rafiei, Nima ;
Bourennane, Mohamed .
PHYSICAL REVIEW A, 2008, 78 (06)
[10]
Briegel HJ, 2009, NAT PHYS, V5, P19, DOI [10.1038/NPHYS1157, 10.1038/nphys1157]