Resource analysis for quantum-aided Byzantine agreement with the four-qubit singlet state

Author:

Guba Zoltán1,Finta István23,Budai Ákos142,Farkas Lóránt2,Zimborás Zoltán45,Pályi András16

Affiliation:

1. Department of Theoretical Physics, Institute of Physics, Budapest University of Technology and Economics, Műegyetem rkp. 3., H-1111 Budapest, Hungary

2. Nokia Bell Labs

3. Óbuda University

4. Wigner Research Centre for Physics, H-1525 Budapest, P.O.Box 49, Hungary

5. Eötvös University, Budapest, Hungary

6. MTA-BME Quantum Dynamics and Correlations Research Group, Műegyetem rkp. 3., H-1111 Budapest, Hungary

Abstract

In distributed computing, a Byzantine fault is a condition where a component behaves inconsistently, showing different symptoms to different components of the system. Consensus among the correct components can be reached by appropriately crafted communication protocols even in the presence of byzantine faults. Quantum-aided protocols built upon distributed entangled quantum states are worth considering, as they are more resilient than traditional ones. Based on earlier ideas, here we establish a parameter-dependent family of quantum-aided weak broadcast protocols. We compute upper bounds on the failure probability of the protocol, and define and illustrate a procedure that minimizes the quantum resource requirements. Following earlier work demonstrating the suitability of noisy intermediate scale quantum (NISQ) devices for the study of quantum networks, we experimentally create our resource quantum state on publicly available quantum computers. Our work highlights important engineering aspects of the future deployment of quantum communication protocols with multi-qubit entangled states.

Funder

Ministry of Innovation and Technology of Hungary and National Research, Development and Innovation Office

NKFIH

Publisher

Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften

Reference30 articles.

1. M. Pease, R. Shostak, and L. Lamport, ``Reaching Agreement in the Presence of Faults'' J. ACM 27, 228–234 (1980).

2. Matthias Fitzi ``Generalized Communication and Security Models in Byzantine Agreement'' thesis (2003) Reprint as vol. 4 of ETH Series in Information Security and Cryptography, ISBN 3-89649-853-3, Hartung-Gorre Verlag, Konstanz, 2003.

3. Leslie Lamport, Robert Shostak, and Marshall Pease, ``The Byzantine Generals Problem'' ACM Trans. Program. Lang. Syst. 4, 382–401 (1982).

4. Juan Garayand Yoram Moses ``Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds'' SIAM Journal on Computing 27, 247–290 (1999).

5. Miguel Castroand Barbara Liskov ``Practical byzantine fault tolerance'' OSDI 99, 173–186 (1999).

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3