Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Advancements in Computing Technology

Quantum Ballot Scheme Based on Hyper-Entanglement States

Xiaoping Lou, Zhigang Chen

Published Jan 14, 2013• 1 citation
Publisher
DOI
10.4156/ijact.vol5.issue1.71

Related papers

Quantum Distributed Ballot Scheme Based on High-Dimensional Bell States Entanglement Swapping

Xiaoping Lou, Zhigang Chen

Advanced Science Letters•May 30, 2012•0 citations

Quantum Distributed Ballot Scheme Based on Greenberger-Horne-Zeilinger State

施荣华, 伍莹, 郭迎 +1 more

理论物理通讯：英文版•Jan 1, 2010•0 citations

Quantum Distributed Ballot Scheme Based on Greenberger–Home–Zeilinger State

Shi Rong-Hua, Ying Wu, Ying Guo +1 more

Motivated by the complementary relations of the Greenherger–Horne–Zeilinger (GHZ) entangled triplet-particle states, a novel way of realizing quantum distributed ballot scheme is proposed. The ballot information is encoded by local operations performed on the particles of entangled GHZ triplet states, which ensures the security of the present scheme. In order to guarantee the security of this scheme, the checking phase is designed in detail on the basis of the entangled GHZ triplet state. The analysis shows the security of the proposed scheme.

Communications in Theoretical Physics•Aug 1, 2010•1 citation

Quantum anonymous voting systems based on entangled state

Yuan Li, Guihua Zeng

Optical Review•Sep 1, 2008•50 citations

Quantum Distributed Ballot Scheme Based on Entanglement Swapping

Xiaoping Lou, Zhigang Chen

We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Nov 1, 2011•1 citation

Quantum Voting Scheme Based on Conjugate Coding

Tatsuaki Okamoto, Koutarou Suzuki, Yuuki Tokunaga

We describe a quantum voting scheme in which a ballot is an unknown quantum state for a voter.Such a ballot is hard to forge because it is difficult in principle to make a copy of an unknown quantum state.Moreover, our quantum voting scheme guarantees anonymity because the ballot can be randomized by voters.We also describe a distributed variant of our scheme that is robust against a dishonest administrator.This scheme should remain usable in the coming era of quantum computers, which are expected to break most existing cryptographic schemes.

NTT technical review•Jan 1, 2008•8 citations
Motivated by the complementary relations of the Greenherger–Horne–Zeilinger (GHZ) entangled triplet-particle states, a novel way of realizing quantum distributed ballot scheme is proposed. The ballot information is encoded by local operations performed on the particles of entangled GHZ triplet states, which ensures the security of the present scheme. In order to guarantee the security of this scheme, the checking phase is designed in detail on the basis of the entangled GHZ triplet state. The analysis shows the security of the proposed scheme.
We proposed a novel quantum distributed ballot scheme using swapping quantum entanglement of Bell states. The entanglement is distributed over separated voter's sites; physical inaccessibility of any one site is sufficient to guarantee the anonymity of the votes. The ballot information is encoded by local operations performed on the particles of entangled EPR states, which ensures the security present scheme. The checking phase is designed in detail based on entanglement swapping. The security of these protocols with respect to various kinds of attack is discussed.
We describe a quantum voting scheme in which a ballot is an unknown quantum state for a voter.Such a ballot is hard to forge because it is difficult in principle to make a copy of an unknown quantum state.Moreover, our quantum voting scheme guarantees anonymity because the ballot can be randomized by voters.We also describe a distributed variant of our scheme that is robust against a dishonest administrator.This scheme should remain usable in the coming era of quantum computers, which are expected to break most existing cryptographic schemes.