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

Practical quantum private query of blocks based on the two-dimensional QKD system

Tingrui Pei, Xiao-lu Meng, Chun‐Yan Wei, Fei Gao, Shujuan Tian, Qingyong Deng

Published Jun 15, 2019• 14 citations
Publisher
DOI
10.1007/s11128-019-2354-y

Related papers

Practical Two-Way QKD-Based Quantum Private Query with Better Performance in User Privacy

Yan Zuo Chang, Shibin Zhang, Guogen Wan +3 more

International Journal of Theoretical Physics•May 11, 2019•26 citations

QKD-based quantum private query without a failure probability

Bin Liu, Fei Gao, Wei Huang +1 more

arXiv:1511.05267•Science China Physics Mechanics and Astronomy•Sep 4, 2015•112 citations

Robust QKD-based private database queries based on alternative sequences of single-qubit measurements

Yu‐Guang Yang, ZhiChao Liu, Xiu‐Bo Chen +2 more

Science China Physics Mechanics and Astronomy•Sep 12, 2017•48 citations

Robust High Capability QKD-Based Database Private Query

Zhenlong Du, Xiaoli Li

International Journal of Theoretical Physics•Nov 12, 2018•6 citations

Novel classical post-processing for quantum key distribution-based quantum private query

Yu‐Guang Yang, Zhichao Liu, Xiu‐Bo Chen +3 more

Quantum Information Processing•Jun 18, 2016•46 citations

Practical quantum private query of blocks based on unbalanced-state Bennett-Brassard-1984 quantum-key-distribution protocol

Chun‐Yan Wei, Fei Gao, Qiaoyan Wen +1 more

Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message a1a2···al from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each a(i) contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.

Scientific Reports•Dec 18, 2014•65 citations
Until now, the only kind of practical quantum private query (QPQ), quantum-key-distribution (QKD)-based QPQ, focuses on the retrieval of a single bit. In fact, meaningful message is generally composed of multiple adjacent bits (i.e., a multi-bit block). To obtain a message a1a2···al from database, the user Alice has to query l times to get each ai. In this condition, the server Bob could gain Alice's privacy once he obtains the address she queried in any of the l queries, since each a(i) contributes to the message Alice retrieves. Apparently, the longer the retrieved message is, the worse the user privacy becomes. To solve this problem, via an unbalanced-state technique and based on a variant of multi-level BB84 protocol, we present a protocol for QPQ of blocks, which allows the user to retrieve a multi-bit block from database in one query. Our protocol is somewhat like the high-dimension version of the first QKD-based QPQ protocol proposed by Jacobi et al., but some nontrivial modifications are necessary.