One-Shot Static Entanglement Cost of Bipartite Quantum Channels
Abstract
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 one-shot 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 channels is given by the channel’s standard log-robustness. This quantity also gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels.
I Introduction
Physical resources in nature can show quantum features in two different forms: static resources in quantum states and dynamic resources in quantum dynamics. The prior one has been investigated intensely from the early days of quantum science to these days, focusing on the quantum entanglement that lies behind the most popular quantum paradox of the Schrödinger’s cat [1, 2]. The common theoretical pillar through all the static quantum resources has been understood in the framework of quantum resource theory of states [3]. Meanwhile, the dynamic quantum resources in quantum channels have been studied from the early days as well [4, 5], and it has regained interest in recent years as the general dynamic resource theory [6, 7] as well as its applications concerning quantum computation [8, 9, 10]. In order to precisely analyze quantum dynamic resources [11, 12], the concept of entropy [13], the coherence [14, 15], and the entanglement of quantum channels [16, 17] have been investigated, and fault-tolerant quantum computation has been analyzed by applying resource theory of the magic states [18, 19, 9, 8, 20]. These systematic investigations on quantum resources are rapidly unifying both static and dynamic quantum resources in a framework based on the fact that quantum states can be regarded as quantum channels with trivial input systems.
In fact, the two types of quantum resources are intimately intertwined; there have been various results on such relations from the beginning of quantum information science. Focusing on quantum entanglement, a static quantum entanglement resource, that is, an entangled bipartite state can be generated through given dynamic entanglement resources such as the CNOT gate or the SWAP gate since they enable to prepare maximally entangled states. Conversely, static entanglement resource can be used to simulate a quantum channel having a single input and output under local operations and classical communication (LOCC) [21] and the positive partial transpose (PPT) channels [22]. The static entanglement cost and distillable entanglement of a bipartite quantum channel were studied as well [17]. In spite of these results, however, it still remains to estimate the necessary amount of static entanglement resource to generate an arbitrary bipartite quantum channel in the one-shot scenario.
In this paper, we try to fill a gap in bridging the two types of quantum entanglement resources by looking into the one-shot static entanglement cost to simulate a bipartite quantum channel under resource non-generating channels. We furthermore investigate the one-shot static entanglement cost of a bipartite quantum channel allowing a larger set of free channels, which ends up in an exact value; it turns out that the extended set of free channels can be interpreted by exploiting dynamic resource theory of entanglement.
In Sec. II, we set up our notations and recapitulate static and dynamic resource theories of entanglement, and then introduce resource monotones that we use. Sec. III introduces the one-shot static entanglement cost of a bipartite quantum channel under the set of non-entangling quantum channels; the quantity is shown to be lower-bounded by a resource monotone as well as the entanglement-generating power of the channel. Sec. IV introduces a new class of free transformations, and the one-shot static entanglement cost under those channels is analyzed. Furthermore, it is argued why the one-shot static entanglement cost under the conceived channels is given by the same quantity that appeared in the one-shot dynamic entanglement cost under non-entangling superchannels. We conclude with Sec. V referring to the connection of our work to general transformations between quantum channels.
II Resource Theory of Entanglement and Resource Monotones
II.1 Notation
We use capital letters such as and to denote either physical systems or Hilbert spaces to describe the systems; Composite systems of system and is denoted as . Curly letters like for quantum channels which are the completely positive trace-preserving linear maps: the subscript represents the system that the channel acts on. When the input and output systems are different, it can be explicitly written as . The set of quantum channels from a system to a system is denoted as , while corresponds to that of the same input and output system . A bipartite quantum channel is a quantum channel that have two input and output systems, respectively, e.g., . Greek letters like , denote density matrices of pure states of systems in the subscript, and is the -maximally entangled state corresponding to . The Choi state of a quantum channel will be denoted by , where is the identity channel, and is the dimension of the system . We use the logarithm to base two.
II.2 Resource theory of entanglement
A resource theory consists of a set of free resources, either in the form of quantum states or in the form of quantum dynamics, and a set of free transformations that keeps the free resources [3]. The static resource theory of entanglement possesses a physically well-motivated set of free transformations related to locality in manipulating quantum systems, the LOCC channels [2]. An LOCC channel consists of any local quantum operations and classical communications so that it allows to prepare free states termed as the separable states that can be written as a sum of product states as
(1) |
where and [23]. Although the set of LOCC channels is operationally intuitive, it is not a topologically closed set implying the existence of sequences of LOCC channels that do not converge to an LOCC channel [24], incurring mathematical difficulties to manipulate the set fully [25].
There have been several classes of bipartite quantum channels that include LOCC channels and are helpful to understand quantum entanglement [26]. One of the substitutes for LOCC channels is the set of separable channels (SepC) characterized by their Choi states being separable states [27]; it is strictly larger than the closure of the set of LOCC channels [28, 29, 24], is the largest set of bipartite quantum channels that are completely resource non-generating: a separable channel acting on local subsystems of a large system does not generate entanglement as a whole [30]. Meanwhile, the largest set of bipartite quantum channels that keep the set of separable states is the separability-preserving channels (SEPP) or non-entangling channels, which are by definition channels that send separable states to separable states [30]. A quantum state is called a positive-partial-transpose (PPT) state [31] if where the superscript denotes the partial transpose map on the system , a typical example of positive but not completely positive maps. A bipartite quantum channel is called a PPT channel 111More precisely, it is called a completely-PPT-preserving channel. if it sends PPT states to PPT states even if the channel acts on the subsystems [33, 34]; A PPT channel is also characterized by its Choi state being a PPT state.
The static resource theory of entanglement extends to dynamic resource theories by regarding free channels as free resources and conceiving a set of free superchannels that do not generate resources. In general, a dynamic resource theory treats a set of quantum channels as free resources; a quantum state can also be seen as a quantum channel with a trivial input space . Transformations between quantum channels are described by supermaps that send linear maps to linear maps. A superchannel is a supermap that can be physically realized [35, 36]; it should send completely positive maps to completely positive maps even when it acts on subsystems. It should preserve trace-preserving properties as well. It is known that any superchannel is equivalent to a pre-processing quantum channel followed by a post-processing quantum channel with an ancillary system. When it comes to the dynamic resource theory of entanglement, one of the sets mentioned in the previous paragraphs such as LOCC, SEPP, PPT can be taken as a set of free dynamic resources, and superchannels that send free dynamic resources to themselves can be set as free superchannels. For instance, one can consider as free dynamic resources; A possible choice of free superchannels is the set of separability-preserving superchannels (SEPPSC) that send separable channels to separable channels [37]; in Sec. IV, we will use this dynamic resource theory of entanglement to interpret the static entanglement cost of a bipartite quantum channel under an extended set from SEPP. The dynamic resource theories of entanglement taking the LOCC channels as the free resources have first been proposed [16, 38], and the dynamic resource theories of entanglement taking SEPP channels [37] and PPT channels [39, 22, 38, 16, 17] have been established recently.
II.3 Resource monotones
We introduce two classes of resource monotones that can be adapted to quantify both the static and the dynamic quantum resources. Here we focus on the dynamic resource monotones. Let be the set of free channels. The generalized robustness of a quantum channel under the set is a resource monotone that has been well-investigated, and has operational meanings in tasks such as quantum state ensemble discrimination [40], resource erasure [41], and one-shot catalytic dynamic entanglement cost [37, 6]. In general, when the set of free resources is convex and closed, convex analysis provides useful tools to construct resource monotones [42, 43]. Hereafter, we will consider as a set of free bipartite quantum channels.
The generalized robustness for a bipartite quantum channel with respect to is defined as
(2) | ||||
(3) |
From the definition, it is clear that the generalized robustness is the gauge function for the set of free resources [44, 42]. The generalized robustness is also related to the max relative entropy of channels as given by
(4) |
where . The generalized log-robustness of a bipartite channel is defined as , and its smooth version with is given by
(5) | ||||
(6) |
where is a shorthand for the diamond-distance between channels 222The diamond-distance between quantum channels is induced from the diamond norm which is defined for a map as [55]. It has an operational meaning in the quantum channel discrimination task [56]., i.e., , and the smooth max-relative entropy is given by .
Another class of resource monotone is the standard robustness of bipartite quantum channels with respect to , which is defined as
(7) |
The standard log-robustness of a bipartite channel is defined as , and its smooth version is defined as
(8) |
The standard robustness of a bipartite channel has an operational meaning as the one-shot dynamic entanglement cost under the set of all separability-preserving superchannels (SEPPSC) which send separable channels to separable channels [37]. Note that a quantum state can be treated as a quantum channel with the trivial input space, that is, one-dimensional Hilbert space isomorphic to having one and only one quantum state . With this correspondence, the above quantities for quantum channels with a trivial input space reduce to those for quantum states.
III One-Shot Static Entanglement Cost under SEPP

