Fast Quantum Byzantine Agreement with Nearly Linear Quantum Communication
cs.DS
Submitted: 2026-11-03
Updated: 2026-11-03
Terminology
Sources
- Communication Complexity of Byzantine Agreement, Revisited
- How to share a quantum secret
- Improved Byzantine Agreement under an Adaptive Adversary
- Settling The Round Complexity of Byzantine Agreement Against a Full-Information, Adaptive Adversary
- On the Theory of Quantum Secret Sharing
- Fault-Tolerant Consensus in Quantum Networks
- Byzantine Agreement in Polynomial Time with Near-Optimal Resilience
- Breaking the O(n^2) Bit Barrier: Scalable Byzantine agreement with an Adaptive Adversary
- Quantum Byzantine Agreement Against Full-information Adversary
- Theory of Communication Efficient Quantum Secret Sharing
Related papers
- Exploiting Low Scanwidth to Resolve Soft Polytomies
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time