Quantum Private Information Retrieval from Coded and Colluding Servers

Matteo Allaix, Lukas Holzbaur, Tefjol Pllaha, Camilla Hollanti

Research output: Contribution to journalArticleScientificpeer-review


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 without collusion and with all but one servers colluding. In this paper, the QPIR setting is extended to account for maximum distance separable (MDS) coded servers. The proposed protocol works for any n,k-MDS code and t-collusion with t=n-k. Similarly to the previous cases, the rates achieved are better than those known or conjectured in the classical counterparts. Further, it is demonstrated how the protocol can adapted to achieve significantly higher retrieval rates from DSSs encoded with a locally repairable code (LRC) with disjoint repair groups, each of which is an MDS code.
Original languageEnglish
Pages (from-to)599-610
JournalIEEE Journal on Selected Areas in Information Theory
Issue number2
Early online date2020
Publication statusPublished - Aug 2020
MoE publication typeA1 Journal article-refereed


Dive into the research topics of 'Quantum Private Information Retrieval from Coded and Colluding Servers'. Together they form a unique fingerprint.

Cite this