Quantum Pseudo-Telepathy

Quantum information processing is at the crossroads of physics, mathematics and computer science. It is concerned with what we can and cannot do with quantum information that goes beyond the abilities of classical information processing devices. Communication complexity is an area of classical computer science that aims at quantifying the amount of communication necessary to solve distributed computational problems. Quantum communication complexity uses quantum mechanics to reduce the amount of communication that would be classically required. Pseudo-telepathy is a surprising application of quantum information processing to communication complexity. Thanks to entanglement, perhaps the most nonclassical manifestation of quantum mechanics, two or more quantum players can accomplish a distributed task with no need for communication whatsoever, which would be an impossible feat for classical players. After a detailed overview of the principle and purpose of pseudo-telepathy, we present a survey of recent and not-so-recent work on the subject. In particular, we describe and analyse all the pseudo-telepathy games currently known to the authors. Supported in Part by Canada’s Natural Sciences and Engineering Research Council (NSERC), the Canada Research Chair programme and the Canadian Institute for Advanced Research (CIAR). Supported in part by a scholarship from Canada’s NSERC. Supported in part by Canada’s NSERC Québec’s Fonds de recherche sur la nature et les technologies (FQRNT), the CIAR and the Mathematics of Information Technology and Complex Systems Network (MITACS).     

Degradation of Grover’s search under collective phase flips in queries to the oracle

We address the case in which querying the oracle in Grover’s algorithm is exposed to noise including phase distortions. The oracle-box wires can be altered by an opposing party that tries to prevent reception of correct data from the oracle. This situation reflects an experienced truth that any access to prophetic knowledge cannot be common and direct. To study this problem, we introduce a simple model of collective phase distortions on the basis of a phase-damping channel. In the model, the probability of success is not altered via the oracle-box wires per se. Phase distortions of the considered type can hardly be detected via any one-time query to the oracle. However, the probability of success is significantly changed when such errors are introduced as an intermediate step in the Grover iteration. We investigate the probability of success with respect to variations of the parameter that characterizes the amount of phase errors. It turns out that the probability of success decreases significantly even if the error is not very high. Moreover, this probability quickly reduces to the value of one half, which corresponds to the completely mixed state. We also study trade-off relations between quantum coherence and the probability of success in the presence of noise of the considered type.     

三粒子GHZ态的量子信息分离方案(英文)

提出一个用GHZ态作为量子信道分离类GHZ态的方案.如果发送者Alice预先知道原量子态,Alice执行两量子比特投影测量后,接收者Bob和Charlie一起合作能恢复初态.我们计算了这个方案成功的几率和消耗的经典信息.一般地,Alice能成功地分离量子态的几率是1/4和消耗的经典信息是3/4经典比特.然而,在五种特殊情形下,消耗一些多余经典信息后,成功的几率能达到1/2甚至1.     

基于光量子态避错及容错传输的量子通信

量子通信以量子态为信息载体在远距离的通信各方之间传递信息,因此量子态的传输和远距离共享是量子通信的首要步骤.信道噪声不仅会影响通信效率还可能被窃听者利用从而威胁通信安全,对抗信道噪声是实现安全高效量子通信亟需解决的问题.本文介绍基于光量子态的两类对抗信道噪声的实用方法——量子态的避错传输和容错的量子通信,包括对抗噪声的基本原理和两种方法的代表性方案,并从资源消耗和可操作性的角度分析了方案的实用价值.     

量子通信

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

Simplification of the Gram Matrix Eigenvalue Problem for Quadrature Amplitude Modulation Signals

In quantum information science, it is very important to solve the eigenvalue problem of the Gram matrix for quantum signals. This allows various quantities to be calculated, such as the error probability, mutual information, channel capacity, and the upper and lower bounds of the reliability function. Solving the eigenvalue problem also provides a matrix representation of quantum signals, which is useful for simulating quantum systems. In the case of symmetric signals, analytic solutions to the eigenvalue problem of the Gram matrix have been obtained, and efficient computations are possible. However, for asymmetric signals, there is no analytic solution and universal numerical algorithms that must be used, rendering the computations inefficient. Recently, we have shown that, for asymmetric signals such as amplitude-shift keying coherent-state signals, the Gram matrix eigenvalue problem can be simplified by exploiting its partial symmetry. In this paper, we clarify a method for simplifying the eigenvalue problem of the Gram matrix for quadrature amplitude modulation (QAM) signals, which are extremely important for applications in quantum communication and quantum ciphers. The results presented in this paper are applicable to ordinary QAM signals as well as modified QAM signals, which enhance the security of quantum cryptography.     

Hyperentanglement-assisted hyperdistillation for hyper-encoding photon system

In quantum information processing, the quality of photon system is decreased by the inevitable interaction with environment, which will greatly reduce the efficiency and security of quantum information processing. In this paper, we propose hyperentanglement-assisted hyperdistillation schemes to guarantee the quality of hyper-encoding photon system based on the method of quantum hyper-teleportation, which can increase the success probability of hyperdistillation and reduce the resource consumption. First, we propose a hyperentanglement-assisted single-photon hyperdistillation (HASPHD) scheme for polarization and spatial qubits to get rid of the vacuum state component caused by transmission loss, whose success probability can achieve the optimal one by increasing the efficiency of quantum hyper-teleportation. Subsequently, we present two hyperentanglement-assisted hyperentanglement distillation (HAHED) schemes for photon system to protect hyperentanglement from both transmission loss and quantum channel noise, which can recover the less-entangled mixed state to maximally hyperentangled state for known-parameter and unknown-parameter cases with high success probability and low resource consumption. In these hyperdistillation schemes, the influence of imperfect effects of optical elements can be largely decreased by the quantum hyper-teleportation method. These characters make the hyperentanglement-assisted hyperdistillation schemes have potential application prospects in practical quantum information processing.     

Ambiguous Discrimination of General Quantum Operations

We consider the problem of discriminating general quantum operations. Using the definition of mapping operator to vector, and by some calculating skills, we derive an explicit formulation as a new bound on the minimum-error probability for ambiguous discrimination between arbitrary m quantum operations. This formulation consists only of Kraus-operators, the dimension, and the priori probabilities of the discriminated quantum operations, and is independent of input states. To some extent, we further generalize the bounds on the minimum-error probability for discriminating mixed states to quantum operations.     

How far can one send a photon?

The answer to the question How far can one send a photon? depends heavily on what one means by a photon and on what one intends to do with that photon. For direct quantum communication, the limit is approximately 500 km. For terrestrial quantum communication, near-future technologies based on quantum teleportation and quantum memories will soon enable quantum repeaters that will turn the development of a world-wide-quantum-web (WWQW) into a highly non-trivial engineering problem. For Device-Independent Quantum Information Processing, near-future qubit amplifiers (i.e., probabilistic heralded amplification of the probability amplitude of the presence of photonic qubits) will soon allow demonstrations over a few tens of kilometers.     

Optimizing linear optics quantum gates

In this Letter, the problem of finding optimal success probabilities of linear optics quantum gates is linked to the theory of convex optimization. It is shown that by exploiting this link, upper bounds for the success probability of networks realizing single-mode gates can be derived, which hold in generality for postselected networks of arbitrary size, any number of auxiliary modes, and arbitrary photon numbers. As a corollary, the previously formulated conjecture is proven that the optimal success probability of a nonlinear sign shift without feedforward is 1/4, a gate playing the central role in the scheme of Knill-Laflamme-Milburn for quantum computation. The concept of Lagrange duality is shown to be applicable to provide rigorous proofs for such bounds, although the original problem is a difficult nonconvex problem in infinitely many objective variables. The versatility of this approach is demonstrated.     

Optimal multi-photon entanglement concentration with the photonic Faraday rotation

We put forward an optimal entanglement concentration protocol(ECP) for recovering an arbitrary less-entangled multi-photon Greenberger–Horne–Zeilinger(GHZ) state into the maximally entangled GHZ state based on the photonic Faraday rotation in low-quality(Q) cavity. In the ECP, only one pair of less-entangled multi-photon GHZ state and one auxiliary photon are required, and the concentration task can be realized by local operations. Moreover, our ECP can be used repeatedly to further concentrate the discarded items of conventional ECPs, which can increase its success probability largely. Under the practical imperfect detection condition, our protocol can still work with relatively high success probability. This ECP has application potential in current and future quantum communication.     

Gaussian Amplitude Amplification for Quantum Pathfinding

We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding the minimum or maximum solutions on a weighted directed graph. We focus on the geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by Gaussian distributions. We then demonstrate how an oracle that encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases that are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.     

Quantum broadcast communication

