Quantum Byzantine Agreement Against Full-information Adversary

TL;DR

This paper demonstrates that quantum protocols can achieve Byzantine agreement more efficiently than classical protocols, even against powerful adversaries with full information, by reducing quantum problems to classical frameworks.

Contribution

It introduces a method to construct quantum Byzantine agreement protocols from classical ones, achieving lower round complexity and higher resilience against adversaries.

Findings

Quantum protocols achieve O(1) rounds with t<n/2 resilience.

Quantum protocols surpass classical lower bounds in round complexity.

Quantum advantage demonstrated in asynchronous Byzantine agreement.

Abstract

We exhibit that, when given a classical Byzantine agreement protocol designed in the private-channel model, it is feasible to construct a quantum agreement protocol that can effectively handle a full-information adversary. Notably, both protocols have equivalent levels of resilience, round complexity, and communication complexity. In the classical private-channel scenario, participating players are limited to exchanging classical bits, with the adversary lacking knowledge of the exchanged messages. In contrast, in the quantum full-information setting, participating players can exchange qubits, while the adversary possesses comprehensive and accurate visibility into the system's state and messages. By showcasing the reduction from quantum to classical frameworks, this paper demonstrates the strength and flexibility of quantum protocols in addressing security challenges posed by adversaries with increased visibility. It underscores the potential of leveraging quantum principles to improve security measures without compromising on efficiency or resilience. By applying our reduction, we demonstrate quantum advantages in the round complexity of asynchronous Byzantine agreement protocols in the full-information model. It is well known that in the full-information model, any classical protocol requires $\Omega(n)$ rounds to solve Byzantine agreement with probability one even against Fail-stop adversary when resilience $t=\Theta(n)$. We show that quantum protocols can achieve $O(1)$ rounds (i) with resilience $t<n/2$ against a Fail-stop adversary, and (ii) with resilience $t<n/(3+\epsilon)$ against a Byzantine adversary for any constant $\epsilon>0$, therefore surpassing the classical lower bound.