Prior entanglement exponentially improves one-server quantum private information retrieval for quantum messages

Quantum private information retrieval (QPIR) for quantum messages is a quantum communication task, in which a user retrieves one of the multiple quantum states from the server without revealing which state is retrieved. In the one-server setting, we find an exponential gap in the communication complexities between the presence and absence of prior entanglement in this problem with the one-server setting. To achieve this aim, as the first step, we prove that the trivial solution of downloading all messages is optimal under QPIR for quantum messages, which is a similar result to that of classical PIR but different from QPIR for classical messages. As the second step, we propose an efficient one-server one-round QPIR protocol with prior entanglement by constructing a reduction from a QPIR protocol for classical messages to a QPIR protocol for quantum messages in the presence of prior entanglement.

Authors

Institutions

Publication Details

Journal
EPJ Quantum Technology
Published
2024-09-06
DOI
https://doi.org/10.1140/epjqt/s40507-024-00266-6
Citations
2
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Prior entanglement exponentially improves one-server quantum private information retrieval for quantum messages

François Le Gall, Masahito Hayashi, Seunghoan Song
2 citations
EPJ Quantum Technology
Quantum Information and Cryptography
article

Prior entanglement exponentially improves one-server quantum private information retrieval for quantum messages

François Le Gall, Masahito Hayashi, Seunghoan Song
article en
2 citations

Abstract

Quantum private information retrieval (QPIR) for quantum messages is a quantum communication task, in which a user retrieves one of the multiple quantum states from the server without revealing which state is retrieved. In the one-server setting, we find an exponential gap in the communication complexities between the presence and absence of prior entanglement in this problem with the one-server setting. To achieve this aim, as the first step, we prove that the trivial solution of downloading all messages is optimal under QPIR for quantum messages, which is a similar result to that of classical PIR but different from QPIR for classical messages. As the second step, we propose an efficient one-server one-round QPIR protocol with prior entanglement by constructing a reduction from a QPIR protocol for classical messages to a QPIR protocol for quantum messages in the presence of prior entanglement.

EPJ Quantum TechnologyVol. 11(1)
Chinese University of Hong Kong, Shenzhen (CN), Beijing Academy of Quantum Information Sciences (CN), Nagoya University (JP)
National Natural Science Foundation of China
Openalex Percentile: Top 87%
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.