Controlled Simultaneous Teleportation and Dense Coding

We propose a teleportation protocol and a dense coding protocol. In these protocols, one sender intends to send quantum states or classical bits to two receivers through two GHZ entanglement channels. The entanglement channels are locked by the sender and the communication process is supervised by a controller. In order to obtain the messages, the receivers need the controller’s permission, and must collaborate to unlock the entanglement channels.     

Quantum one-time pad in the presence of an eavesdropper

A classical one-time pad allows two parties to send private messages over a public classical channel-an eavesdropper who intercepts the communication learns nothing about the message. A quantum one-time pad is a shared quantum state which allows two parties to send private messages or private quantum states over a public quantum channel. If the eavesdropper intercepts the quantum communication she learns nothing about the message. In the classical case, a one-time pad can be created using shared and partially private correlations. Here we consider the quantum case in the presence of an eavesdropper, and find the single-letter formula for the rate at which the two parties can send messages using a general quantum state as a quantum one-time pad. Surprisingly, the formula coincides with the distillable entanglement assisted by a symmetric channel, an important quantity in quantum information theory, but which lacked a clear operational meaning.     

Quantum Capacity under Adversarial Quantum Noise: Arbitrarily Varying Quantum Channels

We investigate entanglement transmission over an unknown channel in the presence of a third party (called the adversary), which is enabled to choose the channel from a given set of memoryless but non-stationary channels without informing the legitimate sender and receiver about the particular choice that he made. This channel model is called an arbitrarily varying quantum channel (AVQC). We derive a quantum version of Ahlswede’s dichotomy for classical arbitrarily varying channels. This includes a regularized formula for the common randomness-assisted capacity for entanglement transmission of an AVQC. Quite surprisingly and in contrast to the classical analog of the problem involving the maximal and average error probability, we find that the capacity for entanglement transmission of an AVQC always equals its strong subspace transmission capacity. These results are accompanied by different notions of symmetrizability (zero-capacity conditions) as well as by conditions for an AVQC to have a capacity described by a single-letter formula. In the final part of the paper the capacity of the erasure-AVQC is computed and some light shed on the connection between AVQCs and zero-error capacities. Additionally, we show by entirely elementary and operational arguments motivated by the theory of AVQCs that the quantum, classical, and entanglement-assisted zero-error capacities of quantum channels are generically zero and are discontinuous at every positivity point.     

Local distinguishability of multipartite unitary operations

We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguished by local operations and classical communication when a finite number of runs is allowed. Intuitively, this result indicates that the lost identity of a nonlocal unitary operation can be recovered locally. No entanglement between distant parties is required.     

Coherent communication of classical messages

We define coherent communication in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory. Using coherent communication, we are able to generalize superdense coding to prepare arbitrary quantum states instead of only classical messages. We also derive single-letter formulas for the classical and quantum capacities of a bipartite unitary gate assisted by an arbitrary fixed amount of entanglement per use.     

Entanglement can Increase Asymptotic Rates of Zero-Error Classical Communication over Classical Channels

It is known that the number of different classical messages which can be communicated with a single use of a classical channel with zero probability of decoding error can sometimes be increased by using entanglement shared between sender and receiver. It has been an open question to determine whether entanglement can ever increase the zero-error communication rates achievable in the limit of many channel uses. In this paper we show, by explicit examples, that entanglement can indeed increase asymptotic zero-error capacity, even to the extent that it is equal to the normal capacity of the channel.     

Substituting a qubit for an arbitrarily large number of classical bits

We show that a qubit can be used to substitute for a classical analog system requiring an arbitrarily large number of classical bits to represent digitally. Let a physical system S interact locally with a classical field varphi(x) as S travels directly from point A to point B. Our task is to use S to answer a simple yes/no question about varphi(x). If S is a qubit, the task can be done perfectly. We show that any classical system S must encode an arbitrarily large number of classical bits to solve the same task. This result implies a large quantum advantage in the memory size necessary for some computations. We also show that no finite amount of one-way classical communication can perfectly simulate the effect of quantum entanglement.     

基于单光子双量子态的确定性安全量子通信

量子通信是量子科学技术的一个重要研究领域,是一种利用量子力学原理,能够在合法各方之间安全地传输私密信息的通信方式.基于单光子的确定性安全量子通信通常需要在发送方和接收方之间来回两次传输单光子态,并利用局域幺正变换加载信息.本文提出了一种单向传输单光子态的确定性安全量子通信方案.发送方利用单光子的极化和time-bin两自由度构成的两组共轭基矢量来编码经典逻辑比特.接收方通过设计合适的测量装置可以在发送方辅助下确定性地获取比特信息并感知窃听,从而实现信息的确定性安全传输.另外,我们的协议使用线性光学元件和单光子探测器,可以在当前的量子通信装置上实现.     

Oblivious remote state preparation

We characterize the class of remote state preparation (RSP) protocols that use only forward classical communication and entanglement, deterministically prepare an exact copy of a general state, and do so obliviously-without leaking further information about the state to the receiver. We prove that any such protocol can be modified to require from the sender only a single specimen of the state, without increasing the classical communication cost. This implies Lo's conjectured lower bound on the cost for these protocols. We relate our RSP protocols to the private quantum channels and establish a one-to-one correspondence between them.     

The Quantum Reverse Shannon Theorem Based on One-Shot Information Theory

The Quantum Reverse Shannon Theorem states that any quantum channel can be simulated by an unlimited amount of shared entanglement and an amount of classical communication equal to the channel’s entanglement assisted classical capacity. In this paper, we provide a new proof of this theorem, which has previously been proved by Bennett, Devetak, Harrow, Shor, and Winter. Our proof has a clear structure being based on two recent information-theoretic results: one-shot Quantum State Merging and the Post-Selection Technique for quantum channels.     

