Quantum Ballot Encoding for Anonymous Low-Overhead Voting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing quantum voting protocols are inefficient or do not satisfy all desirable security criteria, particularly in the presence of quantum adversaries, and rely on computational complexity assumptions that may be breached by future quantum computers.
Innovation Solution
A quantum voting protocol that uses quantum states to encode ballot information, enabling exponential reduction in communication complexity and ensuring information-theoretic security, with polynomial scaling of total qubits communicated and logarithmic scaling of local qubit memories, utilizing quantum teleportation and GHZ states for anonymous queuing and broadcasting.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If quantum states are used to encode ballot information, then communication complexity is exponentially reduced and information-theoretic security is ensured, but device complexity and quantum resource requirements increase
Solution Approach 1:
The quantum voting protocol segments the voting process into distinct quantum and classical phases. Quantum states are used only for ballot distribution and vote encoding, while classical communication handles vote decoding and tallying. This segmentation allows the system to benefit from quantum efficiency without requiring all components to be quantum, thereby reducing overall device complexity.
Solution Approach 2:
The protocol introduces classical intermediaries (verification keys, decoding algorithms) that bridge the quantum ballot distribution phase and the classical tallying phase. These intermediaries allow quantum states to carry information efficiently while enabling classical systems to process and verify the results, thus managing quantum resource requirements.
2Reliability
If quantum teleportation and GHZ states are used for anonymous queuing and broadcasting, then voting anonymity and security are enhanced, but local qubit memory requirements increase
Solution Approach 1:
The protocol performs preliminary entanglement distribution and GHZ state preparation before the actual voting process. Voters receive pre-shared entangled pairs and GHZ states in advance, which are then used during the voting phase. This preliminary action allows the system to achieve high security without requiring voters to generate and maintain complex quantum states during the voting process itself, thereby reducing peak memory requirements.
Solution Approach 2:
The protocol employs temporary quantum states that are created, used for a specific purpose (such as anonymous broadcasting), and then discarded. GHZ states are used for anonymous communication and then measured/collapsed, converting quantum information to classical information that can be processed without requiring continued quantum memory storage. This approach allows high security during critical phases while reducing memory requirements overall.
3Productivity
If projective measurement is performed on ballot quantum states, then vote determination is achieved, but quantum state information is collapsed and cannot be reused
Solution Approach 1:
The protocol uses partial measurement strategies where voters perform projective measurements only on specific subsets of qubits in the ballot state, rather than measuring the entire state. This partial action allows voters to extract the necessary vote information while leaving other quantum information intact for verification purposes or for other voters to use, thereby reducing information loss while maintaining processing speed.
Solution Approach 2:
The system creates multiple copies of the ballot quantum state and distributes them to different voters or uses them for different purposes (vote extraction, verification, etc.). This copying approach allows the same quantum information to be used multiple times without being consumed, effectively addressing the information loss problem caused by projective measurement.
Data Source
AI summary
Efficient quantum voting with information-theoretic security is provided. A tally quantum node generates a first plurality of ballot quantum states encoding a first bit string, each of the first plurality of ballot quantum states comprising a plurality of qubits. Each of the first plurality of ballot quantum states are distributed to exactly one of a plurality of voter quantum nodes via a quantum network. At least one of the plurality of voter quantum nodes: performs a projective measurement of its one of the first plurality of ballot quantum states, and thereby determining a parity of a random pair of bits of the first bit string; reads a vote; computes a first encoded vote based on the parity and vote; broadcasts the first encoded vote and an identifier of the pair of bits to each other of the plurality of voter quantum nodes. The first bit string is provided to decode the first encoded vote.