In a well-known result [Werner2001], Werner classified all tight quantum teleportation and dense coding schemes, showing that they correspond to unitary error bases. Here tightness is a certain dimensional restriction: the quantum system to be teleported and the entangled resource must be of dimension d, and the measurement must have d^2 outcomes.
In this work we generalise this classification so as to remove the dimensional restriction altogether, thereby resolving an open problem raised in that work. In fact, we classify not just teleportation and dense coding schemes, but entanglement-reversible channels. These are channels between finite-dimensional C*-algebras which are reversible with the aid of an entangled resource state, generalising ordinary reversibility of a channel.
In Werner's classification, a bijective correspondence between tight teleportation and dense coding schemes was shown: swapping Alice and Bob's operations turns a teleportation scheme into a dense coding scheme and vice versa. We observe that this property generalises ordinary invertibility of a channel; we call it entanglement-invertibility. We show that entanglement-invertible channels are precisely the quantum bijections previously studied in the setting of quantum combinatorics [Musto2018], which are classified in terms of the representation theory of the quantum permutation group.
We analyze the geometry of positive and completely positive, trace preserving Pauli maps that are fully determined by up to two distinct parameters. This includes five classes of symmetric and non-invertible Pauli channels. Using the Hilbert-Schmidt metric in the space of the Choi-Jamio\lkowski states, we compute the relative volumes of entanglement breaking, time-local generated, and divisible channels. Finally, we find the shapes of the complete positivity regions in relation to the tetrahedron of all Pauli channels.
A gapped ground state of a quantum spin system has a natural length scale set by the gap. This length scale governs the decay of correlations. A common intuition is that this length scale also controls the spatial relaxation towards the ground state away from impurities or boundaries. The aim of this article is to take a step towards a proof of this intuition. We assume that the ground state is frustration-free and invertible, i.e.\ it has no long-range entanglement. Moreover, we assume the property that we are aiming to prove for one specific kind of boundary condition; namely open boundary c…
The class of local invertible operations is defined and the invariance of entanglement under such operations is established. For the quantification of entanglement, universal entanglement measures are defined, which are invariant under local invertible transformations. They quantify entanglement in a very general sense. It is shown that the Schmidt number is a universal entanglement measure, which is most important for the general amount of entanglement. For special applications, pseudo-measures are defined to quantify the useful entanglement for a certain quantum task. The entanglement quanti…
We investigate the problem of reversing quantum dynamics, specifically via optimal Petz recovery maps. We focus on typical decoherence channels, such as dephasing, depolarizing and amplitude damping. We illustrate how well a physically implementable recovery map simulates an inverse evolution. We extend this idea to explore the use of recovery maps as an approximation of inverse maps, and apply it in the context of non-Markovian dynamics. We show how this strategy attenuates non-Markovian effects, such as the backflow of information.
We introduce and investigate a family of entanglement-annihilating channels. These channels are capable of destroying any quantum entanglement within the system they act on. We show that they are not necessarily entanglement breaking. In order to achieve this result we analyze the subset of locally entanglement-annihilating channels. In this case, the same local noise applied on each subsystem individually is less entanglement annihilating (with respect to multi-partite entanglement) as the number of subsystems is increasing. Therefore, the bipartite case provides restrictions on the set of lo…
We address the problem of the robustness of entanglement of bipartite systems (qubits) interacting with dynamically independent environments. In particular, we focus on characterization of so-called local entanglement-annihilating two-qubit channels, which set the maximum permissible noise level allowing to perform entanglement-enabled experiments. The differences, but also subtle relations between entanglement-breaking and local entanglement-annihilating channels are emphasized. A detailed characterization of latter ones is provided for a variety of channels including depolarizing, unital, (g…
This paper continues the study of stochastic maps, or channels, which break entanglement. We give a detailed description of entanglement-breaking qubit channels, and show that such maps are precisely the convex hull of those known as classical-quantum channels. We also review the complete positivity conditions in a canonical parameterization and show how they lead to entanglement-breaking conditions.
We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel they use belongs to a given set of channels, so that they are forced to use quantum codes that are reliable for the whole set of channels. This is precisely the quantum analog of the compound channel coding problem. We determine the entanglement transmission and entanglement-generating capacities of compound quantum channels and show that they are equal. Moreov…
The coding theorem for the entanglement-assisted communication via infinite-dimensional quantum channel with linear constraint is extended to a natural degree of generality. Relations between the entanglement-assisted classical capacity and the $χ$-capacity of constrained channels are obtained and conditions for their coincidence are given. Sufficient conditions for continuity of the entanglement-assisted classical capacity as a function of a channel are obtained. Some applications of the obtained results to analysis of Gaussian channels are considered. A general (continuous) version of the fu…
We investigate the nullspace structures of entanglement breaking channels, and related applications. We show that every operator space of trace zero matrices is the nullspace of an entanglement breaking channel. We derive a test for mixed unitarity of quantum channels based on complementary channel behaviour and entanglement breaking channel nullspaces. We identify conditions that guarantee the existence of private algebras for certain classes of entanglement breaking 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 chann…
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their definitions to point-to-point quantum channels, establishing a lower bound for the asymptotic entanglement cost of any channel, whether finite or infinite dimensional. This leads, in particular, to a bound that is computable as a semidefinite program and that can outperform previously known lower bounds, including ones based on quantum relative entropy. In the cou…
The most general quantum object that can be shared between two distant parties is a bipartite channel, as it is the basic element to construct all quantum circuits. In general, bipartite channels can produce entangled states, and can be used to simulate quantum operations that are not local. While much effort over the last two decades has been devoted to the study of entanglement of bipartite states, very little is known about the entanglement of bipartite channels. In this work, we rigorously study the entanglement of bipartite channels as a resource theory of quantum processes. We present an…
Maximal entanglement and Schmidt number play an important role in various quantum information tasks. In this paper, it is shown that a local channel preserves maximal entanglement state(MES) or preserves pure states with Schmidt number $r$($r$ is a fixed integer) if and only if it is a local unitary operation.
Quantum entanglement can be studied through the theory of completely positive maps in a number of ways, including by making use of the Choi-Jamilkowski isomorphism, which identifies separable states with entanglement breaking quantum channels, and optimal ensemble length with entanglement breaking rank. The multiplicative domain is an important operator structure in the theory of completely positive maps. We introduce a new technique to determine if a channel is entanglement breaking and to evaluate entanglement breaking rank, based on an analysis of multiplicative domains determined by comple…
A definition of the Schmidt number of a state of an infinite dimensional bipartite quantum system is given and properties of the corresponding family of Schmidt classes are considered. The existence of states with a given Schmidt number such that any their countable convex decomposition does not contain pure states with finite Schmidt rank is established. Partially entanglement breaking channels in infinite dimensions are studied. Several properties of these channels well known in finite dimensions are generalized to the infinite dimensional case. At the same time, the existence of partially e…
This paper has been removed and is superceded by a pair of papers on stochastic maps, or channels, which break entanglement (EBT). quant-ph/0302031 General Entanglement Breaking Channels by Michael Horodecki, Peter W. Shor and Mary Beth Ruskai includes the results originally in section 3, as well as a number of new results about the extreme points. (The remarks in previously in section 3 about "sign change condition" are incorrect and have been omitted from quant-ph/0302031.) The new paper contains a to the conjecture that all extreme points of EBT maps are CQ when d > 2. quant-ph/0302032 Qubi…
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve t…
We show the rather counterintuitive result that entangled input states can strictly enhance the distinguishability of two entanglement-breaking channels.
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.
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the set that the channel is selected from. We investigate different variations of the problem: uninformed users, informed receiver, informed sender, and feedback assistance. We derive single-letter formulas for all corresponding channel capacities. Our proofs are based on one-shot decoupling bounds and properties of smooth entropies.
Entanglement is a key issue in the quantum physics which gives rise to resources for achieving tasks that are not possible within the realm of classical physics. Quantum entanglement varies with the evolution of the quantum systems. It is of significance to investigate the entanglement dynamics in terms of quantum channels. We study the entanglement-breaking channels and present the necessary and sufficient conditions for a quantum channel to an entanglement-breaking one for qubit systems. Furthermore, a concept of strong entanglement-breaking channel is introduced. The amendment of entangleme…
Quantum entanglement, a fundamental property ensuring security of key distribution and efficiency of quantum computing, is extremely sensitive to decoherence. Different procedures have been developed in order to recover entanglement after propagation over a noisy channel. However, besides a certain amount of noise, entanglement is completely lost. In this case the channel is called entanglement breaking and any multi-copy distillation methods cannot help to restore even a bit of entanglement. We report the experimental realization of a new method which restores entanglement from a single photo…
We define the binding entanglement channel as the quantum channel through which quantum information cannot be reliably transmitted, but which can be used to share bound entanglement. We provide a characterization of such class of channels. We also show that any bound entangled state can be used to construction of the map corresponding the binding entanglement channel.
Using well known duality between quantum maps and states of composite systems we introduce the notion of Schmidt number of a quantum channel. It enables one to define classes of quantum channels which partially break quantum entanglement. These classes generalize the well known class of entanglement breaking channels.
This paper considers the use an entanglement breaking channel in the construction of a secure bit-commitment protocol. It is shown that this can be done via a depolarizing quantum channel.
Entanglement degradation in open quantum systems is reviewed in the Choi-Jamiołkowski representation of linear maps. In addition to physical processes of entanglement dissociation and entanglement annihilation, we consider quantum dynamics transforming arbitrary input states into those that remain positive under partial transpose (PPT-inducing channels). Such evolutions form a convex subset of distillation-prohibiting channels. A relation between the above channels and entanglement-binding ones is clarified. An example of the distillation-prohibiting map $Φ\otimesΦ$ is given, where $Φ$ is not …
The occurrence of entanglement sudden death in the evolution of a bipartite system depends on both the initial state and the channel responsible for the evolution. An extreme case is that of entanglement braking channels, which are channels that acting on only one of the subsystems drives them to full disentanglement regardless of the initial state. In general, one can find certain combinations of initial states and channels acting on one or both subsystems that can result in entanglement sudden death or not. Neither the channel nor the initial state, but their combination, is responsible for …
The optimization of entanglement evolution for two-mode Gaussian pure states under one-side Gaussian map is studied. Even there isn't complete information about the one-side Gaussian noisy channel, one can still maximize the entanglement distribution by testing the channel with only two specific states.
We consider the standard quantum teleportation protocol where a general bipartite state is used as entanglement resource. We use the entanglement fidelity to describe how well the standard quantum teleportation channel transmits quantum entanglement and give a simple expression for the entanglement fidelity when it is averaged on all input states.
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this paper, We study quantum communication channels with correlated noise and derive a general expression for the mutual information of quantum channel, for the product, maximally entangled state coding and entanglement-assisted systems with correlated noise in the Pauli quantum channels. Hence, we suggest more efficient coding in the entanglement-assisted systems for the transmission of classica…
In the present article, the robustness of entanglement in two qubits maximally entangled mixed states (MEME) have been studied under quantum decoherence channels. Here we consider bit flip, phase flip, bit-phase-flip, amplitude damping, phase damping and depolarization channels. To quantify the entanglement, the concurrence has been used as an entanglement measure. During this study interesting results have been found for sudden death and birth of entanglement under bit flip and bit-phase-flip channels. While amplitude damping channel produces entanglement sudden death and does not allow re-bi…
We give a representation for entanglement-breaking channels in separable Hilbert space that generalizes the "Kraus decomposition with rank one operators" and use it to describe the complementary channels. We also give necessary and sufficient condition of entanglement-breaking for a general quantum Gaussian channel. Application of this condition to one-mode channels provides several new cases where the additivity conjecture holds in full generality.
Motivated by the results of C. Macchiavello and G. M. Palma on entanglement-enhanced information transmission over a quantum channel with correlated noise, we demonstrate how the entanglement teleportation scheme of J. Lee and M. S. Kim gives rise to two uncorrelated generalized depolarizing channels. In an attempt to find a teleportation scheme which yields two correlated generalized depolarizing channels, we discover a novel teleportation scheme, which allows one to learn about the entanglement in an entangled pure input state, but without decreasing the amount of entanglement associated wit…
We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of non-entangling channels. The lower bound on the static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of non-entangling channels. We find out that the one-shot static entanglement cost under the extended set of channe…
Originated from the superposition principle in quantum mechanics, coherence has been extensively studied as a kind important resource in quantum information processing. We investigate the distinguishability of coherence-breaking channels with the help of quantum entanglement. By explicitly computing the minimal error probability of channel discrimination, it is shown that entanglement can enhance the capacity of coherence-breaking channel distinguishability with same types for some cases while cannot enhanced for some other cases. For coherence-breaking channels with different types, the chann…
Quantum channels can represent dynamic resources, which are indispensable elements in many physical scenarios. To describe certain facets of nonclassicality of the channels, it is necessary to quantify their properties. In the framework of resource theory of quantum channel, we show two general ways of constructing entanglement measure of channels. We also present several entanglement measures of channels based on the Choi relative entropy of channels, concurrence and $k$-ME concurrence and give some specific examples. These entanglement measures of channels can deepen the cognizing about chan…
The sufficient condition of entanglement enhanced classical capacity is given for Pauli memory channel with arbitrary channel parameters. In some special case the condition is also necessary but fail to be necessary in general. The theory of majorization and perturbation are used in the proving.
We discuss the estimation of channel parameters for a noisy quantum channel - the so-called Pauli channel - using finite resources. It turns out that prior entanglement considerably enhances the fidelity of the estimation when we compare it to an estimation scheme based on separable quantum states.
We show that the dynamic resource theory of quantum entanglement can be formulated using the superchannel theory. In this formulation, we identify the separable channels and the class of free superchannels that preserve channel separability as free resources, and choose the swap channels as dynamic entanglement golden units. Our first result is that the one-shot dynamic entanglement cost of a bipartite quantum channel under the free superchannels is bounded by the standard log-robustness of channels. The one-shot distillable dynamic entanglement of a bipartite quantum channel under the free su…
We show that for the tensor product of an entanglement-breaking quantum channel with an arbitrary quantum channel, both the minimum entropy of an output of the channel and the Holevo-Schumacher-Westmoreland capacity are additive. In addition, for the tensor product of two arbitrary quantum channels, we give a bound involving entanglement of formation for the amount of subadditivity (for minimum entropy output) or superadditivity (for channel capacity) that can occur.
We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit information if it has finite memory. The capacities increase as the memory increases attaining maximum value for perfect memory channel.
A bipartite quantum channel represents the interaction between systems, generally allowing for exchange of information. A special class of bipartite channels are the no-signaling ones, which do not allow communication. In Ref. [1] it has been conjectured that all no-signaling channels are mixtures of entanglement-breaking and localizable channels, which require only local operations and entanglement. Here we provide the general realization scheme, giving a counterexample to the conjecture.
It is known that the minimal output entropy is additive for any product of entanglement breaking (EB) channels. The same is true for the Renyi entropy, where additivity is equivalent to multiplicativity of the $1 \rightarrow q$ norm for all $q \ge 1$. In this paper we consider the related question of multiplicativity of the $2 \rightarrow q$ norm for entanglement breaking channels. We prove that multiplicativity holds in this case for certain classes of EB channels, including both the CQ and QC channels.
In this paper, we study entanglement dynamics of a two-qubit extended Werner-like state locally interacting with independent noisy channels, i.e., amplitude damping, phase damping and depolarizing channels. We show that the purity of initial entangled state has direct impacts on the entanglement robustness in each noisy channel. That is, if the initial entangled state is prepared in mixed instead of pure form, the state may exhibit entanglement sudden death (ESD) and/or be decreased for the critical probability at which the entanglement disappear.
We introduce a new protocol, the channel-state coding protocol, to quantum Shannon theory. This protocol generates entanglement between a sender and receiver by coding for a noisy quantum channel with the aid of a noisy shared state. The mother and father protocols arise as special cases of the channel-state coding protocol, where the channel is noiseless or the state is a noiseless maximally entangled state, respectively. The channel-state coding protocol paves the way for formulating entanglement-assisted quantum error-correcting codes that are robust to noise in shared entanglement. Finally…
Entanglement is essential to many quantum information applications, but it is easily destroyed by quantum decoherence arising from interaction with the environment. We report the first experimental demonstration of an entanglement-based protocol that is resilient to loss and noise which destroy entanglement. Specifically, despite channel noise 8.3 dB beyond the threshold for entanglement breaking, eavesdropping-immune communication is achieved between Alice and Bob when an entangled source is used, but no such immunity is obtainable when their source is classical. The results prove that entang…
Symmetries of the initial state of a quantum system and the quantum channels, which simultaneously affect parts of the system, can significantly simplify the description of the entanglement evolution. Using concurrence as the entanglement measure, we study the entanglement evolution of few qubit systems, when each of the qubits is affected by a local channel independently of the others. We show that, for low-rank density matrices of the final quantum state, such complex entanglement dynamics can be completely described by a combination of independent factors representing the evolution of entan…
The property of the optimal signal ensembles of entanglement assisted channel capacity is studied. A relationship between entanglement assisted channel capacity and one-shot capacity of unassisted channel is obtained. The data processing inequalities, convexity and additivity of the entanglement assisted channel capacity are reformulated by simple methods.
It shown that when one of the components of a product channel is entanglement breaking, the output state with maximal p-norm is always a product state. This result complements Shor's theorem that both minimal entropy and Holevo capacity are additive for entanglement breaking channels. It is also shown how Shor's results can be recovered from the p-norm results by considering their behavior for p close to one.
In this paper, we calculate the entanglement-assisted classical information capacity of amplitude damping channel and compare it with the particular mutual information which is considered as the entanglement-assisted classical information capacity of this channel in Ref. 6. It is shown that the difference between them is very small. In addition, we point out that using partial symmetry and concavity of mutual information derived from dense coding scheme one can simplify the calculation of entanglement-assisted classical information capacities for non-unitary-covariant quantum noisy channels.
We show that entanglement is a useful resource to enhance the mutual information of the depolarizing channel when the noise on consecutive uses of the channel has some partial correlations. We obtain a threshold in the degree of memory, depending on the shrinking factor of the channel, above which a higher amount of classical information is transmitted with entangled signals.
We show that for a particular class of quantum channels, which we call heralded channels, monogamy of squashed entanglement limits the superadditivity of Holevo capacity. Heralded channels provide a means to understand the quantum erasure channel composed with an arbitrary other quantum channel, as well as common situations in experimental quantum information that involve frequent loss of qubits or failure of trials. We also show how entanglement monogamy applies to non-classicality in quantum games, and we consider how faithful, monogamous entanglement measures may bound other entanglement-de…
