The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the supremum of the entropy bound with respect to all apriori distributions satisfying the constraint. We also make an extension to channels with continuous alphabet. As an application we prove the formula for the capacity of the quantum Gaussian channel with constrained energy of the signal, establishing the asymptotic equivalence of this channel to the semiclassical photon channel. We also study the lower bounds for the reliability function of the pure-state Gaussian channel.
Additivity of quantum communication channel is discussed in terms of Poisson process to show it is additive in probability. Poisson process is shown to be responsible for entanglement which is a rare event.
Quantum communication is an important branch of quantum information science, promising unconditional security to classical communication and providing the building block of a future large-scale quantum network. Noise in realistic quantum communication channels imposes fundamental limits on the communication rates of various quantum communication tasks. It is therefore crucial to identify or bound the quantum capacities of a quantum channel. Here, we consider Gaussian channels that model energy loss and thermal noise errors in realistic optical and microwave communication channels and study the…
In this paper we give several equivalent formulations of the additivity conjecture for constrained channels, which formally is substantially stronger than the unconstrained additivity. To this end a characteristic property of the optimal ensemble for such a channel is derived, generalizing the maximal distance property. It is shown that the additivity conjecture for constrained channels holds true for certain nontrivial classes of channels. Recently P. Shor showed that conjectured additivity properties for several quantum information quantities are in fact equivalent. After giving an algebraic…
In this paper we fill the gap in previous works by proving the formula for entanglement-assisted capacity of quantum channel with additive constraint (such as bosonic Gaussian channel). The main tools are the coding theorem for classical-quantum constrained channels and a finite dimensional approximation of the input density operators for entanglement-assisted capacity. The new version contains improved formulation of sufficient conditions under which suprema in the capacity formulas are attained.
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the channel. The upper bound is smaller than the capacity of the erasure channel when it is assisted by two-way classical communication. Thus, we prove the separation between quantum capacities assisted by backward classical communication and two-way classical communication.
We analyze optical binary communication assisted by entanglement and show that: i) ideal entangled channels have smaller error probability than ideal single-mode coherent channels if the photon number of the channel is larger than one; ii) realistic entangled channels with heterodyne receivers have smaller error probability than ideal single-mode coherent channels if the photon number of the channel is larger than a threshold of about five photons.
The effects of dispersion in the communication channel on the secrecy of a quantum cryptosystem based on single photon states with different frequencies are studied. A maximum communication channel length which can still ensure the secrecy of the key generation procedure is found.
We investigate multiparty communication scenarios where information is sent from several sender to several receivers. We establish a relation between the quantum capacity of multiparty communication channels and their distillability properties which enables us to show that the quantum capacity of such channels is not additive.
The achievable rate of information transfer in optical communications is determined by the physical properties of the communication channel, such as the intrinsic channel noise. Bosonic phase-noise channels, a class of non-Gaussian channels, have emerged as a relevant noise model in quantum information and optical communication. However, while the fundamental limits for communication over Gaussian channels have been extensively studied, the properties of communication over Bosonic phase-noise channels are not well understood. Here we propose and demonstrate experimentally the concept of optimi…
We consider composability of quantum channels from a limited amount of entanglement via local operations and classical communication (LOCC). We show that any $k$-partially entanglement breaking channel can be composed from an entangled state with Schmidt number of $k$ via one-way LOCC. From the entanglement assisted construction we can reach an alternative definition of partially entanglement breaking channels.
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be protected. We show theoretically that two quantum channels, each with a transmission capacity of zero, can have a nonzero capacity when used together. This unveils a rich structure in the theory of quantum communications, implying that the quantum capacity does not uniquely specify a channel's ability for transmitting quantum information.
We present a full experimental characterization of continuous variable quantum communication channels established by shared entanglement together with local operations and classical communication. The resulting teleportation channel was fully characterized by measuring all elements of the covariance matrix of the shared two-mode squeezed Gaussian state. From the experimental data we determined the lower bound to the quantum channel capacity, the teleportation fidelity of coherent states and the logarithmic negativity and the purity of the shared state. Additionally, a positive secret key rate …
International Centre for Theory of Quantum Technologies, University of Gdańsk（格但斯克大学量子技术理论国际中心）；Instituto de Física Gleb Wataghin, Universidade Estadual de Campinas（坎皮纳斯州立大学格列布·瓦塔金物理研究所）；Division of Quantum Optics and Information, Institute of Theoretical Physics and Astrophysics, Faculty of Mathematics, Physics and Informatics, University of Gdańsk（格但斯克大学数学、物理与信息学院理论物理与天体物理研究所量子光学与信息分部）
We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the classical communication assisted by non-signalling and positive-partial-transpose-preserving codes, and obtain efficiently computable one-shot bounds to assess the performance of classical communication. Second, we consider the asymptotic communication capability of communication over the QBC and QMAC. We derive an efficiently computable strong converse bound…
In this letter we propose a theoretical deterministic secure direct bidirectional quantum communication protocol by using swapping quantum entanglement and local unitary operations, in which the quantum channel for photon transmission can be discarded, hence any attack with or without eavesdropping or even the destructive attack without scruple is impossible.
The reliability function gives the rate of exponential convergence to zero of the error probability in a communication channel. In this paper bounds for the reliability function of a quantum pure state channel are given, reminiscent of the corresponding classical bounds. This in particular suggests an alternative proof of the coding theorem for quantum noiseless channel, which would make no use of the notion of typical subspace. Example of binary quantum channel is considered in some detail.
Most of the quantum secure direct communication protocol needs a pre-established secure quantum channel. Only after insuring the security of quantum channel, could the sender encode the secret message and send them to the receiver through the secure channel. In this paper, we present a quantum secure direct communication protocol using Einstein-Podolsky-Rosen pairs. It is not necessary for the present protocol to insure the security of quantum channel before transmitting the secret message. In the present protocol, all Einstein-Podolsky-Rosen pairs are used to transmit the secret message excep…
A long-standing problem on the classical capacity of bosonic Gaussian channels has recently been resolved by proving the minimum output entropy conjecture. It is also known that the ultimate capacity quantified by the Holevo bound can be achieved asymptotically by using an infinite number of channels. However, it is less understood to what extent the communication capacity can be reached if one uses a finite number of channels, which is a topic of practical importance. In this paper, we study the capacity of Gaussian communication, i.e., employing Gaussian states and Gaussian measurements to e…
We extend a recent method to detect lower bounds to the quantum capacity of quantum communication channels by considering realistic scenarios with general input probe states and arbitrary detection procedures at the output. Realistic certification relies on a new bound for the coherent information of a quantum channel that can be applied with arbitrary bipartite mixed input states and generalized output measurements.
In this article, we investigate the communication channel of fermionic system in an accelerated frame. We observe that at the infinite acceleration, the mutual information of single rail quantum channel coincides with that of double rail quantum channel, but those of classical ones reach different values. Furthermore, we find that at the infinite acceleration, the conditional entropy of single(or double) rail quantum channel vanishes, but those of classical ones may have finite values. In addition, we see that even when considering a method beyond the single mode approximation, the dual rail e…
We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the input states in optimizing the classical capacity of such a channel. Assuming a general form of an ensemble for two consecutive transmissions, we derive tight bounds on the classical channel capacity depending on whether the input states used for communication are separable or entangled across different temporal slots. This result demonstrates that by an ap…
In all practical communication channels, the code word consist of Gaussian states and the measurement strategy is often a Gaussian detector such as homodyning or heterodyning. In this paper we investigate the communication performance using a phase-conjugated alphabet and joint Gaussian detection in an phase-insensitive amplifying channel. We find that a communication scheme consisting of a phase-conjugated alphabet of coherent states and a joint detection strategy significantly outperforms a standard coherent-state strategy based in individual detection. Moreover, we show that the performance…
We propose a scheme for using a spin chain with fixed symmetry interaction as a channel for perfect quantum communication. The perfect quantum communication is determined by the eigenvalues that form a special arithmetical progression, the concrete interaction parameter $J_i$ is obtained as a function of integer and perfect transmission time $t_p$. There are infinite choices of $J_i$ for perfect transmission and one can design the channel according to the requirement of $t_p$. This scheme will provide more choices of spin chain for future experiment in quantum communication.
In quantum information systems it is of particular interest to consider the best way in which to use the non-classical resources consumed by that system. Quantum communication protocols are integral to quantum information systems and are amongst the most promising near-term applications of quantum information science. Here we show that a multiplexed, digital quantum communications system supported by comb of vacuum squeezing has a greater channel capacity per photon than a source of broadband squeezing with the same analogue bandwidth. We report on the time-resolved, simultaneous observation o…
We prove a regularized formula for the secret key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity \cite{DHW05RI}. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes private classical communication \it{without} secret key assistance as a child protocol.
Experimental observation of entropic-singularity-induced nonadditive quantum communication in a qutrit platypus channel
University of Science and Technology of China（中国科学技术大学）；CAS Center for Excellence in Quantum Information and Quantum Physics（中国科学院量子信息与量子物理前沿卓越中心）；Hefei National Laboratory（合肥国家实验室）
We show an eavesdropping scheme on Bostr\UNICODE{0xf6}m-Felbinger communication protocol (called ping-pong protocol) [Phys. Rev. Lett. 89, 187902 (2002)] in an ideal quantum channel. A measurement attack can be perfectly used to eavesdrop Alice's information instead of a most general quantum operation attack. In a noisy quantum channel, the direct communication is forbidden. We present a quantum key distribution protocol based on the ping-pong protocol, which can be used in a low noisy quantum channel. And we give a weak upper bound on the bit-error ratio that the detection probability $d$ sho…
In all lossy communication channels realized to date, information is inevitably leaked to a potential eavesdropper. Here we present a communication protocol that does not allow for any information leakage to a potential eavesdropper in a purely lossy channel. By encoding information into a restricted Gaussian alphabet of squeezed states we show, both theoretically and experimentally, that the Holevo information between the eavesdropper and the intended recipient can be exactly zero in a purely lossy channel while minimized in a noisy channel. This result is of fundamental interest, but might a…
We review a communication protocol recently proposed by us that makes use of a two-way quantum channel. We provide a characterization of such a protocol from a practical perspective, and consider the most relevant eavesdropping strategies against it. This allows us to compare its potentialities with those of a standard protocol which uses a one-way quantum channel.
An asymmetric preparation of the quantum states sent through a noisy channel can enable a new way to monitor and actively compensate the channel noise. The paradigm of such an asymmetric treatment of quantum information is the Bennett 1992 protocol, in which the ratio between conclusive and inconclusive counts is in direct connection with the channel noise. Using this protocol as a guiding example, we show how to correct the phase drift of a communication channel without using reference pulses, interruptions of the quantum transmission or public data exchanges.
Why does nature only allow nonlocal correlations up to Tsirelson's bound and not beyond? We construct a channel whose input is statistically independent of its output, but through which communication is nevertheless possible if and only if Tsirelson's bound is violated. This provides a statistical justification for Tsirelson's bound on nonlocal correlations in a bipartite setting.
The additivity of the minimal output entropy and that of the $χ$-capacity are known to be equivalent for finite-dimensional irreducibly covariant channels. In this paper we formulate a list of conditions allowing to establish similar equivalence for infinite-dimensional covariant channels with constrained input. This is then applied to Bosonic Gaussian channels with quadratic input constraint to extend the classical capacity results of the recent paper \cite{ghg} to the case where the complex structures associated with the channel and with the constraint operator need not commute. In particula…
Quantum applications transmit and receive data through quantum and classical communication channels. Channel capacity, the distance and the photon path between transmitting and receiving parties and the speed of the computation links play an essential role in timely synchronization and delivery of information using classical and quantum channels. In this study, we analyze and optimize the parameters of the communication channels needed for the quantum application to successfully operate. We also develop algorithms for synchronizing data delivery on classical and quantum channels.
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. In this paper, we present a procedure for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate this procedure by evaluating …
The channels, and more generally superoperators acting on the trace class operators of a quantum system naturally form a Banach space under the completely bounded trace norm (aka diamond norm). However, it is well-known that in infinite dimension, the norm topology is often "too strong" for reasonable applications. Here, we explore a recently introduced energy-constrained diamond norm on superoperators (subject to an energy bound on the input states). Our main motivation is the continuity of capacities and other entropic quantities of quantum channels, but we also present an application to the…
We consider energy-constrained infinite-dimensional quantum channels from a given system (satisfying a certain condition) to any other systems. We show that dealing with basic capacities of these channels we may assume (accepting arbitrarily small error $\varepsilon$) that all channels have the same finite-dimensional input space -- the subspace corresponding to the $m(\varepsilon)$ minimal eigenvalues of the input Hamiltonian. We also show that for the class of energy-limited channels (mapping energy-bounded states to energy-bounded states) the above result is valid with substantially smaller…
We study the activated quantum no-signalling-assisted zero-error classical capacity by first allowing the assistance from some noiseless forward communication channel and later paying back the cost of the helper. This activated communication model considers the additional forward noiseless channel as a catalyst for communication. First, we show that the one-shot activated capacity can be formulated as a semidefinite program and we derive a number of striking properties of this capacity. We further present a sufficient condition under which a noisy channel can be activated. Second, we show that…
With the rapid growth of quantum technologies, knowing the fundamental characteristics of quantum systems and protocols is essential for their effective implementation. A particular communication setting that has received increased focus is related to quantum key distribution and distributed quantum computation. In this setting, a quantum channel connects a sender to a receiver, and their goal is to distill either a secret key or entanglement, along with the help of arbitrary local operations and classical communication (LOCC). In this work, we establish a general theory of energy-constrained,…
We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given `amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with `the same amount' of noise. Classical simulations of general probabilistic channels are also studied.
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It establishes a limit on the power of quantum communication in terms of classical resources. We show that classical simulations employing a finite amount of communication can be derived from a special class of hidden variable theories where quantum states represent statistical knowledge about the classical state and not an element of reality. This special class has att…
We consider three different communication tasks for quantum broadcast channels, and we determine the capacity region of a Hadamard broadcast channel for these various tasks. We define a Hadamard broadcast channel to be such that the channel from the sender to one of the receivers is entanglement-breaking and the channel from the sender to the other receiver is complementary to this one. As such, this channel is a quantum generalization of a degraded broadcast channel, which is well known in classical information theory. The first communication task we consider is classical communication to bot…
As with classical information, error-correcting codes enable reliable transmission of quantum information through noisy or lossy channels. In contrast to the classical theory, imperfect quantum channels exhibit a strong kind of synergy: there exist pairs of discrete memoryless quantum channels, each of zero quantum capacity, which acquire positive quantum capacity when used together. Here we show that this "superactivation" phenomenon also occurs in the more realistic setting of optical channels with attenuation and Gaussian noise. This paves the way for its experimental realization and applic…
