删除或更新信息,请邮件至freekaoyan#163.com(#换成@)

Detecting entanglement of quantum channels

本站小编 Free考研考试/2022-01-02

<script type="text/javascript" src="https://cdn.bootcss.com/mathjax/2.7.2-beta.0/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script> <script type='text/x-mathjax-config'> MathJax.Hub.Config({ extensions: ["tex2jax.js"], jax: ["input/TeX", "output/HTML-CSS"], tex2jax: {inlineMath: [ ['$','$'], ["\\(","\\)"] ],displayMath: [ ['$$','$$'], ["\\[","\\]"] ],processEscapes: true}, "HTML-CSS": { availableFonts: ["TeX"] }, "HTML-CSS": {linebreaks: {automatic: true}}, SVG: {linebreaks: {automatic: true}} }); </script> Chaojian Li1,2, Bang-Hai Wang,1, Bujiao Wu3, Xiao Yuan,31School of Computer Science and Technology, Guangdong University of Technology, Guangzhou 510006, China
2Advanced Institute of Information Technology, Peking University, China
3Center on Frontiers of Computing Studies, Department of Computer Science, Peking University, Beijing 100871, China

Received:2021-07-10Revised:2021-08-10Accepted:2021-08-16Online:2021-09-14


Abstract
Entanglement is the crucial resource for different quantum information processing tasks. While conventional studies focus on the entanglement of bipartite or multipartite quantum states, recent works have extended the scenario to the entanglement of quantum channels, an operational quantification of the channel entanglement manipulation capability. Based on the recently proposed channel entanglement resource framework, here we study a further task of resource detection—witnessing entanglement of quantum channels. We first introduce the general framework and show how channel entanglement detection is related to the Choi state of the channel, enabling channel entanglement detection via conventional state entanglement detection methods. We also consider entanglement of multipartite quantum channels and use the stabilizer formalism to construct entanglement witnesses for circuits consisting of controlled-Z gates. We study the effectiveness of the proposed detection methods and compare their performance for several typical channels. Our work paves the way for systematic theoretical studies of channel entanglement and practical benchmarking of noisy intermediate scaled quantum devices.
Keywords: quantum entanglement;quantum channel;entanglement detection;entanglement witness


PDF (424KB)MetadataMetricsRelated articlesExportEndNote|Ris|BibtexFavorite
Cite this article
Chaojian Li, Bang-Hai Wang, Bujiao Wu, Xiao Yuan. Detecting entanglement of quantum channels. Communications in Theoretical Physics, 2021, 73(11): 115101- doi:10.1088/1572-9494/ac1da1

1. Introduction

Entanglement is a key feature of quantum physics [13], having wide applications in various quantum information processing tasks including quantum dense coding [4], quantum teleportation [5], quantum cryptography [6], quantum computation [7], etc. However, because almost every quantum system is noisy, how the noise affects the quantum system and whether entanglement survives under the noise is important for robust and reliable quantum information processing. It thus becomes one of the basic problems of quantum entanglement theory to check whether a quantum state is entangled or not. Entangled quantum states could be detected and analyzed by several theoretical and experimental tools. Many researchers have contributed to various separability standards and detection methods [816]. Notable approaches in the practical analysis of entanglement include the usage of positive but not completely positive maps [8] and entanglement witnesses [912].

Conventional entanglement theory focuses on the nonlocal correlation of quantum states, and quantum channels are used as their manipulation tool. Recent works have shown that quantum channel itself could be regarded as the resource object [1722] and the entanglement of channels has be studied under the framework of quantum resource theories [2328]. Analog to quantum states, quantum channels are also categorized into entangled and separable ones, with the amount of entanglement quantified via channel entanglement measures [2325]. Since a positive channel entanglement measure generally implies the existence of entanglement, it serves as a natural way to detect channel entanglement. However, a channel entanglement measure generally requires full information of the process, hence demanding a cost that is exponential to the system size. Because the channel has both inputs and outputs, the cost increases even quadratically faster than the one of states. Efficient state entanglement detection methods exist when exploiting the specific structure of the target resource and allowing a certain amount of failure, whether we could analogously detect channel entanglement remains open.

Here, we address this problem by considering general approaches for detecting channel entanglement. We first review the framework of state and channel entanglement as well as the task of entanglement detection. Then we show that detecting the channel entanglement is equivalent to detecting the entanglement of the corresponding Choi state, the output state of the channel given the maximally entangled input. We give three general channel entanglement detection strategies based on conventional state entanglement detection methods—negative partial transpose (NPT) [29], the computable cross norm or realignment criterion (CCNR) criterion [30, 31], and entanglement witnesses. We further extend the discussion to multipartite quantum channels and show how the stabilizer formalism [32] helps in designing entanglement witnesses for circuits consisting of CZ gates. As examples, we consider noisy CNOT and SWAP channels and show the effectiveness of the propose methods.

2. Background

We first review the framework of entanglement for bipartite states and channels, and the task of entanglement detection. For a system A, we denote the corresponding Hilbert space as ${{ \mathcal H }}_{A}$ and the set of state operators as ${ \mathcal D }(A)$. Consider a bipartite system AB, we call the state ${\sigma }_{{AB}}$ separable when it can be expressed as [3335]$\begin{eqnarray}{\sigma }_{{AB}}=\sum _{i}{\lambda }_{i}{\sigma }_{A}^{i}\otimes {\sigma }_{B}^{i}\end{eqnarray}$with ${\lambda }_{i}\geqslant 0$, ${\sum }_{i}{\lambda }_{i}=1$, and local states ${\sigma }_{A}$, ${\sigma }_{B}$ on quantum systems A and B, respectively. Otherwise the state is entangled. On the other hand, quantum channels are linear and completely positive and trace-preserving maps which act on quantum states [36]. A quantum channel ${ \mathcal N }$ could be written in the Kraus form [37] as$\begin{eqnarray}{ \mathcal N }\left(\rho \right)=\sum _{i=1}^{r}{K}_{i}\rho {K}_{i}^{\dagger },\end{eqnarray}$where the Kraus operators $\left\{{K}_{i}\right\}$ fulfil ${\sum }_{i=1}^{r}{K}_{i}^{\dagger }{K}_{i}={{\mathbb{I}}}_{A}$. Let ${{ \mathcal N }}_{{AB}}\in \mathrm{CPTP}\left({AB}\to {A}^{{\prime} }{B}^{{\prime} }\right)$ be a bipartite channel, it is called separable [23, 25] if it can be written as$\begin{eqnarray}{{ \mathcal N }}_{{AB}}\left({\rho }_{{AB}}\right)=\sum _{i}\left({X}_{A}^{i}\otimes {Y}_{B}^{i}\right){\rho }_{{AB}}{({X}_{A}^{i}\otimes {Y}_{B}^{i})}^{\dagger },\end{eqnarray}$where ${\sum }_{i}{\left({X}_{A}^{i}\right)}^{\dagger }{X}_{A}^{i}\otimes {\left({Y}_{B}^{i}\right)}^{\dagger }{Y}_{B}^{i}={{\mathbb{I}}}_{{AB}}$, otherwise the channel is entangled. The entanglement of multipartite states and channels could be similarly defined.

Suppose a quantum information task requires to prepare an entangled state ${\psi }_{{AB}}$ and the practically prepared state is ${\rho }_{{AB}}$. The task of entanglement detection is to determine whether ${\rho }_{{AB}}$ is entangled. A general detection strategy corresponds to a function f, which distinguishes separable and entangled states. However, since the geometry of the set of separable states is complex, detecting the entanglement of an arbitrary state is a challenging task. A conventional entanglement detection strategy is to exploit a linear witness operator W such that $\mathrm{Tr}\left(W{\sigma }_{{AB}}\right)\geqslant 0$ for all separable states ${\sigma }_{{AB}}$ and it detects the entanglement of ${\rho }_{{AB}}$ with $\mathrm{Tr}\left(W{\rho }_{{AB}}\right)\lt 0$ [16]. Here we review three general strategies of constructing the witness operator, which will be extended to detecting entanglement of quantum channels in the next section.

