Quantum Density Peak Clustering Algorithm

A widely used clustering algorithm, density peak clustering (DPC), assigns different attribute values to data points through the distance between data points, and then determines the number and range of clustering by attribute values. However, DPC is inefficient when dealing with scenes with a large amount of data, and the range of parameters is not easy to determine. To fix these problems, we propose a quantum DPC (QDPC) algorithm based on a quantum DistCalc circuit and a Grover circuit. The time complexity is reduced to O(log(N2)+6N+N), whereas that of the traditional algorithm is O(N2). The space complexity is also decreased from O(N·⌈logN⌉) to O(⌈logN⌉).     

Unstructured Adiabatic Quantum Search

In the adiabatic quantum computation model, a computational procedure is described by the continuous time evolution of a time dependent Hamiltonian. We apply this method to the Grover's problem, i.e., searching a marked item in an unstructured database. Classically, the problem can be solved only in a running time of order O(N) (where N is the number of items in the database), whereas in the quantum model a speed up of order has been obtained. We show that in the adiabatic quantum model, by a suitable choice of the time-dependent Hamiltonian, it is possible to do the calculation in constant time, independent of the the number of items in the database. However, in this case the initial time-complexity of is replaced by the complexity of implementing the driving Hamiltonian.     

基于Bloch球面搜索的量子粒子群优化算法

通过分析量子势阱粒子群优化算法的设计过程,提出一种基于Bloch球面搜索的量子粒子群优化算法.首先用基于Bloch球面描述的量子位描述粒子,用泡利矩阵建立旋转轴,用Delta势阱模型计算旋转角度,用量子位在Bloch球面上的绕轴旋转实现搜索.然后用Hadamard门实现粒子变异,以避免早熟收敛.这种旋转可使当前量子位沿着Bloch球面上的大圆逼近目标量子位,从而可加速优化进程.仿真结果表明,该算法的优化能力优于原算法.     

General Quantum Meet-in-the-Middle Search Algorithm Based on Target Solution of Fixed Weight

Similar to the classical meet-in-the-middle algorithm, the storage and computation complexity are the key factors that decide the efficiency of the quantum meet-in-the-middle algorithm. Aiming at the target vector of fixed weight, based on the quantum meet-in-the-middle algorithm, the algorithm for searching all n-product vectors with the same weight is presented, whose complexity is better than the exhaustive search algorithm. And the algorithm can reduce the storage complexity of the quantum meet-in-the-middle search algorithm. Then based on the algorithm and the knapsack vector of the Chor-Rivest public-key crypto of fixed weight d, we present a general quantum meet-in-the-middle search algorithm based on the target solution of fixed weight, whose computational complexity is ∑_j^d=(0(√C_n-k+1^d-j)+O(C_k^jlogC_k^j)) with ∑_i=0^dC_kⁱ memory cost. And the optimal value of k is given. Compared to the quantum meet-in-the-middle search algorithm for knapsack problem and the quantum algorithm for searching a target solution of fixed weight, the computational complexity of the algorithm is lower. And its storage complexity is smaller than the quantum meet-in-the-middle-algorithm.     

Robust Multiparty Quantum Secret Sharing against Participant ForcibleManipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Commun. Theor. Phys. 52 (2009) 421] isanalyzed. It is shown that this protocol is vulnerable since theagents' imperfect encryption scheme can be attacked by a powerfulparticipant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.     

Robust Multiparty Quantum Secret Sharing against Participant Forcible Manipulation

The security of the multiparty quantum secret sharing protocol proposed by Gao [G. Gao, Commun. Theor. Phys. 52 （2009） 421] is analyzed. It is shown that this protocol is vulnerable since the agents＇ imperfect encryption scheme can be attacked by a powerful participant. We introduce a attack strategy called participant forcible manipulation and analyze the information leakage in this protocol under this attack. At last, we give an improved version of the original protocol. The improved protocol is robust and has the same efficiency as the original one.     

Quantum computation with Turaev-Viro codes

