Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages

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.

References in corpus (8)

• Structure of states which satisfy strong subadditivity of quantum entropy with equality
• Private Information Retrieval from Coded Databases with Colluding Servers
• Quantum private queries
• Quantum secure direct communication with private dense coding using general preshared quantum state
• Quantum Private Information Retrieval has linear communication complexity
• Provably-secure symmetric private information retrieval with quantum cryptography
• Quantum Private Information Retrieval with Sublinear Communication Complexity
• Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers

Cited by in corpus (1)

• Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems