Quantum nonlocality and beyond: limits from nonlocal computation

We address the problem of "nonlocal computation," in which separated parties must compute a function without any individual learning anything about the inputs. Surprisingly, entanglement provides no benefit over local classical strategies for such tasks, yet stronger nonlocal correlations allow perfect success. This provides intriguing insights into the limits of quantum information processing, the nature of quantum nonlocality, and the differences between quantum and stronger-than-quantum nonlocal correlations.     

Enhancing robustness of multiparty quantum correlations using weak measurement

Multipartite quantum correlations are important resources for the development of quantum information and computation protocols. However, the resourcefulness of multipartite quantum correlations in practical settings is limited by its fragility under decoherence due to environmental interactions. Though there exist protocols to protect bipartite entanglement under decoherence, the implementation of such protocols for multipartite quantum correlations has not been sufficiently explored. Here, we study the effect of local amplitude damping channel on the generalized Greenberger–Horne–Zeilinger state, and use a protocol of optimal reversal quantum weak measurement to protect the multipartite quantum correlations. We observe that the weak measurement reversal protocol enhances the robustness of multipartite quantum correlations. Further it increases the critical damping value that corresponds to entanglement sudden death. To emphasize the efficacy of the technique in protection of multipartite quantum correlation, we investigate two proximately related quantum communication tasks, namely, quantum teleportation in a one sender, many receivers setting and multiparty quantum information splitting, through a local amplitude damping channel. We observe an increase in the average fidelity of both the quantum communication tasks under the weak measurement reversal protocol. The method may prove beneficial, for combating external interactions, in other quantum information tasks using multipartite resources.     

Quantum particles from classical statistics

Quantum particles and classical particles are described in a common setting of classical statistical physics. The property of a particle being “classical” or “quantum” ceases to be a basic conceptual difference. The dynamics differs, however, between quantum and classical particles. We describe position, motion and correlations of a quantum particle in terms of observables in a classical statistical ensemble. On the other side, we also construct explicitly the quantum formalism with wave function and Hamiltonian for classical particles. For a suitable time evolution of the classical probabilities and a suitable choice of observables all features of a quantum particle in a potential can be derived from classical statistics, including interference and tunneling. Besides conceptual advances, the treatment of classical and quantum particles in a common formalism could lead to interesting cross‐fertilization between classical statistics and quantum physics.     

Protecting Quantum Fisher Information in Correlated Quantum Channels

Quantum Fisher information (QFI) has potential applications in quantum metrology tasks. QFI is investigated when the consecutive actions of a quantum channel on the sequence of qubits have partial classical correlations. The results showed that while the decoherence effect is detrimental to QFI, effects of such classical correlations on QFI are channel-dependent. For the Bell-type probe states, the classical correlations on consecutive actions of the depolarizing and phase flip channels can be harnessed to improve QFI, while the classical correlations in the bit flip and bit-phase flip channels induce a slight decrease of QFI. For a more general parameterization form of the probe states, the advantage of using the initial correlated system on improving QFI can also remain in a wide regime of the correlated quantum channels.     

Experimental observation of impossible-to-beat quantum advantage on a hybrid photonic system

Quantum resources outperform classical ones for certain communication and computational tasks. Remarkably, in some cases, the quantum advantage cannot be improved using hypothetical postquantum resources. A class of tasks with this property can be singled out using graph theory. Here we report the experimental observation of an impossible-to-beat quantum advantage on a four-dimensional quantum system defined by the polarization and orbital angular momentum of a single photon. The results show pristine evidence of the quantum advantage and are compatible with the maximum advantage allowed using postquantum resources.     

基于量子隐形传态的量子保密通信方案

量子保密通信包括量子密钥分发、量子安全直接通信和量子秘密共享等主要形式.在量子密钥分发和秘密共享中,传输的是随机数而不是信息,要再经过一次经典通信才能完成信息的传输.在量子信道直接传输信息的量子通信形式是量子安全直接通信.基于量子隐形传态的量子通信(简称量子隐形传态通信)是否属于量子安全直接通信尚需解释.构造了一个量子隐形传态通信方案,给出了具体的操作步骤.与一般的量子隐形传态不同,量子隐形传态通信所传输的量子态是计算基矢态,大大简化了贝尔基测量和单粒子操作.分析结果表明,量子隐形传态通信等价于包含了全用型量子密钥分发和经典通信的复合过程,不是量子安全直接通信,其传输受到中间介质和距离的影响,所以不比量子密钥分发更有优势.将该方案与量子密钥分发、量子安全直接通信和经典一次性便笺密码方案进行对比,通过几个通信参数的比较给出各个方案的特点,还特别讨论了各方案在空间量子通信方面的特点.     

Bell inequalities with auxiliary communication

What is the communication cost of simulating the correlations produced by quantum theory? We generalize Bell inequalities to the setting of local realistic theories augmented by a fixed amount of classical communication. Suppose two parties choose one of M two-outcome measurements and exchange 1 bit of information. We present the complete set of inequalities for M=2, and the complete set of inequalities for the joint correlation observable for M=3. We find that correlations produced by quantum theory satisfy both of these sets of inequalities. One bit of communication is therefore sufficient to simulate quantum correlations in both of these scenarios.     

Demonstration of fully-connected quantum communication network exploiting entangled sideband modes

