Applied Sciences · 2023 · 11 citations · 31 references
ComputingComputer SciencePhysicsCryptographyQuantum ComputingQuantum MechanicsQuantum CommunicationQuantum EntanglementBell StatesByzantine AgreementEntangled StatesEpr States
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.
31
Quantum cryptography based on Bell’s theorem
Artur Ekert · Physical Review Letters · 1991 · 10.7K citations
Computing, Physics, Cryptography +16
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Algorithms for quantum computation: discrete logarithms and factoring
Peter W. Shor · 2002 · 8.5K citations
Computing, Computer Science, Physics +12