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

Acta Physica Sinica

Quantum voting protocol using two-mode squeezed states

Yi Zhi, Guangqiang He, Zeng Gui-Hua, 上海交通大学电子工程系区域光纤通信网与新型光通信系统国家重点实验室，上海 200240

Published Jan 1, 2009• 11 citations
Publisher

Abstract

A basic quantum voting protocol using two-mode squeezed states is proposed firstly in this paper. This protocol makes use of the uncertainty principle by using random-selection, possible attack modes are then analyzed. The mode-mode correlation of two-mode squeezed states guarantees the security of the protocol.
DOI
10.7498/aps.58.3166

Related papers

Deterministic secure communications using two-mode squeezed states

Alberto M. Marino, Carlos R. Stroud

We propose a scheme for quantum cryptography that uses the squeezing phase of a two-mode squeezed state to transmit information securely between two parties. The basic principle behind this scheme is the fact that each mode of the squeezed field by itself does not contain any information regarding the squeezing phase. The squeezing phase can only be obtained through a joint measurement of the two modes. This, combined with the fact that it is possible to perform remote squeezing measurements, makes it possible to implement a secure quantum communication scheme in which a deterministic signal can be transmitted directly between two parties while the encryption is done automatically by the quantum correlations present in the two-mode squeezed state.

arXiv:quant-ph/0605229•Physical Review A•Aug 18, 2006•28 citations

Quantum key distribution using two-mode squeezd states

Guangqiang He, Yi Zhi, Zhu Jun +2 more

A quantum key distribution scheme using two-mode squeezed states is proposed in this paper. The security of the proposed scheme against beam splitter attack is analyzed using Shannon information theory. The analytical expression of the secret information rate is given in terms of squeezed factor and channel parameters. The mode-mode correlation of two-mode squeezed states guarantees the security of the proposed scheme.

Acta Physica Sinica•Jan 1, 2007•6 citations

Three-Party Quantum Key Agreement Protocol Based on Continuous Variable Single-Mode Squeezed States*

Yi‐Hua Zhou, Jing 晶 Tan 谭, Jing Zhang +2 more

Abstract The difficulty of quantum key agreement is to realize its security and fairness at the same time. This paper presents a new three-party quantum key agreement protocol based on continuous variable single-mode squeezed state. The three parties participating in the agreement are peer entities, making same contributions to the final key. Any one or two participants of the agreement cannot determine the shared key separately. The security analysis shows that the proposed protocol can resist both external and internal attacks.

Communications in Theoretical Physics•Dec 1, 2019•4 citations

Quantum voting protocol without quantum memory

Lidong Xu, Mingqiang Wang

Most of the quantum voting protocols are impractical due to the currently limited quantum storage capabilities. In this article, based on the interference principle of light, we proposed a new quantum voting protocol without quantum memory. In our protocol, the ballot is a sequence of non-orthogonal coherent states, the voting information is encoded by implying different phase shifts on the coherent states, and the vote counting is carried out by performing USD measurement on the coherent states. Particularly, the design of USD measurement on coherent states eliminates the need for quantum storage. Our protocol satisfies the general security requirements of quantum voting protocols and can resist various attacks. In addition, our protocol can be implemented by only linear optics and thus can be experimentally achieved with current technology.

Frontiers in Physics•Oct 6, 2022•3 citations

Protocols for quantum binary voting

Kishore Thapliyal, Rishi Dutt Sharma, Anirban Pathak

Two new protocols for quantum binary voting are proposed. One of the proposed protocols is designed using a standard scheme for controlled deterministic secure quantum communication (CDSQC), and the other one is designed using the idea of quantum cryptographic switch, which uses a technique known as permutation of particles. A few possible alternative approaches to accomplish the same task (quantum binary voting) have also been discussed. Security of the proposed protocols is analyzed. Further, the efficiencies of the proposed protocols are computed, and are compared with that of the existing protocols. The comparison has established that the proposed protocols are more efficient than the existing protocols.

International Journal of Quantum Information•Dec 16, 2016•40 citations

Are Quantum Voting Protocols Practical?

Nitin Jha, Abhishek Parakh

Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.

quant-pharXiv:2601.17514•Jan 27, 2026•0 citations
We propose a scheme for quantum cryptography that uses the squeezing phase of a two-mode squeezed state to transmit information securely between two parties. The basic principle behind this scheme is the fact that each mode of the squeezed field by itself does not contain any information regarding the squeezing phase. The squeezing phase can only be obtained through a joint measurement of the two modes. This, combined with the fact that it is possible to perform remote squeezing measurements, makes it possible to implement a secure quantum communication scheme in which a deterministic signal can be transmitted directly between two parties while the encryption is done automatically by the quantum correlations present in the two-mode squeezed state.
Abstract The difficulty of quantum key agreement is to realize its security and fairness at the same time. This paper presents a new three-party quantum key agreement protocol based on continuous variable single-mode squeezed state. The three parties participating in the agreement are peer entities, making same contributions to the final key. Any one or two participants of the agreement cannot determine the shared key separately. The security analysis shows that the proposed protocol can resist both external and internal attacks.
Most of the quantum voting protocols are impractical due to the currently limited quantum storage capabilities. In this article, based on the interference principle of light, we proposed a new quantum voting protocol without quantum memory. In our protocol, the ballot is a sequence of non-orthogonal coherent states, the voting information is encoded by implying different phase shifts on the coherent states, and the vote counting is carried out by performing USD measurement on the coherent states. Particularly, the design of USD measurement on coherent states eliminates the need for quantum storage. Our protocol satisfies the general security requirements of quantum voting protocols and can resist various attacks. In addition, our protocol can be implemented by only linear optics and thus can be experimentally achieved with current technology.
Two new protocols for quantum binary voting are proposed. One of the proposed protocols is designed using a standard scheme for controlled deterministic secure quantum communication (CDSQC), and the other one is designed using the idea of quantum cryptographic switch, which uses a technique known as permutation of particles. A few possible alternative approaches to accomplish the same task (quantum binary voting) have also been discussed. Security of the proposed protocols is analyzed. Further, the efficiencies of the proposed protocols are computed, and are compared with that of the existing protocols. The comparison has established that the proposed protocols are more efficient than the existing protocols.
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting protocols are practical. We begin by outlining core mathematical ideas such as the superposition principle, the no-cloning theorem, and quantum entanglement. We then define a common system and threat model, identifying key actors, trust assumptions, and security goals. Representative protocol families are reviewed, including entanglement-based schemes with central tallying, self-tallying designs that enable public verification, and authority-minimized approaches that certify untrusted devices through observable correlations. Finally, we evaluate implementation challenges, including loss, noise, device imperfections, scalability, and coercion resistance, and discuss realistic near-term deployment scenarios for small-scale elections.