For a 3-manifold with triangulated boundary, the Turaev-Viro topological invariant can be interpreted as a quantum error-correcting code. The code has local stabilizers, identified by Levin and Wen, on a qudit lattice. Kitaev’s toric code arises as a special case. The toric code corresponds to an abelian anyon model, and therefore requires out-of-code operations to obtain universal quantum computation. In contrast, for many categories, such as the Fibonacci category, the Turaev-Viro code realizes a non-abelian anyon model. A universal set of fault-tolerant operations can be implemented by deforming the code with local gates, in order to implement anyon braiding. We identify the anyons in the code space, and present schemes for initialization, computation and measurement. This provides a family of constructions for fault-tolerant quantum computation that are closely related to topological quantum computation, but for which the fault tolerance is implemented in software rather than coming from a physical medium.     

基于超导量子器件的量子计算

超导量子器件能够展现宏观量子相干性.基于超导量子器件的量子计算是量子信息领域中的一个重要研究方向,同时,超导量子器件物理特性的研究也是目前凝聚态物理和量子光学领域的交叉前沿课题.文章简述了近年来在超导量子计算方面的一些重要结果和进展,并讨论了其研究现状和发展趋势.     

Information and Distinguishability of Ensembles of Identical Quantum States

We consider a fixed quantum measurement performed over n identical copies of quantum states. Using a rigorous notion of distinguishability based on Shannon’s 12th theorem, we show that in the case of a single qubit, the number of distinguishable states is , where (α₁,α₂) is the angle interval from which the states are chosen. In the general case of an N-dimensional Hilbert space and an area Ω of the domain on the unit sphere from which the states are chosen, the number of distinguishable states is . The optimal distribution is uniform over the domain in Cartesian coordinates.     

Adiabatic Quantum Gates

We discuss the logic implementation of quantum gates in the framework of the quantum adiabatic method, which uses the language of ground states, spectral gaps and Hamiltonians instead of the standard unitary transformation language.     

量子过程神经网络模型算法及应用

为提高过程神经网络的逼近和泛化能力, 从研究过程神经元信息处理的量子计算实现机理入手, 提出基于量子旋转门及多位受控非门的物理意义构造量子过程神经元的新思想. 将离散化后的过程式输入信息作为受控非门的控制位, 经过量子旋转门作用后控制目标量子位的状态, 以目标量子位处于状态|1>概率幅作为量子过程神经元的输出. 以量子过程神经元为隐层, 普通神经元为输出层, 可构成量子过程神经网络. 基于量子计算机理推导了该模型的学习算法. 将该模型用于太阳黑子数年均值预测, 应用结果表明, 所提方法与普通过程神经网络相比, 预测精度有所提高, 对于复杂预测问题具有一定理论意义和实用价值.     

Quantum Computational Logic

A quantum computational logic is constructed by employing density operators on spaces of qubits and quantum gates represented by unitary operators. It is shown that this quantum computational logic is isomorphic to the basic sequential effect algebra [0, 1].     

An Alternative Adiabatic Quantum Algorithm for the Hamiltonian Cycle Problem

We put forward an alternative quantum algorithm for finding Hamiltonian cycles in any N-vertex graph based on adiabatic quantum computing. With a von Neumann measurement on the final state, one may determine whether there is a Hamiltonian cycle in the graph and pick out a cycle if there is any. Although the proposed algorithm provides a quadratic speedup, it gives an alternative algorithm based on adiabatic quantum computation, which is of interest because of its inherent robustness.     

Climbing Mount Scalable: Physical Resource Requirements for a Scalable Quantum Computer

The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a demand for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the effective number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.     

Quantum Information Splitting of an Arbitrary Three-Qubit State by Using Cluster States and Bell States

A new application of cluster states is investigated for quantum information splitting (QIS) of an arbitrary three-qubit state. In our scheme, a four-qubit cluster state and a Bell state are shared by a sender (Alice), a controller (Charlie), and areceiver (Bob). Both the sender and controller only need to perform Bell-state measurements (BSMs), the receiver can reconstruct the arbitrary three-qubit state by performing some appropriately unitary transformations on his qubits after he knows the measured results of both the sender and the controller. This QIS scheme is deterministic.     