Broadcast encryption allows the sender to securely distribute his/her secret to a dynamically changing group of users over a broadcast channel. In this paper, we just take account of a simple broadcast communication task in quantum scenario, in which the central party broadcasts his secret to multi-receiver via quantum channel. We present three quantum broadcast communication schemes. The first scheme utilizes entanglement swapping and Greenberger--Horne--Zeilinger state to fulfil a task that the central party broadcasts the secret to a group of receivers who share a group key with him. In the second scheme, based on dense coding, the central party broadcasts the secret to multi-receiver, each of which shares an authentication key with him. The third scheme is a quantum broadcast communication scheme with quantum encryption, in which the central party can broadcast the secret to any subset of the legal receivers.     

Heat Transport in Harmonic Lattices

We work out the non-equilibrium steady state properties of a harmonic lattice which is connected to heat reservoirs at different temperatures. The heat reservoirs are themselves modeled as harmonic systems. Our approach is to write quantum Langevin equations for the system and solve these to obtain steady state properties such as currents and other second moments involving the position and momentum operators. The resulting expressions will be seen to be similar in form to results obtained for electronic transport using the non-equilibrium Green’s function formalism. As an application of the formalism we discuss heat conduction in a harmonic chain connected to self-consistent reservoirs. We obtain a temperature dependent thermal conductivity which, in the high-temperature classical limit, reproduces the exact result on this model obtained recently by Bonetto, Lebowitz and Lukkarinen.     

A one-dimension convolutional neural network based interference classification method

Interference is a common problem in wireless communication, navigation and radar systems. A wide variety of interferences are used to degrade the communication quality especially in electronic warfare environment. In modern military communication systems, interference classification is an important module for its ability to obtain prior interference information before adopting related anti-interference method. This paper proposes a deep learning based interference classification method, which applies one-dimension convolutional neural networks to automatically extract interference features for classification. Computer simulations show better classification performance and lower computational complexity. Meanwhile, this proposed method is implied on software defined radios (SDR) hardware, more than 99% correct classification probability can be achieved with limited samples of the received signal, which verifies the robustness of this proposed method.     

Bell’s Theorem without Inequalities and without Unspeakable Information

A proof of Bell’s theorem without inequalities is presented in which distant local setups do not need to be aligned, since the required perfect correlations are achieved for any local rotation of the local setups.     

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

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

Hybrid entanglement concentration assisted with single coherent state

Hybrid entangled state(HES) is a new type of entanglement, which combines the advantages of an entangled polarization state and an entangled coherent state. HES is widely discussed in the applications of quantum communication and computation. In this paper, we propose three entanglement concentration protocols(ECPs) for Bell-type HES, W-type HES, and cluster-type HES, respectively. After performing these ECPs, we can obtain the maximally entangled HES with some success probability. All the ECPs exploit the single coherent state to complete the concentration. These protocols are based on the linear optics, which are feasible in future experiments.     

Advantage of Quantum Theory over Nonclassical Models of Communication

Quantum correlations provide dramatic advantage over the corresponding classical resources in several communication tasks. However, a broad class of probabilistic theories exists that attributes greater success than quantum theory in many of these tasks by allowing supra-quantum correlations in “space-like” and/or “time-like” paradigms. In this letter, a communication task involving three spatially separated parties is proposed where one party (verifier) aims to verify whether the bit strings possessed by the other two parties (terminals) are equal or not. This task is called authentication with limited communication, the restrictions on communication being: i) the terminals cannot communicate with each other, but (ii) each of them can communicate with the verifier through single use of channels with limited capacity. Manifestly, classical resources are not sufficient for perfect success of this task. Moreover, it is also not possible to perform this task with certainty in several nonclassical theories although they might possess stronger “space-like” and/or “time-like” correlations. Surprisingly, quantum resources can achieve the perfect winning strategy. The proposed task thus stands apart from all previously known communication tasks as it exhibits quantum advantage over other nonclassical strategies.     

Efficient electronic entanglement concentration assisted by single mobile electrons

We present an efficient entanglement concentration protocol （ECP） for mobile electrons with charge detection. This protocol is quite different from other ECPs for one can obtain a maximally entangled pair from a pair of less-entangled state and a single mobile electron with a certain probability. With the help of charge detection, it can be repeated to reach a higher success probability. It also does not need to know the coefficient of the original less-entangled states. All these advantages may make this protocol useful in current distributed quantum information processing.