Affiliation:
1. Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece
2. Department of History and Philosophy of Sciences, National and Kapodistrian University of Athens, 15771 Athens, Greece
Abstract
In this paper, we introduce a new quantum protocol for Detectable Byzantine Agreement. What distinguishes the proposed protocol among similar quantum protocols, is the fact that it uses only EPR pairs, and, in particular, |Ψ+⟩ pairs. There are many sophisticated quantum protocols that guarantee Detectable Byzantine Agreement, but they do not easily lend themselves to practical implementations, due to present-day technological limitations. For a large number n of players, |GHZ⟩n-tuples, or other more exotic entangled states, are not easy to produce, a fact which might complicate the scalability of such protocols. In contrast, Bell states are, undoubtedly, the easiest to generate among maximally entangled states. This will, hopefully, facilitate the scalability of the proposed protocol, as only EPR pairs are required, irrespective of the number n of players. Finally, we mention that, even for arbitrary many players n, our protocol always completes in a constant number of rounds, namely 4.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference36 articles.
1. The Byzantine Generals Problem;Lamport;ACM Trans. Program. Lang. Syst.,1982
2. Reaching Agreement in the Presence of Faults;Pease;J. ACM,1980
3. Chow, J., Dial, O., and Gambetta, J. (2023, March 03). IBM Quantum Breaks the 100-Qubit Processor Barrier. Available online: https://research.ibm.com/blog/127-qubit-quantum-processor-eagle.
4. Newsroom, I. (2023, March 03). IBM Unveils 400 Qubit-Plus Quantum Processor. Available online: https://newsroom.ibm.com/2022-11-09-IBM-Unveils-400-Qubit-Plus-Quantum-Processor-and-Next-Generation-IBM-Quantum-System-Two.
5. Shor, P. (1994, January 20–22). Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献