Heralded entanglement purification protocol using high-fidelity parity-check gate based on nitrogen-vacancy center in optical cavity

The decoherence of entangled states caused by the noisy channel is a salient problem for reducing the fidelity of quantum communication.Here we present a heralded two-photon entanglement purification protocol(EPP)using heralded high-fidelity parity-check gate(HH-PCG),which can increase the entanglement of nonlocal two-photon polarization mixed state.The HH-PCG is constructed by the input-output process of nitrogen-vacancy(NV)center in diamond embedded in a single-sided optical cavity,where the errors caused by the imperfect interaction between the NV center-cavity system and the photon can be heralded by the photon detector.As the unwanted components can be filtrated due to the heralded function,the fidelity of the EPP scheme can be enhanced considerably,which will increase the fidelity of quantum communication processing.

Direct measurement of the concurrence of hybrid entangled state based on parity check measurements

The hybrid entangled state is widely discussed in quantum information processing. In this paper, we propose the first protocol to directly measure the concurrence of the hybrid entangled state. To complete the measurement, we design parity check measurements(PCMs) for both the single polarization qubit and the coherent state. In this protocol, we perform three rounds of PCMs. The results show that we can convert the concurrence into the success probability of picking up the correct states from the initial entangled states. This protocol only uses polarization beam splitters, beam splitters, and weak cross-Kerr nonlinearities, which is feasible for future experiments. This protocol may be useful in future quantum information processing.

Entanglement purification for memory nodes in a quantum network

The entanglement between quantum memory nodes is a prerequisite in a quantum network, and the diamond nitrogen-vacancy(NV) center is a promising candidate serving as a quantum memory node. Here, we investigate the possibility of achieving an entanglement purification protocol(EPP) for entangled NV centers in distant diamonds. To construct the EPP, we design a nondestructive parity-check detector(PCD) utilizing an auxiliary polarization-entangled photon pair, which makes our EPP less time consuming and insensitive to the phase fluctuation of the optical path length. The satisfied fidelity of an NV center pair after purification and efficiency of obtaining a purified NV center pair with our EPP can be obtained with current experimental techniques in the realistic condition. This EPP is useful for a quantum network in which NV centers are used as quantum memory nodes.

Direct measurement of the concurrence for two-qubit electron spin entangled pure state based on charge detection

We propose a protocol for directly measuring the concurrence of a two-qubit electronic pure entangled state. To complete this task, we first design a parity-check measurement（PCM） which is constructed by two polarization beam splitters（PBSs） and a charge detector. By using the PCM for three rounds, we can achieve the concurrence by calculating the total probability of picking up the odd parity states from the initial states. Since the conduction electron may be a good candidate for the realization of quantum computation, this protocol may be useful in future solid quantum computation.

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with respect to a classical one. Our investigation also reveals that the non-determinism and complexity introduced by the principles of quantum mechanics into even the most simple games make brute-force strategies considerably more difficult to implement. Consequently, games in which machines have gained the upper hand over humans may be made fair again by upgrading them to a quantum level.

基于量子测量的量子计算模型综述

基于测量的单向量子计算是重要的通用量子计算模型,可以模拟一般量子计算任务。单向量子计算基于量子簇态作为计算资源,利用每个量子位的局部量子测量和经典通信执行一般量子计算。单向量子计算是与量子线路模型等价的量子计算模型。近年来,研究者们对单向量子计算的量子资源、纠缠度量、局部操作简化,以及量子通信等给出一系列研究成果,并基于光学平台开展了一些量子模拟实验。量子簇态与单向量子计算为一般量子计算提供非常好的量子任务处理方式,受到研究者们的广泛关注。该文主要总结基于测量的单向量子计算模型,包括重要的量子资源态、局部信息处理方式,以及与单向量子计算相关的研究;该文对单向量子计算存在的问题和前沿研究方法进行展望,为研究者提供借鉴。

通过旋转操作和计算基测量实现几率量子隐形传态(英文)

