量子领袖选举
Quantum Leader Election
摘要：
众所周知，n个政党之间的领导人选举在经典上是不可能的。这项工作给出了一个简单的算法，该算法基于Mochon在2007年推导的具有任意小偏差的弱硬币翻转协议，最近在Aharonov等人于2016年发表并简化。一个协议与线性数量的硬币翻转回合是很容易实现的，我们进一步提供了一个改进的对数数量的硬币翻转回合。这是2009年发表的预印本的一个大大改进的期刊版本：纠正了许多错别字，证明更加严格和准确，复杂性的分析显着收紧，这在效率方面给出了更强的结果;第一个具有线性轮数的协议，也是由Aharon和Silman在2010年独立实现的。
英文摘要：
Leader election between n parties is known to be impossible classically. This work gives a simple algorithm that does it, based on the weak coin flipping protocol with arbitrarily small bias derived by Mochon in 2007, and recently published and simplified in Aharonov et al in 2016. A protocol with linear number of coin flipping rounds is quite simple to achieve; We further provide an improvement to logarithmic number of coin flipping rounds. This is a much improved journal version of a preprint posted in 2009: many typos are corrected, proofs are more rigorous and accurate, and the analysis of complexity is significantly tightened which gives a stronger result in terms of efficiency; The first protocol with linear number of rounds, was achieved independently also by Aharon and Silman in 2010.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