In this section, we investigate what amount of the static entanglement resources is required to simulate a bipartite quantum channel utilizing SEPP channels which are the maximum resource non-generating channels in static entanglement resource theories. In principle, static entanglement resources in quantum states can be used to simulate any bipartite quantum channel under LOCC as depicted in Fig. 1 by exploiting quantum teleportation twice. This provides a trivial upper bound on the necessary amount of the static entanglement resources to simulate a bipartite quantum channel under LOCC or any other set of free channels which includes LOCC.

More precisely, the one-shot static entanglement cost of a bipartite quantum channel under SEPP is an operational quantity that measures the minimum amount of the static entanglement resources to simulate a single instance of the quantum channel under SEPP channels as depicted in Fig. 2. Formally it is defined as follows: Given ,
(9) |
where is the set of all SEPP channels that send separable states on to separable states on . Thus, the one-shot static entanglement cost of a bipartite quantum channel is the minimum number of Bell states to approximate the channel under SEPP. Note that one can define the one-shot static entanglement cost using SEPP channels having the same input and output spaces, . It reduces to the above form after tracing out the local subsystems , that is,
(10) |
where .
We find a lower bound on this operational quantity as follows:
Proposition III.1.
Given , the one-shot static entanglement cost of a bipartite quantum channel under SEPP is bounded below by the smooth generalized log-robustness of the channel with respect to SEPP, that is,
(11) |
Proof.
Let . There exists a quantum channel
(12) |
such that . Using the dephasing channel , we have , where is the set of all separable states on . This leads to . We have that
(13) |
where the subscript in is suppressed for readability. This completes the proof. ∎
Next, we show that the static entanglement resource necessary to simulate a bipartite quantum channel is always greater than or equal to static entanglement resources generated from separable states. The maximum static entanglement that a bipartite quantum channel can generate from a separable state can be quantified by
(14) |
which is called the robustness-generating power [46, 40] of a bipartite quantum channel 333One can define the quantity with maximization over .. Its smooth version is defined as . We find that the robust-generating power of a channel is no more than the one-shot static entanglement cost to simulate the channel as follows:
Proposition III.2.
Given and a bipartite quantum channel , the following inequality holds:
(15) |
Proof.
Let be a SEPP channel that simulates the quantum channel with the static entanglement resource such that
(16) |
For any separable state , we have that
(17) |
where the subscript in is suppressed for readability as in (13). Therefore, it follows that
(18) |
This completes the proof. ∎
The above result implies that the entanglement capacity or output static entanglement of a bipartite channel cannot be larger than the one-shot static entanglement cost necessary to simulate the channel in general.
IV One-Shot Static Entanglement Cost under extended SEPP
In this section, we introduce a set of free channels larger than SEPP, and then calculate the one-shot static entanglement cost of a bipartite channel under the set. Recall that a multipartite quantum state is called a fully separable state if it can be written as a convex sum of product states as follows [48]:
(19) |
We call a quantum channel sending a composite system to a composite system fully separability-preserving (FSEPP) if it sends a fully separable state to a fully separable state; the set of such channels is denoted as . When there are only two subsystems and , we have the equality .
The one-shot static entanglement cost of a bipartite quantum channel under FSEPP, , is an operational quantity defined as
(20) |
Note that here we allow a set of free channels which is larger than the set in the previous section, since is only required to send a (strict) subset of to the same set . The main result of our work is as follows:
Theorem IV.1.
Given , the one-shot static entanglement cost of a bipartite quantum channel under FSEPP is given by
(21) |
Proof.
Note that due to . Let . There exist quantum channels and such that
(22) |
We construct an -simulating channel as follows:
(23) |
where and are the post-measurement states of depending on the outcomes of the measurement . Apparently, we have that
(24) |
Furthermore, for and , it follows that
(25) |
where because is separable [49]. Since any fully separable state can be written as a convex sum of product states of separable states such as for and , the above result proves that
(26) |
The lower bound follows from the monotonicity of the standard log-robustness with respect to the compositions with free channels. Let . There exists such that . It follows that
(27) |
where is used in the first line. This completes the proof. ∎
The above result can be alternatively understood in a dynamic entanglement resource theory. Taking the separable channels as the free resources, a superchannel is called separability-preserving superchannel (SEPPSC) if it sends separable channels to separable channels [37]. Consider a set of separable channels with the trivial input space , which is isomorphic to the set of separable states , and a superchannel with the specified input and output space. The simulation of a quantum channel in previous paragraphs can be seen as a transformation from the input channels, here corresponding to , to the output channels, which is equivalent to a quantum channel in as depicted in Fig. 3 [35, 36].

