Projects per year
In the classical private information retrieval (PIR) setup, a user wants to retrieve a file from a database or a distributed storage system (DSS) without revealing the file identity to the servers holding the data. In the quantum PIR (QPIR) setting, a user privately retrieves a classical file by receiving quantum information from the servers. The QPIR problem has been treated by Song et al. in the case of replicated servers, both with and without collusion. QPIR over [n, k] maximum distance separable (MDS) coded servers was recently considered by Allaix et al., but the collusion was essentially restricted to t = n - k servers in the sense that a smaller t would not improve the retrieval rate. In this paper, the QPIR setting is extended to allow for retrieval with high rate for any number of colluding servers t with 1 ≤ t ≤ n - k. Similarly to the previous cases, the rates achieved are better than those known or conjectured in the classical counterparts, as well as those of the previously proposed coded and colluding QPIR schemes. This is enabled by considering the stabilizer formalism and weakly self-dual generalized Reed-Solomon (GRS) star product codes.
|Title of host publication||2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings|
|Number of pages||6|
|Publication status||Published - 12 Jul 2021|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE International Symposium on Information Theory - Virtual, online, Melbourne, Australia|
Duration: 12 Jul 2021 → 20 Jul 2021
|Name||IEEE International Symposium on Information Theory - Proceedings|
|Conference||IEEE International Symposium on Information Theory|
|Period||12/07/2021 → 20/07/2021|
FingerprintDive into the research topics of 'High-Rate Quantum Private Information Retrieval with Weakly Self-Dual Star Product Codes'. Together they form a unique fingerprint.
- 1 Active
01/01/2021 → 31/12/2023
Project: Academy of Finland: Other research funding