Fast Quantum Byzantine Agreement: Difference between revisions

Fast Quantum Byzantine Agreement (edit)

4 bytes removed , 4 May 2019

no edit summary

Write, autoreview, editor, reviewer

3,129

edits

Revision as of 12:44, 25 April 2019 (edit) Bob (talk \| contribs) (→‎Outline) ← Older edit		Revision as of 10:22, 4 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.		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.