Quantum Communication Complexity

Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In some cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an exponentially larger number of bits. In a similar vein, can entanglement be used to save on classical communication? It is well known that entanglement on its own is useless for the transmission of information. Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement. This leads to the question of how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement.     

一种基于分层的量子分组传输方案及性能分析

大规模量子通信网络中,采用量子分组传输技术能有效提升发送节点的吞吐量,提高网络中链路的利用率,增强通信的抗干扰性能.然而量子分组的快速传输与路由器性能息息相关.路由器性能瓶颈将严重影响网络的可扩展性和链路的传输效率.本文提出一种量子通信网络分层结构,并根据量子密集编码和量子隐形传态理论,给出一种基于分层的量子分组信息传输方案,实现端到端的量子信息传输.该方案先将量子分组按照目的地址进行聚类,再按聚类后的地址进行传输.仿真结果表明,基于分层的量子分组信息传输方案能够有效减少量子分组信息在量子通信网络中的传输时间,并且所减少的时间与量子路由器性能与发送的量子分组数量有关.因此,本文提出的量子分组信息传输方案适用于大规模量子通信网络的构建.     

Three-Party Quantum Network Communication Protocols Based on Quantum Teleportation

By utilizing the delocalized correlation of entangled states in quantum information theory, a novel method on acknowledgments of quantum information among three-party is presented, and then two three-party quantum network communication protocols based on quantum teleportation are presented, namely, three-party stop-wait quantum communication protocol and three-party selective automatic repeat quantum communication protocol. In the two proposed protocols, the data frames composed of qubits are teleported via three-party quantum teleportation, the two receivers simultaneously receive quantum frames from the sender, and then return quantum acknowledgment frames or quantum negative acknowledgment frames via quantum entanglement channels. The sender simultaneously receives and deals with quantum acknowledgment frames and quantum negative acknowledgment frames from the two receivers, thus the processing delay on returning quantum frames is reduced. And due to the transience of transferring quantum information, the returning of quantum acknowledgment frames and quantum negative acknowledgment frames are completed instantaneously, the proposed protocols reduce the transmission delay and improve the communication efficiency. During the whole course of communications, the classical channels are only used to transmit the measurement message, so the burdens of classical channels are reduced.     

Quantum Private Communication with an Anonymous Sender

We propose a new quantum private communication protocol, in which the anonymity of the sender and the privacy of the quantum information are perfectly protected except with exponentially small probability. Furthermore, this protocol uses single particles to construct anonymous entanglement instead of multipartite entangled states, and thus it reduces quantum resources compared with the previous work.     

Remote state preparation

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.     

Perfect quantum teleportation and dense coding protocols via the 2N-qubit W state

In this paper, we investigate perfect quantum teleportation and dense coding by using an 2N-qubit W state channel. In the quantum teleportation scheme, an unknown N-qubit entangled state can be perfectly teleported. One ebit of entanglement and two bits of classical communication are consumed in the teleportation process, just like when using the Bell state channel. While N+1 bits of classical information can be transmitted by only sending N particles in the dense coding protocol.     

A Reversible Theory of Entanglement and its Relation to the Second Law

We consider the manipulation of multipartite entangled states in the limit of many copies under quantum operations that asymptotically cannot generate entanglement. In stark contrast to the manipulation of entanglement under local operations and classical communication, the entanglement shared by two or more parties can be reversibly interconverted in this setting. The unique entanglement measure is identified as the regularized relative entropy of entanglement, which is shown to be equal to a regularized and smoothed version of the logarithmic robustness of entanglement. Here we give a rigorous proof of this result, which is fundamentally based on a certain recent extension of quantum Stein’s Lemma, giving the best measurement strategy for discriminating several copies of an entangled state from an arbitrary sequence of non-entangled states, with an optimal distinguishability rate equal to the regularized relative entropy of entanglement. We moreover analyse the connection of our approach to axiomatic formulations of the second law of thermodynamics.     

Some New Solutions of Jacobi Elliptic Functions to mBBM Equation

The modified mapping method is further improved by the expanded expression of u（ξ） that contains the terms of the first-order derivative of function f（ξ）. Some new exact solutions to the mBBM equation are determined by means of the method. We can obtain many new solutions in terms of the Jacobi elliptic functions of the equation.     

一种基于纠缠态的量子中继通信系统

提出了一种基于纠缠态的量子中继通信系统,该系统应用纠缠为基本资源.纠缠为量子隐形传态和绝对安全的量子通信提供了保证.量子中继器用来延长高纠缠度的纠缠光子对的纠缠距离,利用纠缠交换和纠缠纯化在系统的发信者与受信者之间建立光子对的纠缠.应用量子隐形传态的原理传输量子信息.系统分析表明,量子通信系统的吞吐率随着通信双方成功建立纠缠的概率增大而显著增加,量子信号的传输距离取决于量子中继节点的级数.     

Usefulness of multiqubit W-type states in quantum information processing

We analyze the efficiency of multiqubit W-type states as resources for quantum information. For this, we identify and generalize four-qubit W-type states. Our results show that these states can be used as resources for deterministic quantum information processing. The utility of results, however, is limited by the availability of experimental setups to perform and distinguish multiqubit measurements. We therefore emphasize protocols where two users want to establish an optimal bipartite entanglement using the partially entangled W-type states. We find that for such practical purposes, four-qubit W-type states can be a better resource in comparison to three-qubit W-type states. For a dense coding protocol, our states can be used deterministically to send two bits of classical message by locally manipulating a single qubit. In addition, we also propose a realistic experimental method to prepare the four-qubit W-type states using standard unitary operations and weak measurements.