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

Quantum Information Processing

A quantum protocol for millionaire problem with Bell states

Weiwei Zhang, Dan Li, Kejia Zhang, Hui-Juan Zuo

Published Jan 4, 2013• 35 citations
Publisher
DOI
10.1007/s11128-012-0520-6

Related papers

A mediated semi-quantum protocol for millionaire problem based on high-dimensional Bell states

Qing-bin Luo, Xiaoyu Li, Guowu Yang +1 more

Quantum Information Processing•Jul 26, 2022•22 citations

Quantum protocol for millionaire problem

Heng-Yue Jia, Qiaoyan Wen, Tingting Song +1 more

Optics Communications•Sep 23, 2010•94 citations

Quantum Protocol for Millionaire Problem

Wen Liu, Yongbin Wang, Aina Sui +1 more

International Journal of Theoretical Physics•Apr 11, 2019•14 citations

Symmetric cryptographic protocols for extended millionaires’ problem

Shundong Li, DaoShun Wang, Yiqi Dai

Science in China Series F Information Sciences•Jun 1, 2009•11 citations

A quantum protocol for enhanced blind millionaire problem without a pre-shared key based on single-qudit states

Xiang-Rui Li, Yi-Hua Zhou, Yu‐Guang Yang +1 more

The Journal of Supercomputing•Oct 7, 2025•3 citations

Quantum private comparison for the socialist millionaire problem

Min Hou, Shi-Yao Sun, Wei Zhang

The socialist millionaire problem aims to compare the equality of two inputs from two users while keeping their inputs undisclosed to anyone. Quantum private comparison (QPC), whose security relies on the principles of quantum mechanics, can solve this problem and achieve the information-theoretic security of information processing. The current QPC protocols mainly utilize the bitwise XOR operation to implement the comparison, leading to insufficient security. In this paper, we propose a rotation operation-based QPC protocol to solve the socialist millionaire problem, which utilizes Bell states as quantum resources and rotation operations for classical calculations. The proposed protocol only utilizes easy-to-implement technologies such as Bell states, rotation operations, and Bell-basis measurements, making it more practical. The analysis demonstrates that our protocol can meet both the correctness and security requirements. Compared with the existing QPC protocols, our protocol has improved performance in terms of practicability and security.

Frontiers in Physics•Jun 19, 2024•12 citations
The socialist millionaire problem aims to compare the equality of two inputs from two users while keeping their inputs undisclosed to anyone. Quantum private comparison (QPC), whose security relies on the principles of quantum mechanics, can solve this problem and achieve the information-theoretic security of information processing. The current QPC protocols mainly utilize the bitwise XOR operation to implement the comparison, leading to insufficient security. In this paper, we propose a rotation operation-based QPC protocol to solve the socialist millionaire problem, which utilizes Bell states as quantum resources and rotation operations for classical calculations. The proposed protocol only utilizes easy-to-implement technologies such as Bell states, rotation operations, and Bell-basis measurements, making it more practical. The analysis demonstrates that our protocol can meet both the correctness and security requirements. Compared with the existing QPC protocols, our protocol has improved performance in terms of practicability and security.