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,     

SPN结构线性层的设计

SPN结构是一种流行的分组密码总体结构；差分和线性分析是攻击分组密码的最强有力的方法．章介绍了SPN结构研究的最新进展，着重论述如何用矩阵方法设计抗差分和线性分析的线性层．     

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.     

关于拟可换BCI-代数

本文重点解决拟可换BCI—代数的存在性问题,证明了存在(m,n;s,t)型拟可换真BCI—代数的充要条件是|m-n+s-t+1|≠1;同时找出了一个比有限BCI—代数类更广泛的拟可换BCI—代数类.     

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.     

基于P2P技术的混合云存储模型

为了解决普通云存储中重要数据完全依赖云端存储与管理所带来的数据安全问题,并增强存储数据的安全性和可靠性、减轻大数据文件存储过程中带来的通信压力,提出一种基于P2P技术的混合云存储模型(简称PCS).该模型由内部P2P网络和普通云端2部分组成,用户可把重要数据、大文件数据及全部元数据存储在PCS模型中的内部P2P网络,而仅把非重要数据交由云端服务商来存储和管理.PCS模型中对数据的存储和管理采用文件分片技术(一个文件可有多个分片,且每个分片可有多个副本)以保证数据的完整性和可靠性.PCS模型有效保证了重要数据的安全问题,部分减轻了企业与云端之间的通信带宽压力,并提高了云存储的文件检索速度.     

Forcible-Measurement Attack on Quantum Secure Direct Communication Protocol with Cluster State

The security of the quantum secure direct communication （QSDC） protocol with cluster state is analysed. It is shown that the secret would be partially leaked out when an eavesdropper performs forcible measurements on the transmitted particles. With the help of the result in minimum error discrimination, an upper bound （i.e. 40%） of this leakage is obtained. Moreover, the particular measurements which makes the leakage reach this bound are given.     

Cryptanalysis of Multiparty Quantum Secret Sharing of Quantum State Using Entangled States

Security of a quantum secret sharing of quantum state protocol proposed by Guo et al. [Chin. Phys. Lett. 25 （2008） 16] is reexamined. It is shown that an eavesdropper can obtain some of the transmitted secret information by monitoring the classical channel or the entire secret by intercepting the quantum states, and moreover, the eavesdropper can even maliciously replace the secret message with an arbitrary message without being detected. Finally, the deep reasons why an eavesdropper can attack this protocol are discussed and the modified protocol is presented to amend the security loopholes.