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 \emph{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.

中文翻译：

---

从编码和共谋服务器中检索量子隐私信息

在经典的私人信息检索 (PIR) 设置中，用户希望从数据库或分布式存储系统 (DSS) 检索文件，而不会将文件身份透露给保存数据的服务器。在量子 PIR (QPIR) 设置中，用户通过从服务器接收量子信息来私下检索经典文件。在复制服务器的情况下，Song \emph{et al.} 已经处理了 QPIR 问题，既没有串通，也只有一台服务器串通。在本文中，QPIR 设置扩展到考虑最大距离可分离 (MDS) 编码服务器。提议的协议适用于任何 $[n,k]$-MDS 代码和 $t$-collusion with $t=nk$。与前面的案例类似，所达到的速率比经典对应中已知或推测的速率要好。更多，