Fast Quantum Byzantine Agreement: Difference between revisions

Fast Quantum Byzantine Agreement (edit)

36 bytes removed , 23 May 2019

no edit summary

Write, autoreview, editor, reviewer

3,129

edits

Revision as of 15:22, 16 May 2019 (edit) Shraddha (talk \| contribs) mNo edit summary ← Older edit		Revision as of 08:49, 23 May 2019 (edit) (undo) Shraddha (talk \| contribs) No edit summary Newer edit →
Line 1:		Line 1:
	~~Fast Quantum Byzantine Agreement~~ [~~[Quantum Byzantine Agreement#References\|(3)]~~] is an efficient ~~quantum protocol that solves~~ the classical task of [[Byzantine Agreement]] [[Quantum Byzantine Agreement#References\|(8)]]. ~~The protocol~~ allows ~~<math>n</math>~~ players in a network to reach agreement in the presence of ~~<math>t</math>~~ faulty players. The protocol solves the task in the strongest possible failure model (Byzantine failures). The quantum protocol is provably faster than any classical protocol.		This [https://dl.acm.org/citation.cfm?doid=1060590.1060662 example protocol] is an efficient solution to the classical task of [[Byzantine Agreement]] [[Quantum Byzantine Agreement#References\|(8)]]. It allows multiple players in a network to reach an agreement in the presence of some faulty players. The protocol solves the task in the strongest possible failure model (called Byzantine failures). The quantum protocol is provably faster than any classical protocol.