The first method is to exploit the positive but not completely positive map of transpose, or the NPT property of states. In particular, we always have ${\sigma }_{{AB}}^{{{\rm{T}}}_{A}}\geqslant 0$ when applying a partial transpose ${{\rm{T}}}_{A}$ on a separable state ${\sigma }_{{AB}}$, whereas we could have a negative partial transposed state ${\rho }_{{AB}}^{{{\rm{T}}}_{A}}\lt 0$ when ${\rho }_{{AB}}$ is entangled. In this case, we can find the eigenvector $\left|\phi \right\rangle $ with a negative eigenvalue [38], i.e. ${\rho }_{{AB}}^{{{\rm{T}}}_{A}}\left|\phi \right\rangle =\lambda \left|\phi \right\rangle $ with $\lambda \lt 0$. Then, a linear witness operator can be constructed as follows [16, 29]$\begin{eqnarray}W=| \phi \rangle {\left\langle \phi \right|}^{{{\rm{T}}}_{A}}.\end{eqnarray}$It is easy to verify that for any state with positive partial transpose, which include separable states ${\sigma }_{{AB}}$, we have$\begin{eqnarray}\mathrm{Tr}[W{\sigma }_{{AB}}]=\mathrm{Tr}\left[| \phi \rangle {\left\langle \phi \right|}^{{{\rm{T}}}_{A}}{\sigma }_{{AB}}\right]=\mathrm{Tr}\left[| \phi \rangle \left\langle \phi \right|{\sigma }_{{AB}}^{{{\rm{T}}}_{A}}\right]\geqslant 0,\end{eqnarray}$and for the entangled state ${\rho }_{{AB}}$,$\begin{eqnarray}\mathrm{Tr}\left(W{\rho }_{{AB}}\right)=\mathrm{Tr}\left(| \phi \rangle {\left\langle \phi \right|}^{{{\rm{T}}}_{A}}{\rho }_{{AB}}\right)=\mathrm{Tr}\left(| \phi \rangle \langle \phi | {\rho }_{{AB}}^{{{\rm{T}}}_{A}}\right)=\lambda \lt 0.\end{eqnarray}$In practice, we may not know the density matrix ${\rho }_{{AB}}$ and hence cannot get the eigenvectors with negative eigenvalues. Nevertheless, a realistic quantum protocol generally assumes an ideal pure state ${\psi }_{{AB}}$, and the partial transposed pure state ${\psi }_{{AB}}^{{{\rm{T}}}_{A}}$ could be used as the witness operator. Indeed, any partial transposed pure state could serve as the witness operator, although to be able to detect the entanglement of a given state, the operator should be accordingly chosen.

The second method is based on a Schimidt decomposition [39] of the density operator, namely the computable CCNR. Specifically, denote the set of Hermitian operators on ${ \mathcal H }$ as ${ \mathcal L }({ \mathcal H })$, which is a linear space with inner product $\langle {V}_{1},{V}_{2}\rangle =\mathrm{Tr}[{V}_{1}^{\dagger }{V}_{2}]$, for any ${V}_{1},{V}_{2}\in { \mathcal L }({ \mathcal H })$. Then for any density matrix ${\rho }_{{AB}}\in { \mathcal D }({{ \mathcal H }}_{{AB}})\subset { \mathcal L }({{ \mathcal H }}_{{AB}})$, the Schmidt decomposition of ${\rho }_{{AB}}$ is$\begin{eqnarray}{\rho }_{{AB}}=\sum _{k}{\lambda }_{k}{V}_{k}^{A}\otimes {V}_{k}^{B},\end{eqnarray}$where ${\lambda }_{k}\geqslant 0$, ${V}_{k}^{A}$ and ${V}_{k}^{B}$ are orthonormal bases in ${ \mathcal L }\left({{ \mathcal H }}_{A}\right)$ and ${ \mathcal L }\left({{ \mathcal H }}_{B}\right)$, respectively. Then we can construct the witness as follows [30, 31]$\begin{eqnarray}W={{\mathbb{I}}}_{A}\otimes {{\mathbb{I}}}_{B}-\sum _{k}{V}_{k}^{A}\otimes {V}_{k}^{B}.\end{eqnarray}$It is easy to verify that for any separable state ${\sigma }_{{AB}}={\sum }_{i}{\tilde{\lambda }}_{i}{\sigma }_{A}^{i}\otimes {\sigma }_{B}^{i}$, we have$\begin{eqnarray}\mathrm{Tr}[{\sigma }_{{AB}}W]=1-\sum _{k}\sum _{i}{\tilde{\lambda }}_{i}\mathrm{Tr}[({\sigma }_{A}^{i}\otimes {\sigma }_{B}^{i})\cdot ({V}_{k}^{A}\otimes {V}_{k}^{B})]\geqslant 0.\end{eqnarray}$Therefore, the state ${\rho }_{{AB}}$ is entangled whenever $\mathrm{Tr}[{\rho }_{{AB}}W]\lt 0$. Again, the witness operator W could be constructed from any state, for example based on the ideal pure state ${\psi }_{{AB}}$.

In the third method, we construct the witness operator W based on any observable O as$\begin{eqnarray}W=\alpha {\mathbb{I}}-O,\end{eqnarray}$where$\begin{eqnarray}\alpha =\mathop{\max }\limits_{{\sigma }_{{AB}}\ {\rm{is\; separable}}}\ \mathrm{Tr}({\sigma }_{{AB}}O).\end{eqnarray}$Since $\mathrm{Tr}[{\sigma }_{{AB}}O]\leqslant \alpha $, we have $\mathrm{Tr}[W{\sigma }_{{AB}}]\geqslant 0$ for all separable states. In practice, we could choose $O={\psi }_{{AB}}$ and the witness operator can effectively detect entanglement with white noise.

Given the witness operator, a practical scheme is to decompose the operator into local observables. This is particularly important for detecting multipartite entanglement because it is hard to measure a general multipartite observable. Efficient witnesses have been constructed for several typical classes of states including the W state and general graph states. In the next section, we show how similar strategies could be extended to efficient channel entanglement detection.

3. Channel entanglement detection

3.1. Bipartite channels

Since a quantum channel has both inputs and outputs, we first map a channel to a quantum state. In particular, consider a bipartite channel ${{ \mathcal N }}_{{AB}}$ that maps AB to $A^{\prime} B^{\prime} $, we consider the maximally entangled input state ${{\rm{\Phi }}}_{{AA}}\otimes {{\rm{\Phi }}}_{{BB}}$ with ${\rm{\Phi }}={\sum }_{{ij}}| {ii}\rangle \langle {jj}| /d$ and d being the dimension of each subsystem [2325]. The output state$\begin{eqnarray}{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}={{ \mathcal N }}_{{AB}}({{\rm{\Phi }}}_{{AA}}\otimes {{\rm{\Phi }}}_{{BB}})\end{eqnarray}$is called the Choi state which is a one-to-one map between states and channels. The entanglement of the biparitite channel can be now reformulated via the entanglement of the Choi state.

A bipartite channel ${{ \mathcal N }}_{{AB}}$ is entangled if the Choi state ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}$ is entangled.

