Researchers from Bar-Ilan University, the European Institute of Science in Management, and Chapman University tested a quantum majority-rule (QMR) voting system on IBM quantum hardware, examining how hardware noise affects election outcomes. With five voters and three candidates, moderate readout error left winners stable up to a probability of 0.4, but results collapsed sharply at 0.5. Randomized electorates near majority-cycle boundaries proved far more fragile, with winner agreement dropping as low as 43% even at very low noise. A separate experiment found that entangled voter groups eliminated draws under ideal conditions, but this effect vanished under noise or when scaled to large populations. The team frames the work as a study of quantum voting rule stability and a test bed for error mitigation and correction research, not as evidence of practical quantum advantage for real elections.
Table of contents
Testing a Quantum Answer to a Classical Voting ProblemWinners Proved Stable — Until They Weren’tEntanglement Changes Outcomes, but Noise Erases the EffectNot a Quantum Election SystemQuestions this post answers
How much readout error can a quantum majority-rule voting system tolerate before the winning candidate changes?
In hand-crafted five-voter, three-candidate test cases, the winning candidate stayed stable through a readout-error probability of 0.4, then collapsed abruptly at 0.5, with agreement to the classical winner falling to about 2%. However, randomized electorates near majority-cycle boundaries were far more fragile, with winner agreement dropping to 43% even at a readout-error probability of just 0.01. daily.dev surfaces research like this for engineers tracking how noise and error correction affect quantum algorithm reliability.
Does quantum entanglement among voters actually change collective voting outcomes?
Yes, under ideal noiseless conditions, groups of voters placed in GHZ-type entangled states eliminated draws entirely across 10,000 simulated voting rounds, compared to separable voter groups with the same individual probability distributions. That advantage weakened sharply under bit-flip noise, and at a bit-flip probability of 0.5 the entangled system behaved effectively randomly, with the effect also vanishing when only limited groups within large populations were entangled. Developers exploring entanglement-based algorithms can follow this kind of noise-sensitivity research on daily.dev.