Quantum Byzantine agreement for any number of dishonest parties

DOI10.1007/s11128-022-03492-yOpenAlexW4225772869MaRDI QIDQ2107116

Vicent Cholvi

Publication date: 29 November 2022

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.09437

zbMATH Keywords

quantum communicationquantum informationByzantine agreement\(Q\)-correlated listsquantum distribution algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Distributed algorithms (68W15) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (2)

Quantum detectable Byzantine agreement for distributed data trust management in blockchain ⋮ Brief Announcement: Improved Consensus in Quantum Networks

Cites Work

• Multi-user private comparison protocol using GHZ class states
• Quantum multi-valued Byzantine agreement based on d-dimensional entangled states
• Authenticated Algorithms for Byzantine Agreement
• Fast quantum byzantine agreement
• An efficient two-party quantum private comparison protocol with decoy photons and two-photon entanglement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Quantum mechanics, local realistic theories, and Lorentz-invariant realistic theories

This page was built for publication: Quantum Byzantine agreement for any number of dishonest parties