提出一种利用部分纠缠粒子对作为量子通道实现量子隐形传态的方案。在此方案中,若发送者施一旋转操作于被传态的粒子并对该粒子和她拥有的部分纠缠粒子对之一实施计算基测量,则该粒子所处的未知量子态被传送给接收者,其态的保真度为1,成功几率与部分纠缠粒子对的两个Schmidt系数有关。此方案可推广到隐形传送N粒子的未知量子态。

基于操作腔外原子比特控制腔内原子比特相干性时间演化

考虑初始处于两类Bell态的两原子比特,将其中一个注入真空态腔中发生共振相互作用的情况,研究基于操作腔外原子比特控制腔内原子比特相干性时间演化.考察对腔外原子比特施Hadamard(H)门,H类门,Y门及位相门四种逻辑门操作及态选择测量前后,腔内原子比特约化密度矩阵非对角元时间演化曲线,讨论两类Bell态之间的关联性.结果表明,对腔外原子比特操作前,腔内原子比特密度矩阵非对角元在任意时刻都为零,总是处于混合态或经典态,因此始终退相干.而对腔外原子比特施H门和H类门操作及基态测量后,腔内原子比特密度矩阵非对角元呈现周期为2π的时间演化,除(2n+1)π/2时刻外,其相干性得到恢复;在nπ时刻,其最大相干叠加态和一般相干叠加态被制备;两类Bell态之间存在R∧(π/2)旋转关联性.而对腔外原子比特施Y门及位相门操作后,腔内原子比特的相干性得不到恢复.发现腔内原子比特的相干性得到恢复的必要条件是,逻辑门操作能够调节腔内原子比特与环境的相互作用,并使两原子比特与场分离的同时,它们之间形成强相干性的纠缠态分布.

部分纠缠光子对的有效纠缠浓缩方案

利用线性光学器件,如极化分束器(Polarization beam splitter, PBS),半波片(Half-wave plate,HWP),电荷检测器(Charge detector, CD)等的特性以及辅助的单光子可以实现对部分纠缠的两光子系统进行浓缩并得到最大纠缠态.在此基础上,可以直接扩展到N光子的情形.方案中成功的关键部分是当两光子通过第一个极化分束器时,选择它们从不同的输出模射出的情形,此时电荷检测器只包含一个光子。对于两个光子从同一个输出模射出的情形,它可以被利用起来进行下一轮浓缩.迭代浓缩可以获得较高的成功概率。另外该方案中应用的都是线性元件,降低了在实验上实现的难度,具有一定的可行性。

基于经典线性码构造的纠缠辅助量子码

首先,利用有限域F_(q)上参数为[n,k,d]经典线性码C的线性互补对偶(LCD)线性子码的一个正交基,构造一类参数为[[n+l,k-h,d′;n-k-h+l]]的纠缠辅助量子码,其中h=dim(Hull_(E)(C)),0≤l≤k-h,d≤d′≤d+l.特别地,当经典线性码C为Euclide对偶包含线性码时,存在一个参数为[[n+l,2k-n,d′;l]]的纠缠辅助量子码,其中0≤l≤2k-n,d≤d′≤d+l.其次,通过对有限域F_(q)上参数为[n,k,d]的Euclide对偶包含线性码C的校验矩阵H作一类变换,构造另一类参数为[[n+l,2k-n+l,d′;2l]]的纠缠辅助量子码,其中0≤l≤n-k,d≤d′≤d+l.

Optimal subsystem approach to multi-qubit quantum state discrimination and experimental investigation

Quantum computing is a significant computing capability which is superior to classical computing because of its superposition feature. Distinguishing several quantum states from quantum algorithm outputs is often a vital computational task. In most cases, the quantum states tend to be non-orthogonal due to superposition; quantum mechanics has proved that perfect outcomes could not be achieved by measurements, forcing repetitive measurement. Hence, it is important to determine the optimum measuring method which requires fewer repetitions and a lower error rate. However, extending current measurement approaches mainly aiming at quantum cryptography to multi-qubit situations for quantum computing confronts challenges, such as conducting global operations which has considerable costs in the experimental realm. Therefore, in this study, we have proposed an optimum subsystem method to avoid these difficulties. We have provided an analysis of the comparison between the reduced subsystem method and the global minimum error method for two-qubit problems; the conclusions have been verified experimentally. The results showed that the subsystem method could effectively discriminate non-orthogonal two-qubit states, such as separable states, entangled pure states, and mixed states; the cost of the experimental process had been significantly reduced, in most circumstances, with acceptable error rate. We believe the optimal subsystem method is the most valuable and promising approach for multi-qubit quantum computing applications.