Similar results have been discussed in several works [2325] and we refer to appendix for the proof. Based on such a connection, we can now study the entanglement of channels via its Choi state. Focusing on entanglement detection, our task now becomes to find an observable W, such that $\mathrm{Tr}[W{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}]\geqslant 0$ for all separable channels ${ \mathcal N }$. Following the above results for quantum states, we can similarly introduces three types of witness operators for Choi states of channels. Consider the eigenvector $| \phi \rangle $ with a negative eigenvalue of ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}$, the witness operators is $W=| \phi \rangle \langle \phi {| }^{{{\rm{T}}}_{{AA}^{\prime} }}$.
Suppose ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}={\sum }_{k}{\lambda }_{k}{V}_{k}^{{AA}^{\prime} }\otimes {V}_{k}^{B^{\prime} B}$, the witness operator is $W={\mathbb{I}}-{\sum }_{k}{V}_{k}^{{AA}^{\prime} }\otimes {V}_{k}^{B^{\prime} B}$.
For any observable ${O}_{{AA}^{\prime} B^{\prime} B}$, we can construct a witness as $W=\alpha {\mathbb{I}}-{O}_{{AA}^{\prime} B^{\prime} B}$ with $\alpha ={\max }_{{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }},{ \mathcal N }\ {\rm{is\; separable}}}\ \mathrm{Tr}[{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}{O}_{{AA}^{\prime} B^{\prime} B}]$.
We will shortly show that we can realize the witness with quantum games consisting of proper input states, measurements, and payoffs. Next, we extend the discussion to the multipartite scenario.

3.2. Multipartite channel entanglement

We consider the entanglement of multipartite channels [40, 41]. Consider a channel ${{\rm{\Theta }}}_{n}$ that maps n systems $\{1,2,\ldots ,n\}$ to n systems $\{1^{\prime} ,2^{\prime} ,\ldots ,n^{\prime} \}$, it is fully separable when$\begin{eqnarray}{{\rm{\Theta }}}_{n}\left({\rho }_{\mathrm{1,2},\ldots ,n}\right)=\sum _{j}\left({\displaystyle \bigotimes }_{k=1}^{n}{X}_{k}^{j}\right){\rho }_{\mathrm{1,2},\ldots ,n}{\left({\displaystyle \bigotimes }_{k=1}^{n}{X}_{k}^{j}\right)}^{\dagger },\end{eqnarray}$where the Kraus operators satisfy ${\sum }_{i}{\left({\displaystyle \bigotimes }_{k=1}^{n}{X}_{{A}_{k}}^{j}\right)}^{\dagger }\otimes \left({\displaystyle \bigotimes }_{k=1}^{n}{X}_{{A}_{k}}^{j}\right)={{\mathbb{I}}}_{\mathrm{1,2},\ldots ,n}$. Otherwise, the channel is entangled. Furthermore, suppose we divide the n systems into two parts $\{S,\bar{S}\}$, the channel is called biseparable when it can be written as [11, 42]$\begin{eqnarray}{{\rm{\Theta }}}_{n}\left({\rho }_{\mathrm{1,2},\ldots ,n}\right)=\sum _{j}\left({X}_{S}^{j}\otimes {X}_{\bar{S}}^{j}\right){\rho }_{\mathrm{1,2},\ldots ,n}{\left({X}_{S}^{j}\otimes {X}_{\bar{S}}^{j}\right)}^{\dagger },\end{eqnarray}$where ${\sum }_{i}{\left({X}_{S}^{j}\otimes {X}_{\bar{S}}^{j}\right)}^{\dagger }\otimes \left({X}_{S}^{j}\otimes {X}_{\bar{S}}^{j}\right)={\mathbb{I}}$. When a channel is not biseparable under any bipartition, it is called genuinely entangled.

Based on the Choi state of the channel$\begin{eqnarray}{{\rm{\Phi }}}_{11^{\prime} ,22^{\prime} ,\ldots ,{nn}^{\prime} }^{{\rm{\Theta }}}={{\rm{\Theta }}}_{n}\left({{\rm{\Phi }}}_{11^{\prime} }\otimes ...\otimes {{\rm{\Phi }}}_{{nn}^{\prime} }\right),\end{eqnarray}$we can similarly relate the entanglement of ${{\rm{\Theta }}}_{n}$ to the entanglement of ${{\rm{\Phi }}}_{11^{\prime} ,22^{\prime} ,\ldots ,{nn}^{\prime} }^{{\rm{\Theta }}}$.

A multipartite channel ${{\rm{\Theta }}}_{n}$ is (genuinely) entangled if the Choi state ${{\rm{\Phi }}}_{11^{\prime} ,22^{\prime} ,\ldots ,{nn}^{\prime} }^{{\rm{\Theta }}}$ (genuinely) entangled.

Therefore, we could use techniques of detecting multipartite entanglement to detect channel entanglement. While the three entanglement detection methods work similarly for multipartite channels, how to make the detection to be efficient is in general a challenging task for multipartite channels.

3.3. Entanglement detection via quantum games

In the above discussion, the entanglement witness is constructed and applied with respect to the Choi state of the channel. While we could get the Choi state by inputting a maximally entangled state, we need to double the system size, making its implementation hard. Here, we show a different yet equivalent entanglement detection way via quantum games [4346].

