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

Relativistic quantum private database queries

Si-Jia Sun, Yu‐Guang Yang, Ming-Ou Zhang

Published Feb 2, 2015• 23 citations
Publisher
DOI
10.1007/s11128-015-0937-9

Related papers

Private database queries using one quantum state

Yu‐Guang Yang, Ming-Ou Zhang, Rui Zhe Yang

Quantum Information Processing•Dec 22, 2014•58 citations

Practical Quantum Database Private Query Protocol with Classical Database Owner

Lili Yan, Dongmei Liu, Shibin Zhang +2 more

International Journal of Theoretical Physics•Aug 5, 2020•2 citations

Advancing the database security of multi-round quantum private query protocols

Fei Gao

Science China Physics Mechanics and Astronomy•Jun 23, 2025•1 citation

Robust Quantum Private Queries

Tian‐Yin Wang, Shuyu Wang, Jianfeng Ma

International Journal of Theoretical Physics•Feb 24, 2016•16 citations

Implementation of Quantum Private Queries Using Nuclear Magnetic Resonance

Chuan Xi Wang, Liang Hao, Lian-Jie Zhao

We present a modified protocol for the realization of a quantum private query process on a classical database. Using one-qubit query and CNOT operation, the query process can be realized in a two-mode database. In the query process, the data privacy is preserved as the sender would not reveal any information about the database besides her query information, and the database provider cannot retain any information about the query. We implement the quantum private query protocol in a nuclear magnetic resonance system. The density matrix of the memory registers are constructed.

Chinese Physics Letters•Aug 1, 2011•12 citations

Quantum Private Queries

Vittorio Giovannetti, Seth Lloyd, Lorenzo Maccone

We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.

arXiv:0708.2992•Physical Review Letters•Jun 10, 2008•217 citations
We present a modified protocol for the realization of a quantum private query process on a classical database. Using one-qubit query and CNOT operation, the query process can be realized in a two-mode database. In the query process, the data privacy is preserved as the sender would not reveal any information about the database besides her query information, and the database provider cannot retain any information about the query. We implement the quantum private query protocol in a nuclear magnetic resonance system. The density matrix of the memory registers are constructed.
We propose a cheat sensitive quantum protocol to perform a private search on a classical database which is efficient in terms of communication complexity. It allows a user to retrieve an item from the database provider without revealing which item he or she retrieved: if the provider tries to obtain information on the query, the person querying the database can find it out. The protocol ensures also perfect data privacy of the database: the information that the user can retrieve in a single query is bounded and does not depend on the size of the database. With respect to the known (quantum and classical) strategies for private information retrieval, our protocol displays an exponential reduction in communication complexity and in running-time computational complexity.