量子加密算法的研究

本文研究如何加密量子消息,综述了近几年的研究进展,并分别介绍使用经典密钥和量子密钥的量子加密方法,讨论了量子加密算法和量子隐形传态之间的联系。     

Optimal conclusive teleportation of a d-dimensional two-particle unknown quantum state

A conclusive teleportation protocol of a d-dimensional two-particle unknown quantum state using three d- dimensional particles in an arbitrary pure state is proposed. A sender teleports the unknown state conclusively to a receiver by using the positive operator valued measure（POVM） and introducing an ancillary qudit to perform the generalized Bell basis measurement, We calculate the optimal teleportation fidelity. We also discuss and analyse the reason why the information on the teleported state is lost in the course of the protocol,     

高效的可证明安全的无证书聚合签名方案

利用双线性对构造了一个高效的无证书聚合签名方案,在随机预言机模型下给出了方案的安全性证明,其安全性基于计算Diffie-Hellman难题.与已有的无证书聚合签名方案相比,本文方案更能提高签名验证与传输效率,因聚合签名的验证只需要计算4个双线性对,签名的长度是固定的,仅有320bits,是目前最短的无证书聚合签名.     

Quantum algorithm for neighborhood preserving embedding

Neighborhood preserving embedding (NPE) is an important linear dimensionality reduction technique that aims at preserving the local manifold structure. NPE contains three steps, i.e., finding the nearest neighbors of each data point, constructing the weight matrix, and obtaining the transformation matrix. Liang et al. proposed a variational quantum algorithm (VQA) for NPE [Phys. Rev. A 101 032323 (2020)]. The algorithm consists of three quantum sub-algorithms, corresponding to the three steps of NPE, and was expected to have an exponential speedup on the dimensionality n. However, the algorithm has two disadvantages: (i) It is not known how to efficiently obtain the input of the third sub-algorithm from the output of the second one. (ii) Its complexity cannot be rigorously analyzed because the third sub-algorithm in it is a VQA. In this paper, we propose a complete quantum algorithm for NPE, in which we redesign the three sub-algorithms and give a rigorous complexity analysis. It is shown that our algorithm can achieve a polynomial speedup on the number of data points m and an exponential speedup on the dimensionality n under certain conditions over the classical NPE algorithm, and achieve a significant speedup compared to Liang et al.'s algorithm even without considering the complexity of the VQA.     

素数元旋转对称弹性布尔函数的构造与计数

通过对素数元旋转对称弹性布尔函数特征矩阵的研究,给出了其特征矩阵的若干性质,得到了素数元旋转对称布尔函数为弹性函数的一个充要条件,由此完全决定了旋转对称弹性函数的构造以及这类函数的精确计数公式,最后还给出了所有的三元、五元、七元旋转对称弹性布尔函数的构造方案与精确计数。     

Circular threshold quantum secret sharing

This paper proposes a circular threshold quantum secret sharing （TQSS） scheme with polarized single photons. A polarized single photon sequence runs circularly among any t or more of n parties and any t or more of n parties can reconstruct the secret key when they collaborate. It shows that entanglement is not necessary for quantum secret sharing. Moreover, the theoretic efficiency is improved to approach 100% as the single photons carrying the secret key are deterministically forwarded among any t or more of n parties, and each photon can carry one bit of information without quantum storage. This protocol is feasible with current technology.     

一类基于填充设计的LDPC码的构造

文中利用填充设计,构造了一类具有特定结构的任意码长的LDPC(低密度校验)码,这类LDPC码不仅具有好的最小距离,其Tanner图的最小周长为6,而且它的编码和译码结构可通过移位寄存器线性产生,其性能优于随机产生的LD-PC码。     

2阶相关免疫函数的构造与计数

本文讨论２阶相关免疫函数的构造与计数问题，构造出了一大类重量为２的方幂的２阶相关免疫函数，首次给出了２阶相关免疫函数个数的下界。     

Three-party quantum secret sharing of secure direct communication based on x-type entangled states

Based on x-type entangled states and the two-step protocol [Deng F G, Long G L and Liu X S 2003 Phys. Rev. A 68 042317], a quantum secret sharing protocol of secure direct communication based on x-type entangled states ｜X00〉3214 is proposed. Using some interesting entanglement properties of this state, the agent entirety can directly obtain the secret message from the message sender only if they collaborate together. The security of the scheme is also discussed.