A quantum game ${ \mathcal G }$ is defined by the tuple ${ \mathcal G }=(\{{\alpha }_{{ij}}\},\{{\rho }_{i}\},\{{O}_{j}\})$, where ${\rho }_{i}$ are input states, $\{{O}_{j}\}$ is a positive observable valued measures at the output, and ${\alpha }_{{ij}}\in {\mathbb{R}}$ are the real coefficients which define the particular game. The performance in the game ${ \mathcal G }$ enabled by a channel ${ \mathcal N }$ is quantified by the payoff function$\begin{eqnarray}{ \mathcal P }({ \mathcal N },{ \mathcal G })=\sum _{{ij}}{\alpha }_{{ij}}\mathrm{Tr}[{O}_{j}{ \mathcal N }({\rho }_{i})].\end{eqnarray}$Consider the bipartite channel ${{ \mathcal N }}_{{AB}}$ as an example, we have ${ \mathcal N }({\rho }_{i,{AB}})=d{\mathrm{Tr}}_{{AB}}[{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}({\rho }_{i,{AB}}^{{\rm{T}}}\otimes {I}_{A^{\prime} B^{\prime} })]$ according to the Choi–Jamiolkowski isomorphism. Then we have$\begin{eqnarray}\begin{array}{rcl}{ \mathcal P }({ \mathcal N },{ \mathcal G }) & = & \sum _{i,j}{\alpha }_{i,j}d\mathrm{Tr}\left[{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}\left({\rho }_{i,{AB}}^{{\rm{T}}}\otimes {O}_{j,A^{\prime} B^{\prime} }\right)\right],\\ & = & d\mathrm{Tr}[{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{{ \mathcal N }}W],\end{array}\end{eqnarray}$where the W operator is$\begin{eqnarray}W=\sum _{i,j}{\alpha }_{i,j}{\rho }_{i,{AB}}^{{\rm{T}}}\otimes {O}_{j,A^{\prime} B^{\prime} }.\end{eqnarray}$Therefore, for any witness operator W, we can decompose it as above and it corresponds to a quantum game [43]. Suppose the quantum game with a witness operator W is ${ \mathcal G }(W)$, then we can show that for any separable channel NAB we have$\begin{eqnarray}{ \mathcal P }({{ \mathcal N }}_{{AB}},{ \mathcal G }(W))\geqslant 0.\end{eqnarray}$In practice, we can equivalently realize the witness via a quantum game. Instead of witnessing the entanglement of the Choi state, we can apply the channel to a set of input states, measure the output, and linearly combine the measurement outcomes. The game payoff function plays a similar role of detecting channel entanglement.

4. Example

Now we show entanglement detection for several typical channels. We also note the following fact that local unitary operations before and after the channel does not change the entanglement.

Given a multipartite channel ${{\rm{\Theta }}}_{n}$ with local unitary ${U}_{1},{U}_{2},\ldots ,{U}_{n}$ and ${V}_{1},{V}_{2},\ldots ,{V}_{n}$, ${{\rm{\Theta }}}_{n}$ is entangled if $({U}_{1}\otimes {U}_{2}\otimes ...\otimes {U}_{n})\circ {{\rm{\Theta }}}_{n}\circ ({V}_{1}\otimes {V}_{2}\otimes ...\otimes {V}_{n})$ is entangled.

Therefore, any entanglement witness for a channel ${ \mathcal N }$ works similarly to other channels ${ \mathcal V }\circ { \mathcal N }\circ { \mathcal U }$ that are equivalent to ${ \mathcal N }$ under local unitary operations ${ \mathcal U }$ and ${ \mathcal V }$.

4.1. Bipartite channels

We first consider bipartite channels, specifically, the CNOT and SWAP gate under local depolarizing noise, as shown in figure 1. In particular the CNOT and SWAP gates are unitary$\begin{eqnarray}{U}_{\mathrm{CNOT}}=\left[\begin{array}{cccc}1 & 0 & 0 & 0\\ 0 & 1 & 0 & 0\\ 0 & 0 & 0 & 1\\ 0 & 0 & 1 & 0\end{array}\right],{U}_{\mathrm{SWAP}}=\left[\begin{array}{cccc}1 & 0 & 0 & 0\\ 0 & 0 & 1 & 0\\ 0 & 1 & 0 & 0\\ 0 & 0 & 0 & 1\end{array}\right],\end{eqnarray}$and the local depolarizing noise is$\begin{eqnarray}{{ \mathcal D }}_{p}(\rho )=(1-p)\rho +p{\mathbb{I}}/2.\end{eqnarray}$The noisy CNOT/SWAP channel is$\begin{eqnarray}{{ \mathcal N }}_{p,{AB}}({\rho }_{{AB}})={{ \mathcal D }}_{p,A^{\prime} }\otimes {{ \mathcal D }}_{p,B^{\prime} }\left(U({\rho }_{{AB}}){U}^{\dagger }\right),\end{eqnarray}$where U is either ${U}_{\mathrm{CNOT}}$ or ${U}_{\mathrm{SWAP}}$. Here we explicitly show the three entanglement witnesses for the CNOT gate and the result works analogy for the SWAP gate.

Figure 1.

New window|Download| PPT slide
Figure 1.The CNOT or SWAP gate with local depolarizing noise. Given maximally entangled input states ${{\rm{\Phi }}}_{{AA}}=| {\rm{\Phi }}\rangle {\left\langle {\rm{\Phi }}\right|}_{{AA}}$ and ${{\rm{\Phi }}}_{{BB}}=| {\rm{\Phi }}\rangle {\left\langle {\rm{\Phi }}\right|}_{{BB}}$, the output state corresponds to the Choi state of the noise channel. The task is to detect the entanglement of the output state between the bipartition between ${AA}^{\prime} $ and $B^{\prime} B$.


The Choi state of the CNOT gate is$\begin{eqnarray}\begin{array}{rcl}| {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}\rangle & = & {U}_{\mathrm{CNOT}}^{{AB}}| {{\rm{\Phi }}}_{{AA}}\rangle | {{\rm{\Phi }}}_{{BB}}\rangle ,\\ & = & \displaystyle \frac{1}{2}(| 0000\rangle +| 0011\rangle +| 1110\rangle +| 1101\rangle ),\end{array}\end{eqnarray}$and the density matrix is$\begin{eqnarray}{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}=| {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}\rangle \langle {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}| .\end{eqnarray}$The three witness operators could then be constructed accordingly. Consider the eigenvector with a negative eigenvalue of ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}$, the witness operators of the first method is ${W}_{\mathrm{CNOT},1}=| \phi \rangle \langle \phi {| }^{{{\rm{T}}}_{{AA}^{\prime} }}$ with$\begin{eqnarray}| \phi \rangle =\left(-| 0001\rangle -| 0010\rangle +| 1100\rangle +| 1111\rangle \right)/2.\end{eqnarray}$Suppose ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}={\sum }_{k}{\lambda }_{k}{V}_{k}^{{AA}^{\prime} }\otimes {V}_{k}^{B^{\prime} B}$, the witness operator of the second method is ${W}_{\mathrm{CNOT},2}={\mathbb{I}}-{\sum }_{k,{\lambda }_{k}\ne 0}{V}_{k}^{{AA}^{\prime} }\otimes {V}_{k}^{B^{\prime} B}$. We have four nonzero eigenvalues ${\lambda }_{1}={\lambda }_{2}={\lambda }_{3}={\lambda }_{4}=0.5$ with$\begin{eqnarray}\begin{array}{rcl}{V}_{1}^{{AA}^{\prime} } & = & \left(-{\mathbb{I}}-{\sigma }_{z}{\sigma }_{z}\right)/\sqrt{2},{V}_{1}^{B^{\prime} B}=(-{\mathbb{I}}-{\sigma }_{x}{\sigma }_{x})/\sqrt{2},\\ {V}_{2}^{{AA}^{\prime} } & = & \left({\mathbb{I}}{\sigma }_{z}+{\sigma }_{z}{\mathbb{I}}\right)/\sqrt{2},{V}_{2}^{B^{\prime} B}=\left(-{\sigma }_{y}{\sigma }_{y}+{\sigma }_{z}{\sigma }_{z}\right)/\sqrt{2},\\ {V}_{3}^{{AA}^{\prime} } & = & \left({\sigma }_{x}{\sigma }_{x}-{\sigma }_{y}{\sigma }_{y}\right)/\sqrt{2},{V}_{3}^{B^{\prime} B}=\left({\mathbb{I}}{\sigma }_{x}+{\sigma }_{x}{\mathbb{I}}\right)/\sqrt{2},\\ {V}_{4}^{{AA}^{\prime} } & = & \left({\sigma }_{x}{\sigma }_{y}+{\sigma }_{y}{\sigma }_{x}\right)/\sqrt{2},{V}_{4}^{B^{\prime} B}=\left(-{\sigma }_{y}{\sigma }_{z}-{\sigma }_{z}{\sigma }_{y}\right)/\sqrt{2}.\end{array}\end{eqnarray}$For any observable ${O}_{{AA}^{\prime} B^{\prime} B}$, we can construct a third witness as ${W}_{\mathrm{CNOT},3}=\tfrac{1}{2}{\mathbb{I}}-{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{CNOT}}$.

Given the witness operator, we can now construct the quantum game by decomposing the witness in the Pauli basis. In particular, we have the quantum games for ${W}_{\mathrm{CNOT},1}$ and ${W}_{\mathrm{CNOT},2}$ as shown in tables 1 and 2, respectively. We note that interestingly, even though the two witness operators ${W}_{\mathrm{CNOT},2}$ and ${W}_{\mathrm{CNOT},3}$ are constructed differently, we do have ${W}_{\mathrm{CNOT},2}=2\ast {W}_{\mathrm{CNOT},3}$. We note that in the quantum games for ${W}_{\mathrm{CNOT},1}$ and ${W}_{\mathrm{CNOT},2}$, we used Pauli matrix as input states for simplicity, which is not exactly correct. Nevertheless, we can solve the problem by decomposing each Pauli matrix as a linear combination of pure states. Furthermore, there may exist better decomposition of the witness operator when we consider general input states and measurements [44, 47].


