论文标题
量子私人信息检索的能力与勾结服务器
Capacity of Quantum Private Information Retrieval with Colluding Servers
论文作者
论文摘要
量子私人信息检索（QPIR）是一个协议，其中用户通过下载量子系统而不揭示检索哪个文件，从$ \ mathsf {n} $非通信服务器检索多个文件之一。由于具有更强安全要求的Qpirs的变体，对称QPIR是一个协议，其中没有其他文件泄露给用户，而$ \ m athsf {t} $ - 私人QPIR是一个协议，即使最多在$ \ mathsf {t} $服务器可以碰撞以揭示身份的标识，即使最多也可以保密。 QPIR容量是文件大小与下载量子系统大小的最大比率，我们证明对称$ \ MATHSF {T} $ - 私人Qpir容量为$ \ min \ {1,2（\ Mathsf {n} - n} - \ Mathsf {T} <\ Mathsf {n} $。我们通过稳定剂形式主义构建了能力实现的QPIR协议，并证明了我们的协议的最佳性。提议的能力大于经典的能力。
Quantum private information retrieval (QPIR) is a protocol in which a user retrieves one of multiple files from $\mathsf{n}$ non-communicating servers by downloading quantum systems without revealing which file is retrieved. As variants of QPIR with stronger security requirements, symmetric QPIR is a protocol in which no other files than the target file are leaked to the user, and $\mathsf{t}$-private QPIR is a protocol in which the identity of the target file is kept secret even if at most $\mathsf{t}$ servers may collude to reveal the identity. The QPIR capacity is the maximum ratio of the file size to the size of downloaded quantum systems, and we prove that the symmetric $\mathsf{t}$-private QPIR capacity is $\min\{1,2(\mathsf{n}-\mathsf{t})/\mathsf{n}\}$ for any $1\leq \mathsf{t}< \mathsf{n}$. We construct a capacity-achieving QPIR protocol by the stabilizer formalism and prove the optimality of our protocol. The proposed capacity is greater than the classical counterpart.
