基于三对Bell态纠缠交换的QDKD方案

提出了一种基于三对Bell态纠缠交换的量子确定性密钥分发方案(Quantum Deterministic Key Distribution,QDKD),该方案充分利用量子纠缠交换的原理,通过对三对Bell态进行纠缠、测量操作,并辅以经典信息实现确定性密钥的分发,方案中任何窃听行为都会被及时发现。同基于两对Bell态纠缠交换的QDKD方案相比,协议利用三对Bell态并使用两种方法实现确定性密钥信息的分发。分析结果表明,方案仅用到两粒子纠缠态,没有涉及任何幺正操作,操作性强,密钥分发效率高。     

简谐外磁场环境下J-C模型的热力学纠缠

以简谐外磁场环境下的J-C模型为研究对象,从系统的哈密顿矩阵出发,通过计算模拟得出热力学纠缠度解析表达式。计算结果表明,对应于不同的外磁场强度,系统热力学纠缠度呈周期性余弦变化,但随环境温度升高快速衰减;在相同环境温度下,系统热力学纠缠度关于磁场强度左右不对称变化。     

量子雷达及其目标探测性能综述

量子技术与传统技术相结合以提升经典系统性能是近年来电子信息、计算机技术等众多科学领域研究热点。由于隐身和电子对抗技术的进步和日益成熟,雷达作为一类典型的电子信息系统,其目标探测受到了越来越多的挑战。从雷达目标探测角度出发,介绍了量子雷达的基本概念与分类、若干实现模型,重点剖析、归纳了量子纠缠等量子效应增强雷达目标探测性能的物理机理与研究现状,指出了量子雷达研究和实现中的关键技术与研究方向。     

简谐外磁场环境下海森堡XXZ模型的热力学纠缠

研究了在简谐外磁场环境下的海森堡XXZ模型,并通过计算解出热力学纠缠度。模拟表明,取不同的各向异性参数时,系统的热力学纠缠度对外部磁场和环境温度的变化比较敏感,并随简谐磁场的变化表现出周期性。固定各向异性参数时,热纠缠度随温度的增加呈现衰减趋势;增大各向异性参数时,热纠缠度则很快地趋于零,其对应临界温度也迅速降低。     

连续变量三体纠缠态的纠缠交换及量子远距离克隆

寻找合适的连续变量三体纠缠源,并利用它来讨论连续变量的三体纠缠交换过程,使得没有任何相互作用的遥远的三体之间产生纠缠;同时研究纠缠态的量子远距离克隆过程,从而使连续变量纠缠态的1对纠缠模被远距离克隆成2对纠缠模,实现纠缠性质的远距离克隆。     

量子计算和量子计算机简述

介绍了量子计算和量子计算机的历史和发展，说明了量子计算机在什么地方超出经典计算机，介绍了量子计算机的原理和网络模型以及量子计算机实现中的困难。     

量子关联成像技术

作为一种新型的成像技术,关联成像受到了国内外学者的广泛关注。本文阐述了量子关联成像的基本原理,介绍了量子关联成像研究历史,对量子关联成像的特点及其可能的应用进行了简要介绍。     

Revenue management with aircraft reassignment flexibility

A well‐studied problem in airline revenue management is the optimal allocation of seat inventory among different fare‐classes, given a capacity for the flight and a demand distribution for each class. In practice, capacity on a flight does not have to be fixed; airlines can exercise some flexibility on the supply side by swapping aircraft of different capacities between flights as partial booking information is gathered. This provides the airline with the capability to more effectively match their supply and demand. In this paper, we study the seat inventory control problem considering the aircraft swapping option. For theoretical and practical purposes, we restrict our attention to the class of booking limit policies. Our analytical results demonstrate that booking limits considering the swapping option can be considerably different from those under fixed capacity. We also show that principles on the relationship between the optimal booking limits and demand characteristics (size and risk) developed for the fixed‐capacity problem no longer hold when swapping is an option. We develop new principles and insights on how demand characteristics affect the optimal booking limits under the swapping possibility. We also develop an easy to implement heuristic for determining the booking limits under the swapping option and show, through a numerical study, that the heuristic generates revenues close to those under the optimal booking limits. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于纠缠交换的量子安全通信协议

基于纠缠交换和Einstein-Podolsky-Rosen纠缠对,提出一种量子安全直接通信协议和一种多方量子秘密共享协议。量子安全直接通信协议利用光子分组传输方法,与现有协议不同的是通信方可以直接将秘密消息编码为四个Bell态之一,从而不需要在保证量子信道的安全之后再对秘密消息编码。在多方量子秘密共享协议中,通信方以一定的概率选择检测模式和编码模式。协议的实现只需要Einstein-Podolsky-Rosen对而不需要制备多粒子纠缠态。与已有的协议相比较,该协议不需要局域幺正操作,协议的效率得到了显著提高。两个协议的安全性均等同于BBM92协议的安全性。     

A branch‐and‐cut algorithm for the nonpreemptive swapping problem

In the Swapping Problem (SP), we are given a complete graph, a set of object types, and a vehicle of unit capacity. An initial state specifies the object type currently located at each vertex (at most one type per vertex). A final state describes where these object types must be repositioned. In general, there exist several identical objects for a given object type, yielding multiple possible destinations for each object. The SP consists of finding a shortest vehicle route starting and ending at an arbitrary vertex, in such a way that each object is repositioned in its final state. This article exhibits some structural properties of optimal solutions and proposes a branch‐and‐cut algorithm based on a 0‐1 formulation of the problem. Computational results on random instances containing up to 200 vertices and eight object types are reported. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009