Quantum communication network scales point-to-point quantum communication protocols to more than two detached parties, which would permit a wide variety of quantum communication applications. Here, we demonstrate a fully-connected quantum communication network, exploiting three pairs of Einstein−Podolsky−Rosen (EPR) entangled sideband modes, with high degree entanglement of 8.0 dB, 7.6 dB, and 7.2 dB. Each sideband modes from a squeezed field are spatially separated by demultiplexing operation, then recombining into new group according to network requirement. Each group of sideband modes are distributed to one of the parties via a single physical path, making sure each pair of parties build their own private communication links with high channel capacity better than any classical scheme.     

Combinatorics and quantum nonlocality

We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of superluminal communication) for being able to reproduce the quantum correlations occurring in Einstein-Podolsky-Rosen-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a Greenberger-Horne-Zeilinger-type state and show that the amount of superluminal classical communication required to reproduce the correlations is at least n(log((2)n-3) bits and the maximum detector efficiency eta(*) for which the resulting correlations can still be reproduced by a local hidden-variable theory is upper bounded by eta(*)相似文献   

Provably secure experimental quantum bit-string generation

Coin tossing is a cryptographic task in which two parties who do not trust each other aim to generate a common random bit. Using classical communication this is impossible, but nontrivial coin tossing is possible using quantum communication. Here we consider the case when the parties do not want to toss a single coin, but many. This is called bit-string generation. We report the experimental generation of strings of coins which are provably more random than achievable using classical communication. The experiment is based on the "plug and play" scheme developed for quantum cryptography, and therefore well suited for long distance quantum communication.     

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.     

Are there phase transitions in information space?

The interplay between two basic quantities--quantum communication and information--is investigated. Quantum communication is an important resource for quantum states shared by two parties and is directly related to entanglement. Recently, the amount of local information that can be drawn from a state has been shown to be closely related to the nonlocal properties of the state. Here we consider both formation and extraction processes, and analyze informational resources as a function of quantum communication. The resulting diagrams in information space allow us to observe phaselike transitions when correlations become classical.     

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.     

量子通信

量子通信是经典通信和量子力学相结合的一门新兴交叉学科。文章综述了量子通信领域的研究进展，既包括人们所熟知的量子隐形传态、密集编码和量子密码学，也包括刚刚兴起但却有巨大潜力的量子通信复杂度和远程量子通信等领域。文章介绍了量子通信的基本理论框架，同时也涉及了这个领域最新的实验研究的进展。     

Quantum secure direct communication and deterministic secure quantum communication

In this review article, we review the recent development of quantum secure direct communication (QSDC) and deterministic secure quantum communication (DSQC) which both are used to transmit secret message, including the criteria for QSDC, some interesting QSDC protocols, the DSQC protocols and QSDC network, etc. The difference between these two branches of quantum communication is that DSQC requires the two parties exchange at least one bit of classical information for reading out the message in each qubit, and QSDC does not. They are attractive because they are deterministic, in particular, the QSDC protocol is fully quantum mechanical. With sophisticated quantum technology in the future, the QSDC may become more and more popular. For ensuring the safety of QSDC with single photons and quantum information sharing of single qubit in a noisy channel, a quantum privacy amplification protocol has been proposed. It involves very simple CHC operations and reduces the information leakage to a negligible small level. Moreover, with the one-party quantum error correction, a relation has been established between classical linear codes and quantum one-party codes, hence it is convenient to transfer many good classical error correction codes to the quantum world. The one-party quantum error correction codes are especially designed for quantum dense coding and related QSDC protocols based on dense coding.      

Quantum secure direct communication with quantum encryption based on pure entangled states

This paper presents a scheme for quantum secure direct communication with quantum encryption. The two authorized users use repeatedly a sequence of the pure entangled pairs (quantum key) shared for encrypting and decrypting the secret message carried by the travelling photons directly. For checking eavesdropping, the two parties perform the single-photon measurements on some decoy particles before each round. This scheme has the advantage that the pure entangled quantum signal source is feasible at present and any eavesdropper cannot steal the message.     

Bell inequalities with no quantum violation and unextendable product bases

The strength of classical correlations is subject to certain constraints, commonly known as Bell inequalities. Violation of these inequalities is the manifestation of nonlocality-displayed, in particular, by quantum mechanics, meaning that quantum mechanics can outperform classical physics at tasks associated with such Bell inequalities. Interestingly, however, there exist situations in which this is not the case. We associate an intriguing class of bound entangled states, constructed from unextendable product bases with a wide family of tasks, for which (i) quantum correlations do not outperform the classical ones but (ii) there exist supraquantum nonsignaling correlations that do provide an advantage.     

量子直接通信

量子直接通信是量子通信中的一个重要分支, 它是一种不需要事先建立密钥而直接传输机密信息的新型通信模式. 本综述将介绍量子直接通信的基本原理, 回顾量子直接通信的发展历程, 从最早的高效量子直接通信协议、两步量子直接通信模型、量子一次一密直接通信模型等, 到抗噪声的量子直接通信模型以及基于单光子多自由度量子态及超纠缠态的量子直接通信模型, 最后介绍量子直接通信的研究现状并展望其发展未来.     

Communication Complexity as a Principle of Quantum Mechanics

We introduce a two-party communication complexity problem in which the probability of success by using a particular strategy allows the parties to detect with certainty whether or not some forbidden communication has taken place. We show that theprobability of success is bounded by nature; any conceivable method which gives a probability of success outside these bounds is impossible. Moreover, any conceivable method to solve the problem which gives a probability success within these bounds is possible in nature. This example suggests that a suitaby chosen set of communication complexity problems could be the basis of an information-theoretic axiomatization of quantum mechanics.