English
Related papers

Related papers: Quantum Voting Protocol for Centralized and Distri…

200 papers

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…

A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key.…

Quantum Physics · Physics 2007-05-23 Fei Gao , Fenzhuo Guo , Qiaoyan Wen , Fuchen Zhu

This article introduces a novel Quantum Secret Sharing scheme with $( k, n )$ threshold and endowed with verification capability. The new protocol exploits the power of entanglement and evolves in three phases. The primary novelty of the…

Quantum Physics · Physics 2025-03-14 Theodore Andronikos

We propose a secure voting protocol for score-based voting rules, where independent talliers perform the tallying procedure. The protocol outputs the winning candidate(s) while preserving the privacy of the voters and the secrecy of the…

Cryptography and Security · Computer Science 2022-01-28 Lihi Dery , Tamir Tassa , Avishay Yanai

We propose a novel double-entanglement-based quantum cryptography protocol that is both efficient and deterministic. The proposal uses photon pairs with entanglement both in polarization and in time degrees of freedom; each measurement in…

Quantum Physics · Physics 2009-11-11 Zeng-Bing Chen , Qiang Zhang , Xiao-Hui Bao , J. Schmiedmayer , Jian-Wei Pan

Recently Tian, Zhang and Li (TZL) have proposed a protocol for voting based on controlled quantum teleportation (Int. J. Theor. Phys. DOI 10.1007/s10773-015-2868-8). We have critically analyzed the protocol and have shown that it's neither…

Quantum Physics · Physics 2016-02-03 Kishore Thapliyal , Rishi Dutt Sharma , Anirban Pathak

This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can…

Quantum Physics · Physics 2020-06-24 Hirotada Kobayashi , Keiji Matsumoto , Seiichiro Tani

Voting forms the most important tool for arriving at a decision in any institution. The changing needs of the civilization currently demands a practical yet secure electronic voting system, but any flaw related to the applied voting…

Quantum Physics · Physics 2022-06-08 Sandeep Mishra , Kishore Thapliyal , S Krish Rewanth , Abhishek Parakh , Anirban Pathak

Recently, Liu W et al. proposed a two-party quantum private comparison (QPC) protocol using entanglement swapping of Bell entangled state (Commun. Theor. Phys. 57(2012)583-588). Subsequently, Liu W J et al. pointed out that in Liu W et…

Quantum Physics · Physics 2022-05-18 Tian-Yu Ye

Absolutely and asymptotically secure protocols for organizing an exam in a quantum way are proposed basing judiciously on multipartite entanglement. The protocols are shown to stand against common types of eavesdropping attack.

Quantum Physics · Physics 2007-05-23 Nguyen Ba An

In the realm of quantum information processing, the efficient characterization of entangled states poses an overwhelming challenge, rendering the traditional methods including quantum tomography unfeasible and impractical. To tackle this…

Quantum Physics · Physics 2025-12-09 Ye-Chao Liu , Jiangwei Shang

Fault-tolerant modular quantum computing requires stabilizer measurements across the modules in a quantum network. For this, entangled states of high quality and rate must be distributed. Currently, two main types of entanglement…

Overcoming the influence of noise and imperfections in quantum devices is one of the main challenges for viable quantum applications. In this article, we present different protocols, which we denote as "superposed quantum error mitigation",…

A two-step quantum key distribution protocol using frequency and polarization doubly entangled photons is proposed. In this protocol, information is encoded by a unitary operation on each of the two doubly entangled photons and sent from…

Quantum Physics · Physics 2007-10-09 Chuan Wang , Wan-Ying Wang , Li Xiao , Gui Lu Long

In this paper we show that sufficient multi-partite quantum entanglement helps in fair and unbiased election of a leader in a distributed network of processors with only linear classical communication complexity. We show that a total of…

Quantum Physics · Physics 2007-05-23 Sudebkumar Prasant Pal , Sudhir Kumar Singh , Somesh Kumar

In this work, we present a novel authenticated Quantum Key Distribution (QKD) protocol employing maximally entangled qubit pairs. In the absence of noise, we securely authenticate the well-known BB84 QKD scheme under two assumptions: first,…

Quantum Physics · Physics 2025-10-22 Pol Julià Farré , Vladlen Galetsky , Soham Ghosh , Janis Nötzel , Christian Deppe

In this paper we consider the quantum repeater protocol for distributing the entanglement to two distant three-level atoms. In this protocol, we insert six atoms between two target atoms such that the eight considered atoms are labeled by…

Quantum Physics · Physics 2021-06-04 M Ghasemi , M K Tavassoly

Quantum key distribution (QKD) refers to specific quantum strategies which permit the secure distribution of a secret key between two parties that wish to communicate secretly. Quantum cryptography has proven unconditionally secure in ideal…

Quantum Physics · Physics 2008-10-14 C. Rodó , O. Romero-Isart , K. Eckert , A. Sanpera

In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the…

Quantum Physics · Physics 2020-08-17 Farhan Musanna , Sanjeev Kumar

We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous…

Cryptography and Security · Computer Science 2010-11-25 Anne Broadbent , Stacey Jeffery , Alain Tapp