The election, a cornerstone of democracy, is one of the best-recognizable symbols of democratic governance. Voters' confidence in elections is essential, and these days, we can watch practically in live broadcast what consequences distrust in the fairness of elections may have. From the times of the celebrated Gibbard-Satterthwaite theorem, it is well-known in the social-choice community that most voting systems are vulnerable to the efforts of various players to influence elections. Luckily for us, computing such influence to affect election outcomes is a hard problem from the computational complexity perspective. This intractability is regarded as a ``complexity shield'' that secures voting rules against this malicious behavior. In this work, we consider quantum computers to be a new threat to the complexity shield described above, as they break out of standard computing paradigms and unlock additional computational resources. To this end, we provide an overview of possible attacks on election, discuss the abilities of quantum computing, and chart possible directions for future research in this area.

翻译：选举作为民主的基石，是民主治理最显著的象征之一。选民对选举的信任至关重要，而在当今，我们几乎可以通过直播目睹对选举公平性失去信任可能带来的后果。自著名的吉巴德-萨特斯韦特定理时代以来，社会选择学界公认大多数投票系统易受各种参与者试图影响选举行为的攻击。幸运的是，从计算复杂性的角度来看，计算这种影响以改变选举结果是一个难题。这种难解性被视为一道“复杂性护盾”，保护投票规则免受此类恶意行为的侵害。在本研究中，我们将量子计算机视为上述复杂性护盾的新威胁，因为它们突破了标准计算范式并解锁了额外的计算资源。为此，我们概述了可能对选举发起的攻击，讨论了量子计算的能力，并勾画了该领域未来研究的可能方向。