Qubit Semantics and Quantum Trees

In the qubit semantics the meaning of any sentence α is represented by a quregister: a unit vector of the n–fold tensor product ⊗ⁿ ℂ², where n depends on the number of occurrences of atomic sentences in α (see Cattaneo et al.). The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the noncontradiction principle is violated. We show that QCL does not admit any logical truth. In this framework, any sentence α gives rise to a quantum tree, consisting of a sequence of unitary operators. The quantum tree of α can be regarded as a quantum circuit that transforms the quregister associated to the occurrences of atomic subformulas of α into the quregister associated to α.     

Maximum Speed of Quantum Evolution

In this paper, we discuss the question of the minimum time needed for any state of a given quantum system to evolve into a distinct (orthogonal) state. This problem is relevant to deriving physical limits in quantum computation and quantum information processing. Here, we consider both cases of nonadiabatic and adiabatic evolution and we derive the Hamiltonians corresponding to the minimum time evolution predicted by the Margolus–Levitin theorem.     

Quantum Secure Dialogue with Quantum Encryption

How to solve the information leakage problem has become the research focus of quantum dialogue. In this paper, in order to overcome the information leakage problem in quantum dialogue, a novel approach for sharing the initial quantum state privately between communicators, i.e., quantum encryption sharing, is proposed by utilizing the idea of quantum encryption. The proposed protocol uses EPR pairs as the private quantum key to encrypt and decrypt the traveling photons, which can be repeatedly used after rotation. Due to quantum encryption sharing, the public announcement on the state of the initial quantum state is omitted, thus the information leakage problem is overcome.The information-theoretical efficiency of the proposed protocol is nearly 100%, much higher than previous information leakage resistant quantum dialogue protocols. Moreover, the proposed protocol only needs single-photon measurements and nearly uses single photons as quantum resource so that it is convenient to implement in practice.     

Partial Boolean Functions With Exact Quantum Query Complexity One

We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be computed exactly by a 1-query quantum algorithm. Due to the second characterization, we construct a function F that maps any n-bit partial Boolean function to some integer, and if an n-bit partial Boolean function f depends on k bits and can be computed exactly by a 1-query quantum algorithm, then F(f) is non-positive. In addition, we show that the number of all n-bit partial Boolean functions that depend on k bits and can be computed exactly by a 1-query quantum algorithm is not bigger than an upper bound depending on n and k. Most importantly, the upper bound is far less than the number of all n-bit partial Boolean functions for all efficiently big n.     

单光子源及在量子信息领域的应用

光量子比特是量子计算和量子通信的理想候选体系之一。高效率、高品质、确定性的单光子源是实现光学量子计算和绝对安全量子通信的重要前提条件。自组装半导体量子点,又称“人造原子”,具有优良的单光子性和光子全同性,是理想的单光子源。此外,量子点可以通过外加电场,囚禁单个原子或空穴,作为光子-自旋比特的界面,构建可扩展光量子网络。微柱腔耦合的量子点,拥有很强的Purcell效应,在保持单光子性和光子全同性的同时,大大地提高了提取效率,且具有很好的相干性,可用于大规模量子计算。近年来,人们在二维单原子层材料中发现了非经典的单光子发射,使二维材料和量子光学领域得到了结合,开辟了新的研究路线：探索单原子层材料在量子技术的潜在应用。和传统固态单光子源系统相比,二维材料更易于与其他光电平台结合,可人为控制缺陷位置,有利于推动高品质、低成本单光子源的发展,得到了科学家的广泛关注。本报告首先从量子计算和量子通信两方面提出发展单光子源的意义,接着介绍单光子源的性质和产生原理,然后介绍单光子源在自组装半导体量子点和二维单原子层材料中的实现和发展,最后从光子-自旋量子隐形传态和玻色采样实验中讨论单光子源在量子计算和量子网络方面的应用前景。