Table 1.
Table 1.Quantum game with ${W}_{\mathrm{CNOT},1}$ for the noisy CNOT gate.
α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$
1${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$1${\mathbb{I}}$${\sigma }_{x}$${\mathbb{I}}$${\sigma }_{x}$
1${\mathbb{I}}$${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{y}$−1${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$
−1${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{x}$${\mathbb{I}}$−1${\sigma }_{x}$${\mathbb{I}}$${\sigma }_{x}$${\sigma }_{x}$
1${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{y}$${\sigma }_{y}$1${\sigma }_{x}$${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{z}$
1${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{x}$${\sigma }_{y}$1${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{x}$${\sigma }_{z}$
1${\sigma }_{y}$${\sigma }_{x}$${\sigma }_{y}$${\mathbb{I}}$1${\sigma }_{y}$${\mathbb{I}}$${\sigma }_{y}$${\sigma }_{x}$
1${\sigma }_{z}$${\sigma }_{y}$${\mathbb{I}}$${\sigma }_{y}$−1${\sigma }_{z}$${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$
1${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$${\mathbb{I}}$1${\sigma }_{z}$${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{x}$

New window|CSV


Table 2.
Table 2.Quantum game with ${W}_{\mathrm{CNOT},2}$ for the noisy CNOT gate.
α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$
14${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$−2${\mathbb{I}}$${\sigma }_{x}$${\mathbb{I}}$${\sigma }_{x}$
2${\mathbb{I}}$${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{y}$−2${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$
−2${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{x}$${\mathbb{I}}$−2${\sigma }_{x}$${\mathbb{I}}$${\sigma }_{x}$${\sigma }_{x}$
2${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{y}$${\sigma }_{y}$2${\sigma }_{x}$${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{z}$
2${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{x}$${\sigma }_{y}$2${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{x}$${\sigma }_{z}$
2${\sigma }_{y}$${\sigma }_{x}$${\sigma }_{y}$${\mathbb{I}}$2${\sigma }_{y}$${\mathbb{I}}$${\sigma }_{y}$${\sigma }_{x}$
2${\sigma }_{z}$${\sigma }_{y}$${\mathbb{I}}$${\sigma }_{y}$−2${\sigma }_{z}$${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$
−2${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$${\mathbb{I}}$−2${\sigma }_{z}$${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{x}$

New window|CSV

For the SWAP gate, its Choi state is$\begin{eqnarray}\begin{array}{rcl}| {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}\rangle & = & {U}_{\mathrm{SWAP}}^{{AB}}| {{\rm{\Phi }}}_{{AA}^{\prime} }\rangle | {{\rm{\Phi }}}_{B^{\prime} B}\rangle ,\\ & = & \displaystyle \frac{1}{2}(| 0000\rangle +| 0101\rangle +| 1010\rangle +| 1111\rangle ),\end{array}\end{eqnarray}$and the density matrix is$\begin{eqnarray}{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}=| {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}\rangle \langle {{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}| .\end{eqnarray}$The three witness operators could then be constructed accordingly. Consider the eigenvector with a negative eigenvalue of ${{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}$, the witness operators of the first method is ${W}_{\mathrm{SWAP},1}=\tfrac{1}{2}{(-| 0010\rangle +| 1000\rangle )(-\langle 0010| +\langle 1000| )}^{{{\rm{T}}}_{{AA}^{\prime} }}$. Interestingly, for the second and third method, we again have the same witness (with different but irrelevant normalization factor). In particular, we have ${W}_{\mathrm{SWAP},2}=6{W}_{\mathrm{SWAP},3}$ with ${W}_{\mathrm{SWAP},3}=\tfrac{1}{4}{\mathbb{I}}-{{\rm{\Phi }}}_{{AA}^{\prime} B^{\prime} B}^{\mathrm{SWAP}}$. We also convert the witness into quantum games. In particular, we have the quantum games for ${W}_{\mathrm{SWAP},1}$ and ${W}_{\mathrm{SWAP},2}$ as shown in table 3 and 4, respectively.


Table 3.
Table 3.Quantum game with ${W}_{\mathrm{SWAP},1}$ for the noisy SWAP gate.
α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$
1${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$1${\mathbb{I}}$${\sigma }_{z}$${\mathbb{I}}$${\mathbb{I}}$
1${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{z}$${\mathbb{I}}$1${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{z}$${\mathbb{I}}$
−1${\sigma }_{x}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{x}$−1${\sigma }_{x}$${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{x}$
−1${\sigma }_{x}$${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{x}$−1${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{x}$
1${\sigma }_{y}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{y}$1${\sigma }_{y}$${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{y}$
1${\sigma }_{y}$${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{y}$1${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{y}$
−1${\sigma }_{z}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{z}$−1${\sigma }_{z}$${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$
−1${\sigma }_{z}$${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{z}$−1${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$

New window|CSV


Table 4.
Table 4.Quantum game with ${W}_{\mathrm{SWAP},2}$ for the noisy SWAP gate.
α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$α${\rho }_{A}^{{\rm{T}}}$${\rho }_{B}^{{\rm{T}}}$${O}_{A^{\prime} }$${O}_{B^{\prime} }$
12${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$${\mathbb{I}}$−4${\mathbb{I}}$${\sigma }_{x}$${\sigma }_{x}$${\mathbb{I}}$
4${\mathbb{I}}$${\sigma }_{y}$${\sigma }_{y}$${\mathbb{I}}$−4${\mathbb{I}}$${\sigma }_{z}$${\sigma }_{z}$${\mathbb{I}}$
−4${\sigma }_{x}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{x}$−4${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{x}$
4${\sigma }_{x}$${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{x}$−4${\sigma }_{x}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{x}$
4${\sigma }_{y}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{y}$4${\sigma }_{y}$${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{y}$
−4${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{y}$4${\sigma }_{y}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{y}$
−4${\sigma }_{z}$${\mathbb{I}}$${\mathbb{I}}$${\sigma }_{z}$−4${\sigma }_{z}$${\sigma }_{x}$${\sigma }_{x}$${\sigma }_{z}$
4${\sigma }_{z}$${\sigma }_{y}$${\sigma }_{y}$${\sigma }_{z}$−4${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$${\sigma }_{z}$

New window|CSV

Consider a noisy CNOT and SWAP gate with different noise ratio, we show the three entanglement witness values in figure 2. Since the second and third methods give basically the same witness, we have normalized the witness value. For the noisy CNOT gate, the second and the third methods outperform the first method, whereas for the noisy SWAP gate, have the same effect under normalization.

Figure 2.

New window|Download| PPT slide
Figure 2.Entanglement witness values for the noisy CNOT and SWAP gates as a function of the noise parameter p. Since the witnesses have different normalization, we only plot different witness values under normalization. In particular, for the noisy CNOT gate, the second and third witnesses have the same value after proper normalization. For the noisy SWAP gate, they all have the same value after normalization.


4.2. Multipartite channels

Up to now, we have studied the effectiveness of the proposed detection methods and compare their performance for several typical bipiartite channels. Here we consider the entanglement of multipartite quantum channels, and use stabilizer witness to detect multipartite channels consisting of noisy CZ gates [48]. We consider a special circuit with two CZ gates in figure 3(a) and the results could be similarly generalized to larger circuits with more CZ gates. Using lemma 3, the Choi state ${{\rm{\Phi }}}_{{{AA}}_{1}{{BB}}_{1}{{CC}}_{1}}$ of the circuit could be mapped to a graph state $\left|{G}_{\mathrm{CZ}}\right\rangle $ (see figure 3(b)) with white noise on local system [49]. Therefore, we can use stabilizer witness to detect the entanglement of the graph state $\left|{G}_{\mathrm{CZ}}\right\rangle $ to study the entanglement of the noisy CZ multipartite channel [50]. The elements of the stabilizer for graph state $\left|{G}_{\mathrm{CZ}}\right\rangle $ are products of the operators$\begin{eqnarray}\begin{array}{l}{g}_{1}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {X}_{1}{Z}_{2},{g}_{2}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {Z}_{1}{X}_{2}{Z}_{4},\\ {g}_{3}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {X}_{3}{Z}_{4},{g}_{4}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {Z}_{2}{Z}_{3}{X}_{4}{Z}_{6},\\ {g}_{5}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {X}_{5}{Z}_{6},{g}_{6}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}:= {Z}_{4}{Z}_{5}{X}_{6}.\end{array}\end{eqnarray}$

Figure 3.

New window|Download| PPT slide
Figure 3.(a) An example quantum circuit consisting of two CZ gates with local depolarizing noise. The Choi state of (a) is equivalent to (b) the graph state $\left|{G}_{\mathrm{CZ}}\right\rangle $ up to local unitary rotation.


Then, we can consider the following stabilizer witness$\begin{eqnarray}{W}_{\left|{G}_{\mathrm{CZ}}\right\rangle }:= 3{\mathbb{I}}-2\left[\prod _{k=1,4,5}\displaystyle \frac{{g}_{k}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}+{\mathbb{I}}}{2}+\prod _{k=2,3,6}\displaystyle \frac{{g}_{k}^{\left(\left|{G}_{\mathrm{CZ}}\right\rangle \right)}+{\mathbb{I}}}{2}\right]\end{eqnarray}$for the graph state to detect the genuine entanglement of the channel. We can similarly convert the witness into a quantum game according to section 3.3. In particular, we apply the Hadamard gate on qubit $2,4,6$ and map the Pauli measurements on qubit $1,3,5$ as input states. The entanglement of the noisy CZ multipartite channel is shown in figure 4. We can clearly observe the existence of genuine entanglement whenever $p\lt 0.2$. We note that the method could be extended to quantum circuits consisting of multiple CZ gates. In the general case, we can similarly construct the stabilizer witness.

Figure 4.

New window|Download| PPT slide
Figure 4.Stabilizer witness value $\left\langle {W}_{\left|{G}_{\mathrm{CZ}}\right\rangle }\right\rangle $ as a function about the noise parameter p.


5. Conclusion

In this work, we have studied entanglement detection of quantum channels. By relating the channel entanglement to the entanglement of the corresponding Choi state, we exploit state entanglement detection methods for witnessing channel entanglement. Using the language of quantum games, we can further convert the witness operator as a quantum game of the channel. Based on the general result, we proposed three methods to construct witnesses that allow to detect entanglement of bipartite channels and compare their performance for noisy CNOT and SWAP channels. From these results, the three methods could become convenient tools for routine performance detection of bipartite quantum channels. We also introduced the definition of mulitipartite channel entanglement, noting that Choi state of quantum channels with CZ gates correspond to graph states. We can then use graph state witnesses to detect multipartite circuits consisting of CZ gates.

Appendix A. Proof of lemma 1

Here we prove that a bipartite channel is separable if its Choi state is separable. First, let ${ \mathcal N }\in \mathrm{CPTP}\left({A}_{0}{B}_{0}\to {A}_{1}{B}_{1}\right)$ be a bipartite channel. If ${ \mathcal N }$ is separable, it can be expressed as$\begin{eqnarray}{ \mathcal N }\left({\rho }_{{A}_{0}{B}_{0}}\right)=\displaystyle \sum _{i}\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right){\rho }_{{A}_{0}{B}_{0}}{\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right)}^{\dagger },\end{eqnarray}$where ${\sum }_{i}{\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right)}^{\dagger }\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right)={I}_{{A}_{0}{B}_{0}}$. We prove the two directions using the following two lemmas.

For a bipartite channel ${ \mathcal N }\in \mathrm{CPTP}\left({A}_{0}{B}_{0}\to {A}_{1}{B}_{1}\right)$, its Choi state is separable if ${ \mathcal N }$ is a separable channel.

If a bipartite channel ${ \mathcal N }\in \mathrm{CPTP}\left({A}_{0}{B}_{0}\to {A}_{1}{B}_{1}\right)$ is separable. Then, we have$\begin{eqnarray}\begin{array}{c}\begin{array}{l}{ \mathcal N }\left({{\rm{\Phi }}}_{{AA}_{0}}\otimes {{\rm{\Phi }}}_{{BB}_{0}}\right)\\ \,=\,\displaystyle \sum _{i}\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right){{\rm{\Phi }}}_{{AA}_{0}}\otimes {{\rm{\Phi }}}_{{BB}_{0}}{\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right)}^{\dagger }\\ \,=\,\displaystyle \sum _{i}\left({X}_{{A}_{0}}^{i}{{\rm{\Phi }}}_{{AA}_{0}}\otimes {Y}_{{B}_{0}}^{i}{{\rm{\Phi }}}_{{BB}_{0}}\right){\left({X}_{{A}_{0}}^{i}\otimes {Y}_{{B}_{0}}^{i}\right)}^{\dagger }\\ \,=\,\displaystyle \sum _{i}\left({X}_{{A}_{0}}^{i}{{\rm{\Phi }}}_{{AA}_{0}}{\left({X}_{{A}_{0}}^{i}\right)}^{\dagger }\right)\otimes \left({Y}_{{B}_{0}}^{i}{{\rm{\Phi }}}_{{BB}_{0}}{\left({Y}_{{B}_{0}}^{i}\right)}^{\dagger }\right).\end{array}\end{array}\end{eqnarray}$So Choi state of the bipartite channel ${ \mathcal N }$ is separable.

If Choi state ${{\rm{\Phi }}}_{{{AA}}_{1}{{BB}}_{1}}$ of a bipartite channel ${ \mathcal N }$ is separable, it can be expressed as$\begin{eqnarray}{{\rm{\Phi }}}_{{{AA}}_{1}{{BB}}_{1}}=\sum _{i}{p}_{i}{\varrho }_{i}^{{{AA}}_{1}}\otimes {\varrho }_{i}^{{{BB}}_{1}}.\end{eqnarray}$we assume that ${\varrho }_{i}^{{{AA}}_{1}}$ and ${\varrho }_{i}^{{{BB}}_{1}}$ are pure states. Hence$\begin{eqnarray}\begin{array}{rcl}{\varrho }_{i}^{{{AA}}_{1}} & = & \left|{\psi }_{i}\right\rangle {\left\langle {\psi }_{i}\right|}_{{{AA}}_{1}},\\ {\varrho }_{i}^{{{BB}}_{1}} & = & \left|{\psi }_{i}\right\rangle {\left\langle {\psi }_{i}\right|}_{{{BB}}_{1}},\end{array}\end{eqnarray}$where ${\left|{\psi }_{i}\right\rangle }_{{{AA}}_{1}}={\sum }_{j}{\lambda }_{{ij}}{\left|{\alpha }_{{ij}}\right\rangle }_{A}{\left|{\beta }_{{ij}}\right\rangle }_{{A}_{1}}$ and we can define ${\left|{\psi }_{i}\right\rangle }_{{{AA}}_{1}}$ similarly.

For a given bipartite channel ${ \mathcal N }\in \mathrm{CPTP}\left({A}_{0}{B}_{0}\to {A}_{1}{B}_{1}\right)$. ${ \mathcal N }$ is separable if its Choi state is separable.

We first assume that the input state is a product state, i.e. ${\rho }_{{AB}}={\rho }_{A}\otimes {\rho }_{B}$. According to the Choi–Jamiolkowski isomorphism, we have$\begin{eqnarray}\begin{array}{l}{ \mathcal N }({\rho }_{{AB}})={\mathrm{Tr}}_{{\rm{A}}\,{\rm{B}}}\left[{{\rm{\Phi }}}_{{{AA}}_{1}{{BB}}_{1}}\left({\rho }_{{AB}}^{{\rm{T}}}\otimes {{ \mathcal I }}_{{A}_{1}{B}_{1}}\right)\right]\\ \ =\ {\mathrm{Tr}}_{{\rm{A}}\,{\rm{B}}}\left[\sum _{i}{p}_{i}{\varrho }_{i}^{{{AA}}_{1}}\otimes {\varrho }_{i}^{{{BB}}_{1}}\left({\varrho }_{A}^{{\rm{T}}}\otimes {\varrho }_{B}^{{\rm{T}}}\otimes {{ \mathcal I }}_{{A}_{1}{B}_{1}}\right)\right]\\ \ =\ \sum _{i}{p}_{i}{\mathrm{Tr}}_{{\rm{A}}\,{\rm{B}}}\left[\left({\varrho }_{i}^{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right)\otimes \left({\varrho }_{i}^{{{BB}}_{1}}{\varrho }_{B}^{{\rm{T}}}\right)\right]\\ \ =\ \sum _{i}{p}_{i}{\mathrm{Tr}}_{{\rm{A}}}\left[{\varrho }_{i}^{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right]\otimes {\mathrm{Tr}}_{{\rm{B}}}\left[{\varrho }_{i}^{{{BB}}_{1}}{\varrho }_{B}^{{\rm{T}}}\right].\end{array}\end{eqnarray}$Note that ${\mathrm{Tr}}_{{\rm{A}}}\left[{\varrho }_{i}^{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right]$ can be written as$\begin{eqnarray}\begin{array}{l}{\mathrm{Tr}}_{{\rm{A}}}\left[{\varrho }_{i}^{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right]={\mathrm{Tr}}_{{\rm{A}}}\left[\left|{\psi }_{i}\right\rangle {\left\langle {\psi }_{i}\right|}_{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right]\\ \ =\ \sum _{{{jj}}^{{\prime} }}{\lambda }_{{ij}}{\lambda }_{{{ij}}^{{\prime} }}^{* }{\mathrm{Tr}}_{{\rm{A}}}\left[\left|{\alpha }_{{ij}}\right\rangle {\left\langle {\alpha }_{{{ij}}^{{\prime} }}\right|}_{A}{\varrho }_{A}^{{\rm{T}}}\right]\left|{\beta }_{{ij}}\right\rangle {\left\langle {\beta }_{{{ij}}^{{\prime} }}\right|}_{{A}_{1}}\\ \ =\ \sum _{{{jj}}^{{\prime} }}{\lambda }_{{ij}}{\lambda }_{{{ij}}^{{\prime} }}^{* }\left\langle {\alpha }_{{{ij}}^{{\prime} }}\right|{\varrho }_{A}^{{\rm{T}}}{\left|{\alpha }_{{ij}}\right\rangle }_{A}\left|{\beta }_{{ij}}\right\rangle {\left\langle {\beta }_{{{ij}}^{{\prime} }}\right|}_{{A}_{1}}\\ \ =\ \sum _{{{jj}}^{{\prime} }}{\lambda }_{{ij}}{\lambda }_{{{ij}}^{{\prime} }}^{* }{\varrho }_{{{ijij}}^{{\prime} }}^{A}\left|{\beta }_{{ij}}\right\rangle {\left\langle {\beta }_{{{ij}}^{{\prime} }}\right|}_{{A}_{1}},\end{array}\end{eqnarray}$where $\left\langle {\alpha }_{{{ij}}^{{\prime} }}\right|{\varrho }_{A}^{{\rm{T}}}{\left|{\alpha }_{{ij}}\right\rangle }_{A}={\varrho }_{{{ijij}}^{{\prime} }}^{A}$. We denote that ${X}_{A}^{i}={\sum }_{j}{\lambda }_{{ij}}\left|{\beta }_{{ij}}\right\rangle \left\langle {\alpha }_{{ij}}\right|$ and ${\left({X}_{A}^{i}\right)}^{+}={\sum }_{{j}^{{\prime} }}{\lambda }_{{{ij}}^{{\prime} }}^{* }\left|{\alpha }_{{{ij}}^{{\prime} }}\right\rangle \left\langle {\beta }_{{{ij}}^{{\prime} }}\right|$. Hence$\begin{eqnarray}\begin{array}{c}\begin{array}{rcl}{X}_{A}^{i}\varrho {\left({X}_{A}^{i}\right)}^{\dagger } & = & \displaystyle \sum _{{{jj}}^{{\rm{{\prime} }}}}{\lambda }_{{ij}}{\lambda }_{{{ij}}^{{\rm{{\prime} }}}}^{\ast }\left|{\beta }_{{ij}}\right. \rangle \left. \langle {\alpha }_{{ij}}\right|\varrho \left|{\alpha }_{{{ij}}^{{\rm{{\prime} }}}}\right. \rangle \left. \langle {\beta }_{{{ij}}^{{\rm{{\prime} }}}}\right|\\ & = & \displaystyle \sum _{{{jj}}^{{\rm{{\prime} }}}}{\lambda }_{{ij}}{\lambda }_{{{ij}}^{{\rm{{\prime} }}}}^{\ast }{\varrho }_{{{ijij}}^{{\rm{{\prime} }}}}\left|{\beta }_{{ij}}\right. \rangle \left. \langle {\beta }_{{{ij}}^{{\rm{{\prime} }}}}\right|,\end{array}\end{array}\end{eqnarray}$where $\left\langle {\alpha }_{{ij}}\right|\varrho \left|{\alpha }_{{{ij}}^{{\prime} }}\right\rangle ={\varrho }_{{{ijij}}^{{\prime} }}$. Therefore we have ${{\rm{Tr}}}_{{\rm{A}}}\left[{\varrho }_{i}^{{{AA}}_{1}}{\varrho }_{A}^{{\rm{T}}}\right]={X}_{A}^{i}\varrho {\left({X}_{A}^{i}\right)}^{\dagger }$ and similarly ${{\rm{Tr}}}_{{\rm{B}}}\left[{\varrho }_{i}^{{{BB}}_{1}}{\varrho }_{B}^{{\rm{T}}}\right]={X}_{B}^{i}\varrho {\left({X}_{B}^{i}\right)}^{\dagger }$ when we define ${X}_{B}^{i}$ accordingly. Finally we obtain$\begin{eqnarray}\begin{array}{c}\begin{array}{rcl}{ \mathcal N }({\rho }_{{AB}}) & = & \displaystyle \sum _{i}{p}_{i}({X}_{A}^{i}{\rho }_{A}{\left({X}_{A}^{i}\right)}^{\dagger })\otimes \left({X}_{B}^{i}{\rho }_{B}{\left({X}_{B}^{i}\right)}^{\dagger }\right)\\ & = & \displaystyle \sum _{i}{p}_{i}\left({X}_{A}^{i}\otimes {X}_{B}^{i}\right){\rho }_{{AB}}{\left({X}_{A}^{i}\otimes {X}_{B}^{i}\right)}^{\dagger }.\end{array}\end{array}\end{eqnarray}$For a general input state, we can always decompose it as a linear combination of product states (possibly with negative coefficients). Together with the linearity of the above equation, it is not hard to see that it also hold for any bipartite quantum state.

Appendix B. Sketch proof of lemma 2

The proof of lemma 2 follows naturally with the help lemma 1. First, we show that a separable multipartite channel is equivalent to a separable Choi state. In this case, we divide the parties into two partitions and regard the system as a bipartite one. Then we can exploit lemma 1 to prove the equivalence. The equivalence for genuine entanglement follow naturally.

Acknowledgments

We are grateful to Jinzhao Sun for helpful discussions. This work is supported by the National Natural Science Foundation of China under Grant Nos. 62 072 119 and 61 672 007, and Guangdong Basic and Applied Basic Research Foundation under Grant No. 2020A1515011180.


Reference By original order
By published year
By cited within times
By Impact factor

Bennett C H 1995 Phys. Today 48 24
DOI:10.1063/1.881452 [Cited within: 1]

Vedral V Plenio M B 1998 Phys. Rev. A 57 1619
DOI:10.1103/PhysRevA.57.1619

Plenio M B Virmani S S 2014 An introduction to entanglement theory
Quantum Information and CoherenceAndersson E Öhberg P Cham Springer 173 209

DOI:10.1007/978-3-319-04063-9_8 [Cited within: 1]

Bennett C H Wiesner S J 1992 Phys. Rev. Lett. 69 2881
DOI:10.1103/PhysRevLett.69.2881 [Cited within: 1]

Bennett C H Brassard G Crépeau C Jozsa R Peres A Wootters W K 1993 Phys. Rev. Lett. 70 1895
DOI:10.1103/PhysRevLett.70.1895 [Cited within: 1]

Ekert A K 1991 Phys. Rev. Lett. 67 661
DOI:10.1103/PhysRevLett.67.661 [Cited within: 1]

Shor P W 1994Proc. 35th Annual Symp. on Foundations of Computer ScienceIEEE 124 134
DOI:10.1109/SFCS.1994.365700 [Cited within: 1]

Horodecki M Horodecki P Horodecki R 1996 Phys. Lett. A 223 1
DOI:10.1016/S0375-9601(96)00706-2 [Cited within: 2]

Terhal B M 2000 Phys. Lett. A 271 319
DOI:10.1016/S0375-9601(00)00401-1 [Cited within: 1]

Wang B-H Xu H-R Campbell S Severini S 2015 Quantum Inf. Comput. 15 1109 1121
DOI:10.5555/2871363.2871365

Sperling J Vogel W 2013 Phys. Rev. Lett. 111 110503
DOI:10.1103/PhysRevLett.111.110503 [Cited within: 1]

Sen K Srivastava C Sen U 2021arXiv:2106.05796
[Cited within: 1]

Zyczkowski K Bengtsson I 2006arXiv:quant-ph/0606228


Hayashi M Ishizaka S Kawachi A Kimura G Ogawa T 2014 Introduction to Quantum Information Science Berlin Springer


Wang B-H 2020arXiv:2003.00607


Gühne O Tóth G 2009 Phys. Rep. 474 1
DOI:10.1016/j.physrep.2009.02.004 [Cited within: 3]

Chitambar E Gour G 2019 Rev. Mod. Phys. 91 025001
DOI:10.1103/RevModPhys.91.025001 [Cited within: 1]

Liu Y Yuan X 2020 Phys. Rev. Res. 2 012035(R)
DOI:10.1103/PhysRevResearch.2.012035

Liu Z-W Winter A 2019arXiv:1904.04201


Takagi R Regula B 2019 Phys. Rev. X 9 031053


Gour G 2019 IEEE Trans. Inf. Theory 65 5880
DOI:10.1109/TIT.2019.2907989

Takagi R Wang K Hayashi M 2020 Phys. Rev. Lett. 124 120502
DOI:10.1103/PhysRevLett.124.120502 [Cited within: 1]

Bäuml S Das S Wang X Wilde M M 2019arXiv:1907.04181
[Cited within: 5]

Gour G Scandolo C M 2020 Phys. Rev. Lett. 125 180505
DOI:10.1103/PhysRevLett.125.180505

Gour G Scandolo C M 2021 Phys. Rev. A 103 062422
DOI:10.1103/PhysRevA.103.062422 [Cited within: 4]

Yuan X Zeng P Gao M Zhao Q 2020arXiv:2012.02781


Regula B Takagi R 2021 Phys. Rev. Lett. 127 060402
DOI:10.1103/PhysRevLett.127.060402

Zhou H Gao T Yan F 2021arXiv:2103.09409
[Cited within: 1]

Peres A 1996 Phys. Rev. Lett. 77 1413
DOI:10.1103/PhysRevLett.77.1413 [Cited within: 2]

Rudolph O 2005 Quantum Inf. Process. 4 219
DOI:10.1007/s11128-005-5664-1 [Cited within: 2]

Chen K Wu L-A 2003 A Matrix Realignment Method for Recognizing Entanglement Paramus, NJ Rinton Press, Inc. 193 202
DOI:10.5555/2011534.2011535 [Cited within: 2]

Gottesman D 1996 Phys. Rev. A 54 1862
DOI:10.1103/PhysRevA.54.1862 [Cited within: 1]

Rains E M 1999 Phys. Rev. A 60 173
DOI:10.1103/PhysRevA.60.173 [Cited within: 1]

Bennett C H DiVincenzo D P Fuchs C A Mor T Rains E Shor P W Smolin J A Wootters W K 1999 Phys. Rev. A 59 1070
DOI:10.1103/PhysRevA.59.1070

Nielsen M A Chuang I 2010 Quantum Computation and Quantum Information Cambridge Cambridge University Press
DOI:10.1017/CBO9780511976667 [Cited within: 1]

Khatri S Wilde M M 2020arXiv:2011.04672
[Cited within: 1]

Kraus K Böhm A Dollard J D Wootters W 1983 States, Effects, and Operations: Fundamental Notions of Quantum Theory Berlin Springer
DOI:10.1007/3-540-12732-1 [Cited within: 1]

Chruściński D Sarbicki G 2014 J. Phys. A: Math. Theor. 47 483001
DOI:10.1088/1751-8113/47/48/483001 [Cited within: 1]

Barnett S M Phoenix S J 1992 Phys. Lett. A 167 233
DOI:10.1016/0375-9601(92)90196-S [Cited within: 1]

Nian-Quan J et al. 2010 Chin. Phys. Lett. 27 010302
DOI:10.1088/0256-307X/27/1/010302 [Cited within: 1]

Chen P-X Zhu S-Y Guo G-C 2006 Phys. Rev. A 74 032324
DOI:10.1103/PhysRevA.74.032324 [Cited within: 1]

Zhou Y Zhao Q Yuan X Ma X 2019 npj Quantum Inf. 5 1
DOI:10.1038/s41534-019-0200-9 [Cited within: 1]

Chen X Hu X Zhou D L 2017 Phys. Rev. A 95 052326
DOI:10.1103/PhysRevA.95.052326 [Cited within: 2]

Rosset D Buscemi F Liang Y-C 2018 Phys. Rev. X 8 021033
DOI:10.1103/PhysRevX.8.021033 [Cited within: 1]

Yuan X Liu Y Zhao Q Regula B Thompson J Gu M 2021 npj Quantum Inf. 7 108
DOI:10.1038/s41534-021-00444-9

Uola R Bullock T Kraft T Pellonpää J-P Brunner N 2020 Phys. Rev. Lett. 125 110402
DOI:10.1103/PhysRevLett.125.110402 [Cited within: 1]

Xu P Yuan X Chen L-K Lu H Yao X-C Ma X Chen Y-A Pan J-W 2014 Phys. Rev. Lett. 112 140506
DOI:10.1103/PhysRevLett.112.140506 [Cited within: 1]

Tóth G Gühne O 2005 Phys. Rev. A 72 022340
DOI:10.1103/PhysRevA.72.022340 [Cited within: 1]

Hein M Dür W Eisert J Raussendorf R Van Den Nest M Briegel H-J 2006 Entanglement in graph states and its applications
Quantum Computers, Algorithms and Chaos Amsterdam IOS Press 115 218

DOI:10.3254/978-1-61499-018-5-115 [Cited within: 1]

Hein M Eisert J Briegel H J 2004 Phys. Rev. A 69 062311
DOI:10.1103/PhysRevA.69.062311 [Cited within: 1]

相关话题/Detecting entanglement quantum