We present a general method to derive entanglement breaking (EB) conditions for continuous-variable quantum gates. We start with an arbitrary entanglement witness and reach an EB condition. The resultant EB condition is applicable not only for quantum channels but also for general quantum operations; namely, the trace-non-increasing class of completely positive maps. We illustrate our method associated with a quantum benchmark based on the input ensemble of Gaussian distributed coherent states. We also exploit our idea for channels acting on finite-dimensional systems and present a Schmidt-number benchmark based on input states of two mutually unbiased bases and measurements of generalized Pauli operators.
We present a general method to derive entanglement breaking (EB) conditions for continuous-variable quantum gates. We start with an arbitrary entanglement witness and reach an EB condition. The resultant EB condition is applicable not only for quantum channels but also for general quantum operations; namely, the trace-non-increasing class of completely positive maps. We illustrate our method associated with a quantum benchmark based on the input ensemble of Gaussian distributed coherent states. We also exploit our idea for channels acting on finite-dimensional systems and present a Schmidt-number benchmark based on input states of two mutually unbiased bases and measurements of generalized Pauli operators.
A unit-preserving and completely positive linear map, or a channel, Λ:A→Ain between C*-algebras A and Ain is called entanglement-breaking (EB) if ω◦(Λ⊗idB) is a separable state for any C*-algebra B and any state ω on the injective C*-tensor product Ain⊗B. In this paper, we establish the equivalence of the following conditions for a channel Λ with a quantum input space and with a general outcome C*-algebra, generalizing the known results in finite dimensions: (i) Λ is EB; (ii) Λ has a measurement-prepare form (Holevo form); (iii) n copies of Λ are compatible for all 2 ≤ n < ∞; (iv) countably infinite copies of Λ are compatible. By using this equivalence, we also show that the set of randomization-equivalence classes of normal EB channels with a fixed input von Neumann algebra is upper and lower Dedekind-closed, i.e., the supremum or infimum of any randomization-increasing or decreasing net of EB channels is also EB. As an example, we construct an injective normal EB channel with an arbitrary outcome operator algebra M acting on an infinite-dimensional separable Hilbert space by using the coherent states and the Bargmann measure.
In this paper we initiate the study of entanglement-breaking (EB) superchannels. These are processes that always yield separable maps when acting on one side of a bipartite completely positive (CP) map. EB superchannels are a generalization of the well-known EB channels. We give several equivalent characterizations of EB supermaps and superchannels. Unlike its channel counterpart, we find that not every EB superchannel can be implemented as a measure-and-prepare superchannel. We also demonstrate that many EB superchannels can be superactivated, in the sense that they can output non-separable channels when wired in series.We then introduce the notions of CPTP- and CP-complete images of a superchannel, which capture deterministic and probabilistic channel convertibility, respectively. This allows us to characterize the power of EB superchannels for generating CP maps in different scenarios, and it reveals some fundamental differences between channels and superchannels. Finally, we relax the definition of separable channels to include (p,q) -non-entangling channels, which are bipartite channels that cannot generate entanglement using p - and q -dimensional ancillary systems. By introducing and investigating k -EB maps, we construct examples of (p,q) -EB superchannels that are not fully entanglement breaking. Partial results on the characterization of (p,q) -EB superchannels are also provided.
Abstract Entanglement breaking (EB) channels, as completely positive and trace-preserving linear operators, sever the entanglement between the input system and other systems. In the realm of infinite-dimensional systems, a related concept known as strongly EB (SEB) channels emerges. This paper delves into characterizations of SEB channels, delineating sufficient conditions for a channel to be classified as SEB, especially with respect to the commutativity of its range. Moreover, we demonstrate that every closed self-adjoint subspace of trace-zero operators, with the trace norm, is the null space of a SEB channel.
Entanglement-breaking channels are quantum channels transforming entangled states to separable states. Despite a detailed discussion of their operational structure, to be found in the literature, studies on dynamical characteristics of this type of maps are yet limited. We consider one of the basic questions: for Lindblad-type dynamics, when does a given channel break entanglement? We discuss the finite-dimensional case where the quantification of entanglement via entanglement witnesses is utilized. For the general setup, we use the method of quantum speed limit to derive lower bounds on entanglement breaking times in terms of an input state, the dynamical map, and the witness operator. Then, with a particular choice of the input state and the entanglement witness, the bounds for the breaking time are turned to solely reflect the characteristics of the dynamics.
Abstract A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. with an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider. This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols. Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting in non-EB channels, such as CV quantum transducers and transmission lines.
Entanglement fidelity quantifies how well a quantum channel preserves the correlations between a transmitted system and an inaccessible reference system. We derive closed-form expressions for the entanglement fidelity associated with several standard quantum noise models, including the random Pauli-X, dephasing, depolarizing, Werner-Holevo, generalized Pauli (Weyl), and amplitude-damping channels. For each model, we express the entanglement fidelity in terms of a general input density operator ρ, using Schumacher's Kraus-operator approach, which provides a channel-agnostic recipe applicable to any completely positive trace-preserving (CPTP) map with a finite Kraus representation. We then specialize to a communication scenario in which the source emits a two-letter parametric alphabet, thereby making explicit the dependence of entanglement preservation on both channel and source parameters. The resulting expressions enable direct comparisons of channel performance and rankings for representative families of input states, including common qubit states.