论文标题
从编码和勾结服务器检索量子私人信息
Quantum Private Information Retrieval from Coded and Colluding Servers
论文作者
论文摘要
在经典的私人信息检索（PIR）设置中，用户想从数据库或分布式存储系统（DSS）检索文件，而不会向持有数据的服务器揭示文件身份。在量子PIR（QPIR）设置中，用户通过从服务器接收量子信息来私下检索经典文件。在复制的服务器的情况下，Qpir问题已通过歌曲\ emph {等}处理，无论是无勾结还是所有服务器勾结的所有服务器。在本文中，将QPIR设置扩展到最大距离可分离（MDS）编码服务器。所提出的协议适用于任何$ [N，K] $ - MDS代码和$ t $ - 汇总，$ t = n-k $。与以前的案例相似，所达到的利率比经典同行中已知或猜想的速度更好。此外，可以证明如何适应该协议以从编码的DSSS SSS明显更高的检索率，该dss用局部维修代码（LRC）具有分离维修组，每个代码都是MDS代码。
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.
