Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOptimal decomposition of incoherent qubit channel
82
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We show that any incoherent qubit channel could be decomposed into four incoherent Kraus operators. The proof consists in showing existence of four incoherent Kraus operators by decomposing the corresponding Choi-Jamiol{}kowski-Sudarshan matrix. We mention some applications of this optimal decomposition. We also show that the Kraus rank and incoherent rank are different even for qubit channel.
rate research
Read More
It is well known that quantum states that can be transformed into each other by local unitary transformations are equal from the information theoretic point of view. This defines equivalence classes of states and allows one to write any state with the minimal number of parameters called the canonical form of the state. We define the equivalence classes of local measurements such that local operations which transform states from one equivalence class into another with the same probability are equivalent. This equivalence relation allows one to write the operators with the minimal number of parameters, which we call canonical operators, and hence the use of the canonical operators simplifies the optimal manipulation of quantum states. We use the canonical local operators for the concentration of three-qubit Greenberger-Horne-Zeilinger states and obtain the optimal concentration protocols in terms of the unitary invariants of quantum states, namely, the bipartite concurrences and the three-tangle.
It is well known that the majorization condition is the necessary and sufficient condition for the deterministic transformations of both pure bipartite entangled states by local operations and coherent states under incoherent operations. In this paper, we present two explicit protocols for these transformations. We first present a permutation-based protocol which provides a method for the single-step transformation of $d$-dimensional coherent states. We also obtain generalized solutions of this protocol for some special cases of $d$-level systems. Then, we present an alternative protocol where we use $d$-level ($d$ $<$ $d$) subspace solutions of the permutation-based protocol to achieve the complete transformation as a sequence of coherent-state transformations. We show that these two protocols also provide solutions for deterministic transformations of pure bipartite entangled states.
We compute analytically the maximal rates of distillation of quantum coherence under strictly incoherent operations (SIO) and physically incoherent operations (PIO), showing that they coincide for all states, and providing a complete description of the phenomenon of bound coherence. In particular, we establish a simple, analytically computable necessary and sufficient criterion for the asymptotic distillability under SIO and PIO. We use this result to show that almost every quantum state is undistillable --- only pure states as well as states whose density matrix contains a rank-one submatrix allow for coherence distillation under SIO or PIO, while every other quantum state exhibits bound coherence. This demonstrates fundamental operational limitations of SIO and PIO in the resource theory of quantum coherence. We show that the fidelity of distillation of a single bit of coherence under SIO can be efficiently computed as a semidefinite program, and investigate the generalization of this result to provide an understanding of asymptotically achievable distillation fidelity.
Quantum operations, or quantum channels cannot be inverted in general. An arbitrary state passing through a quantum channel looses its fidelity with the input. Given a quantum channel ${cal E}$, we introduce the concept of its quasi-inverse as a map ${cal E}^{qi}$ which when composed with ${cal E}$ increases its average input-output fidelity in an optimal way. The channel ${cal E}^{qi}$ comes as close as possible to the inverse of a quantum channel. We give a complete classification of such maps for qubit channels and provide quite a few illustrative examples.
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 infinite and complete family of measures of dynamical entanglement, which gives necessary and sufficient conditions for convertibility under local operations and classical communication. Then we focus on the dynamical resource theory where free operations are positive partial transpose (PPT) superchannels, but we do not assume that they are realized by PPT pre- and post-processing. This leads to a greater mathematical simplicity that allows us to express all resource protocols and the relevant resource measures in terms of semi-definite programs. Along the way, we generalize the negativity from states to channels, and introduce the max-logarithmic negativity, which has an operational interpretation as the exact asymptotic entanglement cost of a bipartite channel. Finally, we use the non-positive partial transpose (NPT) resource theory to derive a no-go result: it is impossible to distill entanglement out of bipartite PPT channels under any sets of free superchannels that can be used in entanglement theory. This allows us to generalize one of the long-standing open problems in quantum information - the NPT bound entanglement problem - from bipartite states to bipartite channels. It further leads us to the discovery of bound entangled POVMs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
