论文标题
量子无法区分性混淆的结构
Constructions for Quantum Indistinguishability Obfuscation
论文作者
论文摘要
难以区分的混淆器是一种概率的多项式时间算法，它以输入为输入并输出具有与输入电路相同功能相同功能的新电路，因此，对于计算相同函数的任何两个电路，都不可区分的osfusccator osfuscicator的输出是无法区分的。在这里，我们研究了量子电路难以掺杂的方案。我们提出了两个无法区分性混淆的定义：在我们的第一个定义（QIO）中，如果输入电路完全等效，则混淆器的输出是无法区分的，而在我们的第二个定义（QIOD）中，如果输出不可与输入循环，则一定要等于一个pseivit，就可以涉及一位pse，而不是一个等效的结果。 Qio的计算表述方案，其中混淆器的输出的大小在非克利福德（T gates）的数量中是指数的，这意味着构造是有效的，只要T门的数量在电路大小上是对数的数量，并且（2）统计上的QIOD，对于统计上的QIOD，对于Kther to to to to kthe to to kthe kthe to to kthe to to kthe to niers to kthery wire de sep to kthery decry。只要K较小且固定，这种结构就有效。
An indistinguishability obfuscator is a probabilistic polynomial-time algorithm that takes a circuit as input and outputs a new circuit that has the same functionality as the input circuit, such that for any two circuits of the same size that compute the same function, the outputs of the indistinguishability obfuscator are indistinguishable. Here, we study schemes for indistinguishability obfuscation for quantum circuits. We present two definitions for indistinguishability obfuscation: in our first definition (qiO) the outputs of the obfuscator are required to be indistinguishable if the input circuits are perfectly equivalent, while in our second definition (qiOD), the outputs are required to be indistinguishable as long as the input circuits are approximately equivalent with respect to a pseudo-distance D. Our main results provide (1) a computationally-secure scheme for qiO where the size of the output of the obfuscator is exponential in the number of non-Clifford (T gates), which means that the construction is efficient as long as the number of T gates is logarithmic in the circuit size and (2)a statistically-secure qiOD, for circuits that are close to the kth level of the Gottesman-Chuang hierarchy (with respect to D); this construction is efficient as long as k is small and fixed.