高维量子低密度奇偶校验码纠缠度

量子纠错与量子计算是量子信息科学坚实的基础和重要的组成部分.在实际应用中,如大气传输中的量子通信,将需要多种数学运算,其中包括量子纠错码.量子纠错码可以抵抗噪声,但由于构造量子纠错码依赖于量子纠缠,因此被认为是困难的.利用图态解决码字纠缠度是一个很有前途的解决方案,但高维图态构造起来仍有诸多困难,上述困难可以巧妙地通过码字纠缠的上界和下界来解决.本文根据稳定子码循环差集的特性和经典低密度奇偶校验(low-density parity check,LDPC)码的U和B组合,构造了高维量子低密度奇偶校验(quantum low-density parity check,QLDPC)码.通过计算新码元的非Z型生成元并求出其最小数目得到新码元的纠缠上界;再计算新码校验矩阵的秩作为纠缠下界.当码字纠缠上界和下界不同时,利用机器学习中的学习向量量化(learning vector quantization,LVQ)算法可同时求得码字纠缠度和编码复杂度,以此推得它们之间的关系.在计算运行速度方面,对比拉格朗日乘数法中的迭代算法,LVQ算法运行速度提高了37:68%,而且在稳定性和精度方面,LVQ算法的性能优于拉格朗日乘数法中的迭代算法.本文在量子码字纠缠度的测量中迈出了重要的一步,为设计具有更高译码效率的量子纠错码提供了帮助.

高效实现针对光子丢失问题的容错量子计算

基于两个基本操作——控制路径操作和纠缠子,首先给出非破坏性多光子奇偶校验的实现.随后,将这些操作用于光学量子计算中光子丢失问题的处理.可以实现奇偶量子态的制备,以及单体操作与两体控制非操作,由此可以实现普适容错量子计算.不管是态制备还是门操作都是确定性的,同时方案的实现复杂度也要远低于此前的方案,对于辅助单光子资源的需求也降到很低的程度.并且实现过程中除奇偶校验外,不需要进行任何单光子探测,因此不会造成任何单光子的损失,最大限度地利用了光子资源.比之此前的线性光学方案,我们方案的确定性、高效性、简单性以及资源的高利用率等特点,使得方案更具可行性和更加适用于大规模量子计算.

压缩态光场及其应用研究进展

1981年,Caves教授首次提出“压缩态”的概念,并指出利用压缩态光场可以提高激光干涉引力波探测的灵敏度。在过去的四十年,压缩态光场不仅成功用于突破标准量子极限的引力波探测、位移测量、位相测量等量子精密测量领域,而且基于单模压缩态制备的双模压缩态和多组份纠缠态也在量子计算、量子通信等量子信息处理中扮演着重要的作用。本文简要介绍了压缩态光场的基本概念、制备、探测方法及其在量子精密测量、量子通信、量子计算中的应用进展。

两比特纯态纠缠的直接测量

研究了如何在不需要量子态重构的前提下直接测量一个两比特任意纯态的纠缠concurrence。设计了一个concurrence的直接测量量子线路,即通过对待测纠缠粒子对的两个全同拷贝实施σz操作、单比特R旋转操作以及奇偶宇称校验检测,使得concurrence被编码在最后获得某些状态的概率中,从而实现对concurrence的直接测量。在给出concurrence直接测量的量子线路的基础上,基于光学系统设计了一个直接测量光子偏振纠缠concurrence的物理方案,实现两比特耦合的奇偶宇称校验检测操作只出现一次,大大降低了方案的复杂度。另外,该方案可实现远程纠缠态的纠缠直接测量。