Now we argue that is equivalent to . Consider a superchannel . Since a superchannel consists of a pre- and post-quantum channels connected by an ancillary system [35], is implemented by a quantum channel . Thus, the condition for being SEPPSC is, by definition, given by the condition for the quantum channel satisfying
(28) |
for all and . As noted in the proof of Theorem IV.1, this is equivalent to that . Hence, we can interpret the one-shot static entanglement cost of a quantum channel under FSEPP as the one-shot dynamic entanglement cost of a quantum channel under SEPPSC by regarding the static entanglement resource as a dynamic entanglement resource with a trivial input space.
V Conclusion
We have presented a lower bound on the one-shot static entanglement cost of a bipartite quantum channel under the set of SEPP channels given by the generalized log-robustness of the channel. The maximum static entanglement that can be generated by a bipartite quantum channel from a separable state has also been shown to be less than or equal to the one-shot static entanglement cost to simulate the channel in general.
We have defined the FSEPP channels, an extension of SEPP channels. The one-shot static entanglement cost of a bipartite quantum channel under the set of FSEPP channels is given by the standard log-robustness of the target channel. The latter also gives the one-shot dynamic entanglement cost under SEPPSC, the set of dynamic resource non-generating superchannels. One can understand this coincidence by regarding the static entanglement resource used to generate the target channel as a dynamic entanglement resource with trivial inputs; then the free quantum channel in the setting corresponds to the free superchannel in the dynamic resource theory. Since the free superchannel consists of a single quantum channel due to the trivial input space, the set of the free superchannel coincides with the set of FSEPP. This explains the reason why the one-shot static entanglement cost under FSEPP should be given by the standard log-robustness of the target channel, matching the result of the dynamic entanglement theory under SEPPSC [37].
Dynamic resource theories possess intricate structures that are absent in the static resource theories, although they share many facets analogous to those of the latter. An intriguing complication arises when one considers quantum channel transformations between many copies [50, 6, 51]; With fixed causal order, -copies of quantum channels can be combined in parallel, sequential, or adaptive ways where superchannels form a quantum comb [52, 53]. It is even possible to use -copies of quantum channels without definite causal order in a quantum process [54]. These possibilities raise mathematically challenging problems as well as questions concerning their physical meanings. When it comes to the dynamic resource theory of entanglement, a few pioneering works already exist tackling the most general transformations [16, 17]. Our work avoids such issues focusing on the one-shot scenario dealing with a single-copy transformations though, it already shows a subtle relation between the static and the dynamic entanglement resources as shown in the previous section; We wish that this work is helpful to the exploration of various dynamic resources.
Acknowledgements.
H.-J. Kim acknowledges discussions with M. Plenio, L. Lami, and T. Theurer at Ulm university; L. Lami helped us clarify the definition of FSEPP. This research was supported by the National Research Foundation of Korea (NRF) grant funded by the Ministry of Science and ICT (MSIT) (Grant no. NRF-2019R1A2C1006337) and (Grant no. NRF-2020M3E4A1079678). S.L. acknowledges support from the MSIT, Korea, under the Information Technology Research Center support program (IITP-2021-2018-0-01402) supervised by the Institute for Information & Communications Technology Planning & Evaluation, and the Quantum Information Science and Technologies program of the NRF funded by the MSIT (No. 2020M3H3A1105796).References
- Schrödinger [1935] E. Schrödinger, Die gegenwärtige situation in der quantenmechanik, Naturwissenschaften 23, 807 (1935).
- Horodecki et al. [2009] R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Reviews of Modern Physics 81, 865 (2009).
- Chitambar and Gour [2019] E. Chitambar and G. Gour, Quantum resource theories, Reviews of Modern Physics 91, 025001 (2019).
- Eisert et al. [2000] J. Eisert, K. Jacobs, P. Papadopoulos, and M. B. Plenio, Optimal local implementation of nonlocal quantum gates, Physical Review A 62, 052317 (2000).
- Nielsen et al. [2003] M. A. Nielsen, C. M. Dawson, J. L. Dodd, A. Gilchrist, D. Mortimer, T. J. Osborne, M. J. Bremner, A. W. Harrow, and A. Hines, Quantum dynamics as a physical resource, Physical Review A 67, 052301 (2003).
- Regula and Takagi [2020a] B. Regula and R. Takagi, One-shot manipulation of dynamical quantum resources (2020a), arXiv:2012.02215 [quant-ph] .
- Yuan et al. [2020] X. Yuan, P. Zeng, M. Gao, and Q. Zhao, One-shot dynamical resource theory (2020), arXiv:2012.02781 [quant-ph] .
- Wang et al. [2019] X. Wang, M. M. Wilde, and Y. Su, Quantifying the magic of quantum channels, New Journal of Physics 21, 103002 (2019).
- Seddon and Campbell [2019] J. R. Seddon and E. T. Campbell, Quantifying magic for multi-qubit operations, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences 475, 20190251 (2019).
- Takagi [2020] R. Takagi, Optimal resource cost for error mitigation (2020), arXiv:2006.12509 [quant-ph] .
- Gour and Winter [2019] G. Gour and A. Winter, How to quantify a dynamical quantum resource, Physical Review Letters 123, 150401 (2019).
- Liu and Yuan [2020] Y. Liu and X. Yuan, Operational resource theory of quantum channels, Physical Review Research 2, 012035 (2020).
- Gour and Wilde [2018] G. Gour and M. M. Wilde, Entropy of a quantum channel (2018), arXiv:1808.06980 [cond-mat, physics:hep-th, physics:math-ph, physics:quant-ph] .
- Díaz et al. [2018] M. G. Díaz, K. Fang, X. Wang, M. Rosati, M. Skotiniotis, J. Calsamiglia, and A. Winter, Using and reusing coherence to realize quantum processes, Quantum 2, 100 (2018).
- Saxena et al. [2020] G. Saxena, E. Chitambar, and G. Gour, Dynamical resource theory of quantum coherence, Physical Review Research 2, 023298 (2020).
- Gour and Scandolo [2019] G. Gour and C. M. Scandolo, The entanglement of a bipartite channel (2019), arXiv:1907.02552 [math-ph, physics:quant-ph] .
- Bäuml et al. [2019] S. Bäuml, S. Das, X. Wang, and M. M. Wilde, Resource theory of entanglement for bipartite quantum channels (2019), arXiv:1907.04181 [quant-ph] .
- Bravyi and Kitaev [2005] S. Bravyi and A. Kitaev, Universal quantum computation with ideal Clifford gates and noisy ancillas, Physical Review A 71, 022316 (2005).
- Howard and Campbell [2017] M. Howard and E. Campbell, Application of a resource theory for magic states to fault-tolerant quantum computing, Physical Review Letters 118, 090501 (2017).
- Wang et al. [2020] X. Wang, M. M. Wilde, and Y. Su, Efficiently computable bounds for magic state distillation, Physical Review Letters 124, 090505 (2020).
- Berta et al. [2013] M. Berta, F. G. S. L. Brandão, M. Christandl, and S. Wehner, Entanglement cost of quantum channels, IEEE Transactions on Information Theory 59, 6779 (2013).
- Wang and Wilde [2018] X. Wang and M. M. Wilde, Exact entanglement cost of quantum states and channels under PPT-preserving operations (2018), arXiv:1809.09592 [quant-ph] .
- Werner [1989] R. F. Werner, Quantum states with einstein-podolsky-rosen correlations admitting a hidden-variable model, Physical Review A 40, 4277 (1989).
- Chitambar et al. [2012] E. Chitambar, W. Cui, and H.-K. Lo, Increasing entanglement monotones by separable operations, Physical Review Letters 108, 240504 (2012).
- Chitambar et al. [2014] E. Chitambar, D. Leung, L. Mančinska, M. Ozols, and A. Winter, Everything you always wanted to know about locc (but were afraid to ask), Communications in Mathematical Physics 328, 303 (2014).
- Regula et al. [2019] B. Regula, K. Fang, X. Wang, and M. Gu, One-shot entanglement distillation beyond local operations and classical communication, New Journal of Physics 21, 103017 (2019).
- Cirac et al. [2001] J. I. Cirac, W. Dür, B. Kraus, and M. Lewenstein, Entangling operations and their implementation using a small amount of entanglement, Physical Review Letters 86, 544 (2001).
- Bennett et al. [1999] C. H. Bennett, D. P. DiVincenzo, C. A. Fuchs, T. Mor, E. Rains, P. W. Shor, J. A. Smolin, and W. K. Wootters, Quantum nonlocality without entanglement, Physical Review A 59, 1070 (1999).
- Chitambar and Duan [2009] E. Chitambar and R. Duan, Nonlocal entanglement transformations achievable by separable operations, Physical Review Letters 103, 110502 (2009).
- Harrow and Nielsen [2003] A. W. Harrow and M. A. Nielsen, Robustness of quantum gates in the presence of noise, Physical Review A 68, 012308 (2003).
- Peres [1996] A. Peres, Separability criterion for density matrices, Physical Review Letters 77, 1413 (1996).
- Note [1] More precisely, it is called a completely-PPT-preserving channel.
- Rains [1999] E. M. Rains, Bound on distillable entanglement, Physical Review A 60, 179 (1999).
- Rains [2001] E. Rains, A semidefinite program for distillable entanglement, IEEE Transactions on Information Theory 47, 2921 (2001).
- Chiribella et al. [2008a] G. Chiribella, G. M. D’Ariano, and P. Perinotti, Transforming quantum operations: quantum supermaps, EPL (Europhysics Letters) 83, 30004 (2008a).
- Gour [2019] G. Gour, Comparison of quantum channels by superchannels, IEEE Transactions on Information Theory 65, 5880 (2019).
- Kim et al. [2020] H.-J. Kim, S. Lee, L. Lami, and M. B. Plenio, One-shot manipulation of entanglement for quantum channels (2020), arXiv:2012.02631 [quant-ph] .
- Gour and Scandolo [2020] G. Gour and C. M. Scandolo, Dynamical entanglement, Physical Review Letters 125, 180505 (2020).
- Wang and Wilde [2020] X. Wang and M. M. Wilde, Cost of quantum entanglement simplified, Physical Review Letters 125, 040502 (2020).
- Takagi and Regula [2019] R. Takagi and B. Regula, General resource theories in quantum mechanics and beyond: operational characterization via discrimination tasks, Physical Review X 9, 031053 (2019).
- Liu et al. [2017] Z.-W. Liu, X. Hu, and S. Lloyd, Resource destroying maps, Physical Review Letters 118, 060502 (2017).
- Regula [2017] B. Regula, Convex geometry of quantum resource quantification, Journal of Physics A: Mathematical and Theoretical 51, 045303 (2017).
- Regula et al. [2020] B. Regula, K. Bu, R. Takagi, and Z.-W. Liu, Benchmarking one-shot distillation in general quantum resource theories, Physical Review A 101, 062315 (2020).
- Rockafellar [1996] R. T. Rockafellar, Convex Analysis: (Princeton University Press, Princeton, NJ, 1996).
- Note [2] The diamond-distance between quantum channels is induced from the diamond norm which is defined for a map as [55]. It has an operational meaning in the quantum channel discrimination task [56].
- Zanardi [2000] P. Zanardi, Stabilizing quantum information, Physical Review A 63, 012301 (2000).
- Note [3] One can define the quantity with maximization over .
- Dür et al. [1999] W. Dür, J. I. Cirac, and R. Tarrach, Separability and distillability of multiparticle quantum systems, Physical Review Letters 83, 3562 (1999).
- Horodecki et al. [1999] M. Horodecki, P. Horodecki, and R. Horodecki, General teleportation channel, singlet fraction, and quasidistillation, Physical Review A 60, 1888 (1999).
- Fang and Liu [2020] K. Fang and Z.-W. Liu, No-go theorems for quantum resource purification: New approach and channel theory (2020), arXiv:2010.11822 [quant-ph] .
- Regula and Takagi [2020b] B. Regula and R. Takagi, Fundamental limitations on quantum channel manipulation (2020b), arXiv:2010.11942 [math-ph, physics:quant-ph] .
- Chiribella et al. [2008b] G. Chiribella, G. M. D’Ariano, and P. Perinotti, Quantum circuit architecture, Physical Review Letters 101, 060401 (2008b).
- Chiribella et al. [2009] G. Chiribella, G. M. D’Ariano, and P. Perinotti, Theoretical framework for quantum networks, Physical Review A 80, 022339 (2009).
- Chiribella et al. [2013] G. Chiribella, G. M. D’Ariano, P. Perinotti, and B. Valiron, Quantum computations without definite causal structure, Physical Review A 88, 022318 (2013).
- Kitaev [1997] A. Y. Kitaev, Quantum computations: Algorithms and error correction, Russian Mathematical Surveys 52, 1191 (1997).
- Piani and Watrous [2009] M. Piani and J. Watrous, All entangled states are useful for channel discrimination, Physical Review Letters 102, 250501 (2009).