Abstract
Quantum entanglement is a key resource in quantum technology, and its quantification is a vital task in the current noisy intermediatescale quantum (NISQ) era. This paper combines hybrid quantumclassical computation and quasiprobability decomposition to propose two variational quantum algorithms, called variational entanglement detection (VED) and variational logarithmic negativity estimation (VLNE), for detecting and quantifying entanglement on nearterm quantum devices, respectively. VED makes use of the positive map criterion and works as follows. Firstly, it decomposes a positive map into a combination of quantum operations implementable on nearterm quantum devices. It then variationally estimates the minimal eigenvalue of the final state, obtained by executing these implementable operations on the target state and averaging the output states. Deterministic and probabilistic methods are proposed to compute the average. At last, it asserts that the target state is entangled if the optimized minimal eigenvalue is negative. VLNE builds upon a linear decomposition of the transpose map into Pauli terms and the recently proposed trace distance estimation algorithm. It variationally estimates the wellknown logarithmic negativity entanglement measure and could be applied to quantify entanglement on nearterm quantum devices. Experimental and numerical results on the Bell state, isotropic states, and Breuer states show the validity of the proposed entanglement detection and quantification methods.
Similar content being viewed by others
Introduction
It is widely believed that we are now in the noisy intermediatescale quantum (NISQ) era^{1}, where quantum computers with 50–100 qubits are available while noise in quantum gates severely limits the quantum circuits that can be executed reliably. It thus becomes important to make the best use of today’s NISQ devices to design practical applications. One promising scheme for nearterm quantum applications is the variational quantum algorithms (VQA)^{2}, which have been applied to solve many tasks including Hamiltonian ground and excited states preparation^{3,4}, quantum state distance estimation^{5,6}, and quantum data compression^{7,8,9}. These variational quantum algorithms involve evaluating and optimizing loss functions that depend on parameters in parameterized quantum circuits (PQC). They are regarded as wellsuited for execution on NISQ devices by combining quantum computers with classical computers. We refer the readers to^{10,11} for a detailed review on VQA.
Quantum entanglement^{12}, the most nonclassical manifestation of quantum mechanics, has been identified as invaluable resource enabling a tremendous number of tasks ranging from quantum information processing^{13,14}, quantum cryptography^{15,16}, quantum algorithms^{17,18}, quantum communication^{19}, to measurementbased quantum computing^{20,21}. As so, the ability to manipulate quantum entanglement^{12,22} is the cornerstone to achieve real applications of quantum technologies. A number of theoretical and experimental methods have been proposed in the past 20 years for entanglement detection and quantification^{12,23,24}. For example, entanglement can be detected via entanglement witnesses^{25,26}, Bell’s inequalities^{27}, realignment criterion^{28,29}, range criterion^{30}, and majorization criterion^{31}. These methods commonly assume that prior information about the target state is known. A direct way to obtain such information is to perform quantum state tomography and reconstruct the density matrix^{32,33}. However, tomography becomes unrealistic as the number of required measurement settings scales exponentially with the size of the system. Briefly speaking, though there are many methods proposed for detecting and quantifying quantum entanglement, they are not specially designed for nearterm quantum devices and thus are not directly applicable in most cases, rendering reliable detection and quantification of quantum entanglement on nearterm quantum devices a vital challenge. Recently there are a number of works aiming to overcome this challenge^{34,35,36,37}. The core idea of all these approaches is to perform measurements in randomly sampled bases, leading to ensembles of measurement outcomes whose statistical correlations provide a fingerprint of the system’s entanglement.
In this paper, we combine VQA and the quasiprobability decomposition technique^{38,39,40,41,42,43,44} to propose the variational entanglement detection (VED) and variational logarithmic negativity estimation (VLNE) algorithms, contributing new approaches to detect and quantify quantum entanglement on nearterm quantum devices, respectively. VED uses criteria based on positive maps as a bridge and works as follows. Given an unknown target bipartite quantum state, it firstly decomposes the chosen positive map into a linear combination of NISQ implementable quantum operations. Then, it variationally estimates the minimal eigenvalue of the final state, which is obtained by executing these quantum operations on the target state and averaging the output states. Two methods are proposed to compute the average: the first one averages the output states according to the quasiprobability distribution, and the second one estimates the average via the sampling technique and is probabilistic. At last, it asserts that the target state is entangled if the optimized minimal eigenvalue is negative. Following the idea of VED, VLNE variationally computes the wellknown lognegativity entanglement measure, building on a linear decomposition of the transpose map into Pauli terms and the recently proposed trace distance estimation algorithm. Experimental and numerical results reveal the validity of the proposed entanglement detection and quantification methods.
Results
Quantum entanglement detection
In this section, we integrate variational quantum algorithms with the quasiprobability decomposition technique^{38,39,40,41,42,43,44} to propose a bipartite entanglement detection framework specially designed for nearterm quantum devices, using positive map criterion as a bridge. For simplicity, we assume A and B are two nqubit quantum systems throughout this section. However, we remark that the proposed framework can be applied to bipartite systems with different dimensions directly.
Let Δ be a discrete set of quantum operations that are implementable in the nearterm quantum devices. For example, one may choose Δ to be the set of implementable operations introduced in^{42,43}. Alternatively, one may set Δ to be the set of Pauli channels induced by Pauli operators from the Pauli set [see Supplementary Note 1]. For a positive (but not completely positive) and tracepreserving map \({{{{\mathcal{N}}}}}_{B\to B}\), we assume that it can be decomposed w.r.t. Δ as
Note that such a decomposition always exists if Δ contains a universal basis^{42}. The tracepreserving condition imposes \({\sum }_{{{{\mathcal{O}}}}}{r}_{{{{\mathcal{O}}}}}=1\). We emphasize that there must exist negative coefficients \({r}_{{{{\mathcal{O}}}}}\) since otherwise, \({{{\mathcal{N}}}}\) is completely positive. Given a bipartite quantum state ρ_{AB}, we have
To see if ρ_{AB} can be detected by \({{{\mathcal{N}}}}\), i.e., if ρ_{AB} is entangled from \({{{\mathcal{N}}}}\)’s perspective, we need to check if the output state σ_{AB} has a negative eigenvalue or not. Denote by \({\lambda }_{\min }({\sigma }_{AB})\) the smallest eigenvalue of σ_{AB}. By the positive map criterion, if ρ_{AB} is separable, then it must hold that \({\lambda }_{\min }({\sigma }_{AB})\ge 0\). Equivalently, if \({\lambda }_{\min }({\sigma }_{AB}) \,< \, 0\), we safely conclude that ρ_{AB} is entangled and it can be detected by the positive map \({{{{\mathcal{N}}}}}_{B\to B}\). This highlights the importance of computing or estimating \({\lambda }_{\min }({\sigma }_{AB})\) in entanglement detection.
Deterministic detection
As we have argued, σ_{AB} cannot be obtained directly via \({{{\mathcal{N}}}}(\rho )\) since \({{{\mathcal{N}}}}\) does not represent a physically implementable quantum operation. Fortunately, the decomposition in Eq. (2) empowers us an effective way to simulate the role of \({{{\mathcal{N}}}}\) and reconstruct σ_{AB} as an average of a set of output states, obtained using quantum circuits implementable in nearterm devices. This decomposition technique, combined with the variational quantum algorithm, enables a general framework that estimates \({\lambda }_{\min }({\sigma }_{AB})\), whose value can witness the entanglement of the input state ρ_{AB}. We call this framework the variational entanglement detection (VED). The core idea is to use the linear decomposition in Eq. (2) of the target state σ_{AB} and the framework goes as follows. First of all, it holds that (see Supplementary Note 1)
where the minimization ranges over all pure bipartite quantum states \({\left\psi \right\rangle }_{AB}\) in AB. We use a variational quantum circuit with parameters α to prepare the test state \(\left\psi \right\rangle\). More precisely, we choose a parameterized quantum circuit ansatz that generates a unitary U(α) and prepares the test state via \(\left\psi \right\rangle =U({{{\boldsymbol{\alpha }}}}){\left0\right\rangle }^{\otimes 2n}\). Each inner product \(\left\langle \psi \right{{{\mathcal{O}}}}(\rho )\left\psi \right\rangle\) in Eq. (4) can be estimated via the canonical Swap Test subroutine^{45}, as both U(α) and \({{{\mathcal{O}}}}\) can be implemented in nearterm devices. However, this subroutine costs a total number of 4n + 1 qubits and requires a 4nqubit SWAP gate, which is resource consuming when n becomes large. Here we explore the special structure of the overlap \(\left\langle \psi \right{{{\mathcal{O}}}}(\rho )\left\psi \right\rangle\) and propose an qubit efficient estimating procedure which uses 2n qubits and avoids the use of expensive SWAP gate. First of all, notice that
where the second equality follows from the cyclic property of trace function. Since each \({{{\mathcal{O}}}}\) is implementable on nearterm quantum devices, we may use ρ_{AB} as input to the quantum circuit implementing \({{{\mathcal{O}}}}\), and estimate the overlap \(\left\langle \psi \right{{{\mathcal{O}}}}({\rho }_{AB})\left\psi \right\rangle\) using the quantum circuit illustrated in Fig. 1. The overlap is obtained by counting the relative frequency of the measurement outcome 0^{2n}. Then, we repeat the estimation procedure ∣Δ∣ times, where ∣Δ∣ is the size of Δ, to obtain the overlaps for different \({{{\mathcal{O}}}}\) in Eq. (4). With these data in hand, we compute the following loss function:
We remark that this loss function is a global cost since it requires measuring the expectation value of all zero results, which may lead to barren plateaus^{46}. We provide detailed discussions and potential solutions in the section “Resource cost and barren plateaus”. In particular, it would be interesting to adapt the technique invented in^{46} to define a local version for pursuing better scalability and trainability. At last, we perform gradientbased optimization methods including SGD^{47} and Adam^{48} to minimize the loss function L(α) by varying the parameters α, whose value will determine the separability of the input state ρ_{AB}. More precisely, if L(α) is negative, we conclude that ρ_{AB} is entangled, since by the positive map criterion, separable states cannot yield a negative spectrum.
Taking into account the noise in NISQ quantum devices, we may introduce a tolerance threshold δ > 0 so that L(α) < −δ implies the input state is entangled. This threshold δ can be set with prior knowledge about the noise characterization on the NISQ devices. What’s more, for the purpose of entanglement detection, it is unnecessary to minimize L(α) since the condition L(α) < 0 is sufficient to assert that the input state is entangled. Based on this observation, we can terminate the optimization procedure that minimizes the loss function L(α) in advance to save the optimization cost. It was heuristically observed that the loss function achieves lower values with noisefree training than with noisy training^{49,50,51}, where the intuition behind is that the cost landscape is flattened and hence gradient magnitudes are reduced due to the hardware noise^{52}. Based on this observation and the fact that separable states have positive eigenvalues in the positive map criteria, we conclude that the optimized loss function for separable states will always be positive, and thus our algorithm will not lead to falsepositive results.
The detailed VED framework is summarized in Algorithm 1 and illustrated in Fig. 2. We name it the deterministic VED to distinguish it from the probabilistic framework described in the next section.
Algorithm 1
Deterministic VED
1: Input: 2nqubit quantum state ρ_{AB}, decomposition in Eq. (1) of the positive map \({{{\mathcal{N}}}}\), parameterized quantum circuit U(α) with initial parameters α, and tolerance δ;
2: Initialize L(α) = 0;
3: for all \({{{\mathcal{O}}}}\in {{\Delta }}\) such that \({r}_{{{{\mathcal{O}}}}}\,\ne\, 0\) do
4: Apply U_{α} to \({\left0\right\rangle }^{\otimes 2n}\) and obtain test state \(\left\psi \right\rangle ={U}_{{{{\boldsymbol{\alpha }}}}}{\left0\right\rangle }^{\otimes 2n}\);
5: Input ρ_{AB} and compute the overlap \({c}_{{{{\mathcal{O}}}}}:= \left\langle \psi \right{{{\mathcal{O}}}}({\rho }_{AB})\left\psi \right\rangle\)
using the quantum circuit in Fig. 1;
6: Update the loss function \(L({{{\boldsymbol{\alpha }}}})=L({{{\boldsymbol{\alpha }}}})+{r}_{{{{\mathcal{O}}}}}{c}_{{{{\mathcal{O}}}}}\), where \({r}_{{{{\mathcal{O}}}}}\) is given by the decomposition in Eq. (1);
7: end for
8: Perform optimization methods to minimize L(α); terminate the optimization if the error tolerance is satisfied: L(α) < −δ;
9: Output “Entangled” if the optimized L(α) < −δ.
Probabilistic detection
In Algorithm 1, we have used a bruteforce approach, where we iterate over the set of implementable operations Δ, to estimate the loss function L(α). Actually, L(α) can be estimated in a probabilistic way using the sampling technique, by virtue of the quasiprobability decomposition in Eq. (1). This method would be beneficial when the number of decomposed operations in Eq. (1) with nonzero coefficients is large while the sampling cost is relatively low. Now we describe the sampling method accurately. First of all, notice that the decomposition in Eq. (1) induces a quasiprobability distribution \({\{{r}_{{{{\mathcal{O}}}}}\}}_{{{{\mathcal{O}}}}\in {{\Delta }}}\) over Δ. From this quasiprobability distribution, we can construct a probability distribution \({\{{p}_{{{{\mathcal{O}}}}}\}}_{{{{\mathcal{O}}}}\in {{\Delta }}}\) using the canonical technique, i.e.,
Substituting Eq. (9) into Eq. (8) yields
where \({\mathbb{E}}(X)\) denotes the expectation of the random variable X, and the expectation in Eq. (11) is evaluated w.r.t. the probability distribution \({\{{p}_{{{{\mathcal{O}}}}}\}}_{{{{\mathcal{O}}}}\in {{\Delta }}}\). Based on Eq. (11), we propose Algorithm 2, which can be viewed as a probabilistic version of Algorithm 1. In particular, Algorithm 2 replaces the bruteforce approach (Steps 3–7) in Algorithm 1 with the sampling approach, yielding a probabilistic algorithm as summarized in Algorithm 2.
Let’s analyze Algorithm 2 in depth. First, we remark that the obtained \(L^{\prime} ({{{\boldsymbol{\alpha }}}})\) in step 10 of Algorithm 2 is an unbiased estimator of true value L(α) due to Eq. (11). Second, since ∣L^{(m)}∣ ≤ γ, we can apply the Hoeffding's inequality^{53} to ensure that \(M=2{\gamma }^{2}\log (2/\varepsilon )/{\delta }^{2}\) number of samples would estimate the true value L(α) within error δ with success probability no less than 1−ε, i.e.,
This confirms the validity of the sampling procedure (steps 4–9) of Algorithm 2. We call γ the sampling cost since it determines M, the number of samples required to achieve the desired precision. At last, we examine the success probability of the algorithm, given the success probability condition in Eq. (12) of the sampling procedure. Assume the optimization procedure repeats K times. The overall success probability of Algorithm 2 is no less than 1−Kε, as a direct corollary of Eq. (12) and the union bound. That is to say, if Algorithm 2 outputs “Entangled”, ρ_{AB} is entangled with probability larger than 1−Kε.
To summarize, we have proposed two variational entanglement detection methods. Algorithm 1 is deterministic in the sense that whenever it outputs “Entangled”, one can safely assert that ρ_{AB} is entangled. On the other hand, Algorithm 2 is probabilistic in the sense that even if it outputs “Entangled”, one can only declare that ρ_{AB} is entangled with certain success probability. Nevertheless, when the number of decomposed operations in Eq. (1) with nonzero coefficients is large while the simulation cost γ is relatively low, the latter method may be beneficial. In this case, one can reduce the number of iterations via sampling and thus save computational resources. Algorithm 2 scarifies precision for efficiency in entanglement detection.
Algorithm 2
Probabilistic VED
1: Input: 2nqubit quantum state ρ_{AB}, decomposition in Eq. (1) of the positive map \({{{\mathcal{N}}}}\), parameterized quantum circuit U(α) with initial parameters α, error tolerance δ, and fail probability ε.
2: Initialize \(L^{\prime} ({{{\boldsymbol{\alpha }}}})=0\);
3: Compute γ defined in Eq. (9) and set \(M=2{\gamma }^{2}\log (2/\varepsilon )/{\delta }^{2}\);
4: for all m = 1, ⋯ , M do
5: Apply U_{α} to \({\left0\right\rangle }^{\otimes 2n}\) and obtain test state \(\left\psi \right\rangle ={U}_{{{{\boldsymbol{\alpha }}}}}{\left0\right\rangle }^{\otimes 2n}\);
6: Sample a quantum operation \({{{{\mathcal{O}}}}}^{(m)}\) from Δ according to the probability distribution \({\{{p}_{{{{\mathcal{O}}}}}\}}_{{{{\mathcal{O}}}}\in {{\Delta }}}\) in Eq. (9); Let r^{(m)} be the coefficient of \({{{{\mathcal{O}}}}}^{(m)}\) in Eq. (1);
7: Input ρ_{AB} and compute the overlap \({c}^{(m)}:= \left\langle \psi \right{{{{\mathcal{O}}}}}^{(m)}(\rho )\left\psi \right\rangle\) using the quantum circuit in Fig. 1;
8: Compute \({L}^{(m)}=\gamma {{\mathrm{sgn}}}\,({r}^{(m)}){c}^{(m)}\);
9: end for
10: Compute the loss function \(L^{\prime} ({{{\boldsymbol{\alpha }}}})=\frac{1}{M}\mathop{\sum }\nolimits_{m = 1}^{M}{L}^{(m)}\);
11: Perform optimization methods to minimize \(L^{\prime} ({{{\boldsymbol{\alpha }}}})\); terminate the optimization if the error tolerance is satisfied: \(L^{\prime} ({{{\boldsymbol{\alpha }}}}) < \delta\);
12: Output “Entangled” if the optimized \(L^{\prime} ({{{\boldsymbol{\alpha }}}}) < \delta\).
Prominent positive maps
In section “Quantum entanglement detection” we have outlined the general deterministic and probabilistic VED frameworks for detecting entanglement via positive map criterion. In this section, we elaborate on three prominent positive maps—the transpose map^{54}, the reduction map^{55}, and the enhanced reduction map^{56,57}—to illustrate how the deterministic VED framework works. We choose the set of NISQ implementable quantum operations Δ to be the set of Pauli channels induced by Pauli operators from the Pauli set P_{n}, i.e.,
For each of the three positive maps under consideration, we firstly decompose it w.r.t. Δ as in Eq. (1) and then adopt the variational framework summarized in Algorithm 1 to fulfill entanglement detection. However, we remind that not all positive maps can be decomposed w.r.t. the set of Pauli channels.
Here are remarks for the three criteria under consideration. First, the reduction criterion is strictly weaker than both the transpose criterion and the enhanced reduction criterion, in the sense that the states that can be detected by the first criterion can also be detected by the latter two criteria. Second, there is no inclusion relation between the transpose criterion and the enhanced reduction criterion. That is, there are states that can be detected by one but not by the other. As so, given an unknown state, one may execute VED twice. One adopts the PPT criterion, and the other adopts the enhanced reduction criterion. The state is necessarily entangled if at least one of these two VEDs outputs “Entangled”. We also show by example how VED works in qutrit systems in Supplementary Note 2, utilizing the Choi map^{58,59}.
PPT criterion
A necessary condition for entanglement detection is the positive partial transpose (PPT) criterion^{54}, which we briefly review as follows. Let ρ_{AB} be a bipartite quantum state. We can express it as
where \({\{\lefti\right\rangle \}}_{i}\) and \({\{\leftk\right\rangle \}}_{k}\) are the computational bases of A and B, respectively. Its partial transpose with respect to system B is defined as
where T_{B} denotes the transpose map on system B. The PPT criterion says that if ρ_{AB} is separable, then \({\rho }_{AB}^{{T}_{B}}\ge 0\). Conversely, the negative spectrum witnesses entanglement of ρ_{AB}. What’s more, the PPT criterion is not only necessary but also sufficient for separability of the 2 ⊗ 2 and 2 ⊗ 3 cases^{25,60,61}.
We begin with the twoqubit bipartite quantum state case. Notice that the qubit transpose map admits the following decomposition w.r.t. Δ specialized in Eq. (13):
where X, Y, Z are the Pauli matrices. The validity of this decomposition can be checked by direct calculation. Substituting Eq. (18) into Eq. (17), we obtain
where the quantum operation X_{B}ρ_{AB}X_{B} should be understood as (I_{A} ⊗ X_{B})ρ_{AB}(I_{A} ⊗ X_{B}), and similarly for Y_{B}ρY_{B} and Z_{B}ρZ_{B}. Adapting the decomposition in Eq. (20) into Algorithm 1, we successfully apply the proposed VED to accomplish the PPT criterion in the qubit case.
Now we show the above detection method can be generalized to the multiqubit bipartite quantum state case. Let B ≡ B_{1}B_{2} ⋯ B_{n} be a composite system with n qubits, i.e., B_{i} represents the ith qubit system. A key observation is that the transpose operation satisfies the tensor product property: transposing the composite system B is equivalent to transposing the local qubit systems B_{i} individually. More precisely,
where \({T}_{{B}_{i}}\) is the transpose operation on the ith qubit. Equations (21) and (18) together give T_{B} as a linear combination of 4^{n} Pauli channels in total. Using this decomposition, we may apply VED (Algorithm 1 or Algorithm 2) to accomplish the multiqubit PPT criterion deterministically or probabilistically.
Reduction criterion
In this section, we first review the reduction criterion^{55} and then propose a variational algorithm implementing this criterion within the VED framework. Let
which is known as the reduction map. The reduction criterion says that if a bipartite quantum state ρ_{AB} is separable, then it must hold that
Equivalently, if σ_{AB} has negative eigenvalues, then ρ_{AB} is entangled. It is based on this observation that our variational algorithm works.
To apply the framework in the section “Quantum entanglement detection”, we have to first decompose \({{{{\mathcal{R}}}}}_{B\to B}\) into a linear combination of Pauli channels. Indeed, we can do so since
where the second equality follows from the twirling property of Pauli channels^{62}, Exercise 4.7.3. Using this decomposition, we can call Algorithm 1 or Algorithm 2 to accomplish the reduction criterion. Specially, in the qubit case where n = 1, the reduction map is of the form
As one might see, deterministic VED using the reduction criterion is not efficient in the many qubits case since it has to compute exponentially many overlaps: for a 2nqubit bipartite quantum state, one has to compute about 4^{n} overlaps. Notice that the probabilistic VED using the reduction criterion is slightly better than the deterministic one since the sampling cost satisfies γ ≈ 2^{n}. The quasiprobability sampling method does not show notable advantages over the deterministic method for the positive maps used in our work. However, the probabilistic VED provides a different perspective to reduce the cost using the quasiprobability sampling technique and it may be useful for entanglement detection via other positive maps. In the section “VED based on reduction criterion without decomposition”, we also propose another entanglement detection method (cf. Algorithm 3) with better efficiency in measurement cost by exploring the simple structure of the reduction map in Eq. (22) and showcase the efficiency of Algorithm 3 compared to the regular VED using typical entangled states.
Enhanced reduction criterion
In this section, we consider an enhanced version of the reduction map^{56,57} for bipartite quantum states. This enhanced criterion is based on an elementary positive map which operates on state spaces with even dimension. It is known that the enhanced reduction criterion detects many bound entangled states (states that satisfy the PPT criterion). As before, we first review this enhanced reduction criterion and show how to combine it with the VED framework proposed in the section “Quantum entanglement detection” to detect entanglement.
Define the following antisymmetric unitary in an nqubit Hilbert space:
where antidiag means antidiagonal. For example, when n = 2, the corresponding antisymmetric unitary has the form
Indeed, one can check that the nqubit U_{a} can be decomposed w.r.t. the Pauli set as U_{a} = X ⊗ ⋯ ⊗ X ⊗ iY, where there are n−1 X operators in the tensor product. Based on U_{a}, we define the following map^{56}
where \({{{{\mathcal{R}}}}}_{B\to B}\) is the reduction map defined in Eq. (22) and T_{B} is the transpose map defined in Eq. (17). This map has been shown to be positive but not completely positive^{56}. What’s more, this map improves the reduction criterion and can detect bound entangled states that cannot be detected by the PPT criterion. Substituting the Pauli decomposition in Eq. (26) of \({{{\mathcal{R}}}}\) and the Pauli decomposition in Eq. (21) of T_{B} into Eq. (30) and regrouping the Pauli terms, we obtain a Pauli decomposition of \({{{\mathcal{K}}}}\), where there is a total number of 4^{n} Pauli terms. Using this decomposition, we can use VED (Algorithm 1 or Algorithm 2) to accomplish the enhanced reduction criterion.
Resource cost and barren plateaus
Note that another way to detect and quantify entanglement of a state ρ_{AB} is to obtain its density matrix via quantum state tomography^{63}. Full density matrix reconstruction of an unknown (n_{A} + n_{B})qubit state in the worstcase costs exponential copies of the state^{64,65}, e.g., \(\widetilde{{{\Omega }}}({4}^{{n}_{A}+{n}_{B}})\) measurement results are necessary to reconstruct a matrix close to ρ in terms of trace distance^{65}. Using the learned density matrix, we can either numerically apply a positive map on it or compute the fidelity between ρ_{AB} and any entangled target states. However, such methods are resourcedemanding compared to the VED framework.
To use the decomposed maps for entanglement detection on the state ρ_{AB}, we can apply them either to subsystem A or to subsystem B, which requires \({{{\rm{poly}}}}(D){4}^{\min \{{n}_{A},{n}_{B}\}}\) measurement results with circuit depth D in optimization loops. Under the assumption that the PQC could be well trained, our method is considerably better than the state tomography method. The barren plateaus phenomena might weaken the advantage of our method over the state tomography in terms of the measurement cost. However, for largescale quantum systems, our method could work in the proof of concept while computing the minimum eigenvalue in the tomography method is extremely difficult. We further elaborate the barren plateaus problem from different aspects. In particular, methods based on the state tomography need vast memory to store and process the density matrix on a classical computer, which are unbearably resourcedemanding as the scale of the number of qubits increases. The VED framework, on the other hand, does not require such classical memory and postprocessing.
As our current methods use a global cost function and choose a hardwareefficient ansatz, it is possible that VED exhibits a barren plateau, resulting an exponentially suppressed gradient with respect to the problem dimension^{66}. Under this circumstance, there exists a vast flat area on the loss/optimization landscape. This phenomenon is known as the barren plateau (BP) and is independent of the optimizer utilized, meaning that a gradientfree optimizer would not help in mitigating this phenomenon^{67}. Furthermore, noise and entanglement could also induce BP^{52,68}.
In order to mitigate BP, one can adopt the following strategies: variable structure ansatzes^{69,70,71}, layerwise learning^{72}, metalearning^{73}, and parameter initialization and parameter correlation strategies^{74,75}. Enormous evidences show that a local cost function could help mitigate BP by extending the trainable circuit depth to a shallow level \({{{\mathcal{O}}}}(\log (n))\)^{46}. What’s more, we can suppress the hardware noise using various error mitigation techniques (see, e.g., refs. ^{41,42,76,77,78,79}), further improving the optimization results. By exploiting the above methods and continuous progresses in the areas of barren plateau and error mitigation, we believe that the effect and practicability of our VED framework could be further improved.
VED based on reduction criterion without decomposition
In the section “Prominent positive maps” we have shown how VED uses the reduction criterion to detect entanglement; it works by decomposing the reduction map \({{{\mathcal{R}}}}\) into a linear combination of Pauli channels and then variationally estimate the minimal eigenvalue of the averaged output state.
Here we propose another variational entanglement detection algorithm for the reduction criterion, motivated by the simple structure of the reduction map. The intuition behind this protocol is as follows. We know that ρ_{AB} is entangled if \({{{{\mathcal{R}}}}}_{B\to B}({\rho }_{AB})\) is not semidefinite positive. Using the variational characterization of a Hermitian operator’s minimum eigenvalue [see Supplementary Note 1], this means that
where the minimization ranges over all pure bipartite quantum states \(\left{\psi }_{AB}\right\rangle\) in system AB, \({\psi }_{AB}\equiv \left\psi \right\rangle \,{\left\langle \psi \right}_{AB}\) and \({\psi }_{B}:= {{{{\rm{Tr}}}}}_{A}{\psi }_{AB}\). From Equation (33), one can see that it suffices to compute the difference of two overlaps and then variationally estimate the minimal eigenvalue. The crucial point is that the number of overlaps is independent on the dimension of the nqubit system B. This detection method could save a large amount of computing resources when n becomes large. The improved VED based on the reduction criterion is summarized in Algorithm 3.
Algorithm 3
Improved VED based on reduction criterion
1: Input: 2nqubit quantum state ρ_{AB}, parameterized quantum circuit U(α) with initial parameters α, and tolerance δ;
2: Apply U(α) to \({\left00\right\rangle }_{AB}\) on system AB and obtain the test state \({\left\psi \right\rangle }_{AB}=U({{{\boldsymbol{\alpha }}}}){\left00\right\rangle }_{AB}\);
3: Compute the overlap between state ψ_{B} and ρ_{B} on subsystem B using the Swap Test and obtain \({c}_{1}={{{\rm{Tr}}}}[{\psi }_{B}{\rho }_{B}]\);
4: Apply U(α) to \({\left00\right\rangle }_{AB}\) on system AB and obtain the test state \({\left\psi \right\rangle }_{AB}=U({{{\boldsymbol{\alpha }}}}){\left00\right\rangle }_{AB}\);
5: Compute the overlap between state ψ_{AB} and ρ_{AB} using the Swap Test and obtain \({c}_{2}={{{\rm{Tr}}}}[{\psi }_{AB}{\rho }_{AB}]\);
6: Compute the loss function L(α) = c_{1}−c_{2};
7: Perform optimization methods to minimize L(α); terminate the optimization if the error tolerance is satisfied: L(α) < −δ.
8: Output “Entangled” if the optimized L(α) < −δ.
To showcase the advantage of the improved VED, we use the reduction map’s simple structure exploited by this algorithm to estimate \(\left\langle 0\right{{{{\mathcal{R}}}}}_{B\to B}({\rho }_{AB})\left0\right\rangle\) for \({\rho }_{AB}=\leftW\right\rangle \,\left\langle W\right\) being the fourqubit generalized W state, where
and both local systems have two qubits. The simulation results are summarized as box plots and compared to the estimation obtained by the Pauli channel decomposition of the reduction map in Fig. 3. When taking the same number of measurement shots, the method used by Algorithm 3 gives estimation results more concentrated in a range close to the ideal value than the Pauli channel decomposition method adopted by the standard VED. Thus, the improved VED can achieve the desired accuracy using fewer measurement shots, which means that fewer copies of the input quantum state are required.
We remark that this idea can also be adopted to improve the efficiency of VED using the enhanced reduction criterion.
Quantum entanglement quantification
One of the most wellknown entanglement measure is the logarithmic negativity^{80,81}, which has various applications in quantum information theory. For a bipartite state ρ_{AB}, its logarithmic negativity is defined as
Based on the recently developed nearterm quantum algorithm for trace distance estimation^{6} and the fact that E_{N} is defined via the transpose map T_{B}, we introduce a variational quantum algorithm to estimate E_{N} using an ancillary qubit system R. According to^{6,Corollary 3]}, it holds that
where \({Q}_{R}={{{{\rm{Tr}}}}}_{AB}{Q}_{ABR}\), \({Q}_{ABR}=U({\rho }_{AB}^{{T}_{B}}\otimes \left0\right\rangle \,{\left\langle 0\right}_{R}){U}^{{\dagger} }\), and the maximization ranges over all unitaries on the composite system ABR. Note that the second equality follows from the fact that T_{B} is tracepreserving. Following the idea of VED, we may decompose the transpose map T_{B} appeared in the operator Q_{ABR} (correspondingly, Q_{R}) into a linear combination of Pauli terms via Eqs. (20) and (21), compute the overlaps in Eq. (37) one by one, and then variationally estimate the maximal value. For illustrative purposes, we give Algorithm 4, the variational logarithmic negativity estimation (VLNE), as an example of estimating the logarithmic negativity of a twoqubit quantum state ρ_{AB}. However, we emphasize that method outlined in Algorithm 4 can be easily generalized to quantify multiqubit bipartite entanglement, as the transpose operation satisfies the preferable tensor product property in Eq. (21). What’s more, Algorithm 4 can be modified to use the sampling technique to estimate the average state, following the idea illustrated in Algorithm 2.
Algorithm 4
Variational logarithmic negativity estimation
1: Input: a 2qubit quantum state ρ_{AB} and parameterized circuit U_{ABR}(α) with initial parameters α;
2: Apply U_{ABR}(α), respectively, to
and obtain the states σ^{(0)}, σ^{(1)}, σ^{(2)}, σ^{(3)}, respectively.
3: Obtain \({o}_{j}={{{\rm{Tr}}}}[{\sigma }_{R}^{(j)}\left0\right\rangle \,{\left\langle 0\right}_{R}]\) for j = 0, 1, 2, 3 by measurements on system R.
4: Compute the loss function \({{{{\mathcal{L}}}}}_{1}:= ({o}_{0}+{o}_{1}{o}_{2}+{o}_{3})/2\).
5: Perform optimization methods to minimize \({{{{\mathcal{L}}}}}_{1}({{{\boldsymbol{\alpha }}}})\);
6: Compute \(\beta =2 {{{{\mathcal{L}}}}}_{1} 1\) as the estimated trace norm of \({\rho }_{AB}^{{T}_{B}}\);
7: Output \(\log \beta\) as the estimated logarithmic negativity.
One may also evaluate the entanglement measures^{82,83,84} based on the sandwiched Rényi relative entropy^{85,86} of order 1/2, making use of the recently proposed variational quantum algorithm estimating the fidelity between two quantum states^{6}.
Experiments on IBMQ
In this section, we discuss how to apply the VED framework to detect the twoqubit maximally entangled state \(\left{{\Phi }}\right\rangle := (\left00\right\rangle +\left11\right\rangle )/\sqrt{2}\) on IBMQ superconducting quantum hardware accessible to the public. The specific quantum device used is ibmqsantiago (5 qubits) with a quantum volume of 32. The positive map adopted here for detection purpose is the qubit reduction map \({{{{\mathcal{R}}}}}_{B\to B}\) defined in Eq. (22). After implementing the decomposed reduction map by 4 Pauli terms as Eq. (27), we use a parameterized quantum circuit U(α) to prepare four identical test states \({\psi }_{AB}({{{\boldsymbol{\alpha }}}})=U({{{\boldsymbol{\alpha }}}})\left00\right\rangle \,{\left\langle 00\right}_{AB}{U}^{{\dagger} }({{{\boldsymbol{\alpha }}}})\) and compute the loss function defined in Eq. (8). The PQC used is depicted in Fig. 4 with three randomly initialized parameters α = (α_{1}, α_{2}, α_{3}). During the optimization procedure, we apply the gradient descent algorithm to guide the learning process where the analytical gradient is calculated via the following parametershift rule^{87}:
Due to the finite sampling restriction for measurements, the optimization procedure essentially falls into the regime of Stochastic Gradient Descent (SGD)^{47}. The optimized loss values converges to \({{{{\mathcal{L}}}}}_{\min }\approx 0.43\). The gap between the experiment data and simulation result \({\lambda }_{\min }=0.5\) is due to various hardware noises on the ibmqsantiago processor. One can further adopt error mitigation methods^{10} to improve the result. This result proves the validity of our VED framework. Note that if we adopt the termination setup in Algorithm 1, it will require much fewer optimization iterations (4–5 rounds are sufficient) to obtain the detection result. As mentioned in ref. ^{88}, the communication bottleneck between the IBMQ hardware and classical optimizer blocks us from efficiently conducting experiments without any specified reservation. This leads to a 9minutes waiting time on average for each circuit evaluation from the IBMQ cloud service. We also implement the probabilistic detection Algorithm 2 for comparison. In the experiment, we set the backend to the Aer simulator which imitates the behavior of ibmqsantiago and choose ε = 0.01 and δ = 0.1. The experimental results reveal that the probabilistic VED achieves the same detection precision level compared to the deterministic VED. As comparison, we conduct numerical simulations on the Baidu Quantum Leaf platform^{89} and obtain similar results. We summarize the experimental and numerical results in Fig. 5.
Numerical simulations for entanglement detection
In this section, we carry out numerical simulations that apply VED to detect a variety of bipartite quantum states of interest to investigate the performance of VED and its motivated entanglement quantification algorithm. All simulations, including optimization loops, are conducted using the Paddle Quantum^{90} toolkit on the PaddlePaddle Deep Learning Platform^{91}.
Isotropic states
The nqubit isotropic state family (n is even and each local system has n/2qubits) is defined as^{92,Eq. (32)]}
where p ∈ [0, 1] is a parameter, Φ_{AB} is the nqubit maximally entangled state, and I_{AB} is the identity operator in AB in which A ≡ A_{1} ⋯ A_{n/2} and B ≡ B_{1} ⋯ B_{n/2}. The qubit systems \({\{{A}_{i}\}}_{i}\) are at Alice’s hand, while the qubit systems \({\{{B}_{i}\}}_{i}\) are at Bob’s hand. Intuitively, the isotropic state is a convex combination of the maximally entangled state Φ_{AB} and the maximally mixed state I_{AB}/2^{n}. It has been shown that \({\rho }_{{{{\boldsymbol{AB}}}}}^{\,{{\mbox{iso}}}\,}(p)\) is separable (w.r.t. the A: B cut) if and only if p ≤ 1/(2^{n/2} + 1)^{92}.
We numerically carry out Algorithm 1 together with the three prominent positive maps—the PPT criterion, the reduction criterion, and the enhanced reduction criterion—introduced in the section “Prominent positive maps”, using fourqubit isotropic states as inputs. The minimized loss values of these three maps obtained by our simulations on the isotropic states are represented by different markers in Fig. 6. As can be seen from this figure, VED can successfully identify the range of p for which the corresponding isotropic state can be detected by each positive map. The markers representing results from simulations fall on the lines that give the minimums of the loss function L(α), verifying the validity and viability of our VED framework. Note that for detecting entanglement in fourqubit isotropic states, all three maps are both necessary and sufficient. However, this phenomenon is not universal for all fourqubit states, as we shall see in the experiment using Breuer states.
To explore the barren plateau phenomenon that might be possible in our proposed VED algorithms, we carry out extensive numerical simulations on isotropic states by ranging the total number of qubits from 2 to 10 and fixing the noise parameter p to 0.7. In the following Table 1, we compare the average loss achieved by VED using the reduction criterion to the theoretical minimum, assuming that the number of shots does not scale with the number of qubits when estimating each overlap induced by the decomposition. As the number of qubits increases, there exhibits no large discrepancy between the estimated value by VED and the theoretical value. The scaling behavior of the optimized loss suggests that the VED algorithm is resilient to the barren plateau phenomenon when detecting bipartite states with a moderate number of qubits.
Breuer states
As we have mentioned in the section “Prominent positive maps”, there are states that can be detected by the enhanced reduction criterion yet cannot be detected by the PPT criterion. In this section, we use the proposed VED framework to numerically consolidate this statement. The fourqubit Breuer state family is defined as^{56}, Eq. (7).
where λ ∈ [0, 1] is a parameter, A ≡ A_{1}A_{2}, and B ≡ B_{1}B_{2}. The qubit systems A_{1} and A_{2} are at Alice’s hand while the qubit systems B_{1} and B_{2} are at Bob’s hand. It has been shown that ρ^{Breuer} is separable (w.r.t. the A: B cut) if and only if λ = 0 and can be detected by the enhanced reduction criterion^{56}. On the other hand, it has positive partial transpose if and only if λ ≤ 1/6^{56}, witnessing the power of the enhanced reduction criterion.
Following the same line of the case of the isotropic state, we carry out Algorithm 1 on the three criteria using fourqubit Breuer states as inputs. The minimized loss values obtained by our simulations on selected Breuer states are represented in Fig. 7 by markers, which again align with the theoretical lines. From the numeric results, we can see that while the enhanced reduction criterion is still necessary and sufficient for entanglement detection in the fourqubit Breuer states, neither the reduction criterion nor the PPT criterion can detect all entangled states in the Breuer state family, attesting the advantage of the enhanced reduction criterion in this case.
Numerical simulations for logarithmic negativity estimation
For simulations of variational entanglement quantification with logarithmic negativity, we adopt the hardware efficient ansatz used for trace distance estimation in ref. ^{6} where the circuit depth is 4. The simulations are carried out on twoqubit isotropic states, which is defined as
where Φ_{AB} is the twoqubit maximally entangled state. As shown in Fig. 8, the logarithmic negativity of a twoqubit isotropic state is positive if and only if its parameter p > 1/3, which matches the range of p where the corresponding isotropic states are entangled. The estimated logarithmic negativities by our method, which are represented by markers in Fig. 8, agree with the precisely calculated values given by the blue line.
Discussion
In this paper, we combined two techniques that find crucial applications in the NISQ quantum devices, the variational quantum algorithms and the quasiprobability decomposition method, to propose the variational entanglement detection (VED) and variational logarithmic negativity estimation (VLNE) frameworks, contributing feasible solutions to detect and quantify entanglement on nearterm devices. VED is built upon the positive map criterion and works as follows. Firstly, it decomposes a chosen positive map into a linear combination of NISQ implementable quantum operations. Then, it variationally estimates the minimal eigenvalue of the output state of some positive map acting on the target bipartite state. Two methods are proposed to generate the output state: the first one averaged the output states according to the quasiprobability distribution; the second one estimated the average via the sampling technique. At last, it asserts that the target state is entangled if the optimized minimal eigenvalue is negative, guaranteed by the positive map criterion. We elaborated three wellknown positive maps to illustrate how the VED framework is applied. Following the idea of VED, VLNE variationally computes the lognegativity entanglement measure, relying on a linear decomposition of the transpose map into Pauli terms and the recently proposed trace distance estimation algorithm. Experimental and numerical results on various bipartite states of interest have validated the proposed entanglement detection and quantification methods.
We expect that the VED framework can be upgraded to detect more entangled states. A crucial step towards this aim is to explore what kind of positive maps can be decomposed into a linear combination of Pauli channels. In the section “Quantum entanglement quantification” we showed by case how to variationally compute the lognegativity entanglement measure. It would be meaningful to design quantum algorithms to estimate other distancebased entanglement measures (see, e.g., refs. ^{93,94,95}).
Methods
Entanglement detection via positive maps
Let ρ_{AB} be a bipartite quantum state in the composite system AB. By definition ρ_{AB} is separable if it can be decomposed into a convex combination of tensor products of states describing local systems as^{96}
where p_{x} ≥ 0, ∑_{x}p_{x} = 1, and \({\{\left{\psi }_{x}\right\rangle \}}_{x}\) and \({\{\left{\phi }_{x}\right\rangle \}}_{x}\) are two sets of pure states in systems A and B, respectively. Otherwise, ρ_{AB} is entangled. Given the definition, it is natural to ask whether a given unknown bipartite quantum state is separable or entangled, known as the separability problem. This problem has been shown to be NPhard^{97,98}. There are many separability criteria that have been proposed to determine the separability or entanglement of bipartite quantum states as necessary conditions^{12,23}.
One of the most celebrated criteria for distinguishing separable states from entangled states is the positive map criterion. The core of the positive map criterion is that one subjects a subsystem of ρ_{AB} to a positive (but not completely positive) map \({{{{\mathcal{N}}}}}_{B\to B}\) that preserves the positivity of inputs. If ρ_{AB} is a product state, i.e., it is of the form ρ_{A} ⊗ ρ_{B}, the resulting operator \({\rho }_{A}\otimes {{{\mathcal{N}}}}({\rho }_{B})\) is still positive. Consequently, due to the linearity, an arbitrary separable state is mapped into some positive operator by this map. On the other hand, if ρ_{AB} is entangled, the output operator \({{{{\mathcal{N}}}}}_{B\to B}({\rho }_{AB})\) may be no longer positive; the transpose map is a prominent example^{54}. That is to say, the negative spectrum of the output operator indicates entanglement of the input state. Mathematically, the positive map criterion states that a bipartite quantum state ρ_{AB} is separable if and only if for arbitrary system C and arbitrary positive (but not completely positive) map \({{{{\mathcal{N}}}}}_{B\to C}\), it holds that \({{{{\mathcal{N}}}}}_{B\to C}({\rho }_{AB})\ge 0\)^{25}.
Despite its proven efficiency in entanglement detection, the positive map criterion is not directly applicable in practice, especially on recent NISQ devices. This is an immediate consequence of the fact that generically positive but not completely positive maps do not represent physically implementable quantum operations^{99} and thus cannot be realized in nearterm quantum devices. In this work, we showed how to overcome this obstacle and employ the positive map criterion to detect entanglement on NISQ devices.
Ansatz design
For the entanglement detection purpose, we adopt the circuit ansatz shown in Fig. 9 to prepare the test state \({\left\psi \right\rangle }_{AB}\). It consists of parameterized singlequbit gates U_{3}(θ, ϕ, φ) = R_{z}(ϕ)R_{y}(θ)R_{z}(φ) and circular layers of CNOT gates. Note that this ansatz can be easily generalized to multiqubit case.
Data availability
Data that support the plots and other findings of this study are available from the corresponding authors upon reasonable request.
Code availability
Code that supports the findings of this study is available from the corresponding authors upon reasonable request.
References
Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).
McClean, J. R., Romero, J., Babbush, R. & AspuruGuzik, A. The theory of variational hybrid quantumclassical algorithms. New J. Phys. 18, 023023 (2016).
Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014).
Nakanishi, K. M., Mitarai, K. & Fujii, K. Subspacesearch variational quantum eigensolver for excited states. Phys. Rev. Res. 1, 033062 (2019).
Cerezo, M., Poremba, A., Cincio, L. & Coles, P. J. Variational quantum fidelity estimation. Quantum 4, 248 (2020).
Chen, R., Song, Z., Zhao, X. & Wang, X. Variational quantum algorithms for trace distance and fidelity estimation. Quantum Sci. Technol. 7, 015019 (2021).
Romero, J., Olson, J. P. & AspuruGuzik, A. Quantum autoencoders for efficient compression of quantum data. Quantum Sci. Technol. 2, 045001 (2017).
Wan, K. H., Dahlsten, O., Kristjánsson, H., Gardner, R. & Kim, M. S. Quantum generalisation of feedforward neural networks. npj Quantum Inf. 3, 36 (2017).
Cao, C. & Wang, X. Noiseassisted quantum autoencoder. Phys. Rev. Appl. 15, 054012 (2021).
Endo, S., Cai, Z., Benjamin, S. C. & Yuan, X. Hybrid quantumclassical algorithms and quantum error mitigation. J. Phys. Soc. Jpn. 90, 032001 (2021).
Cerezo, M. et al. Variational quantum algorithms. Nat. Rev. Phys. 3, 1–29 (2020).
Horodecki, R., Horodecki, P., Horodecki, M. & Horodecki, K. Quantum entanglement. Rev. Mod. Phys. 81, 865 (2009).
Bennett, C. H. & Wiesner, S. J. Communication via oneand twoparticle operators on Einstein–Podolsky–Rosen states. Phys. Rev. Lett. 69, 2881 (1992).
Bennett, C. H. et al. Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels. Phys. Rev. Lett. 70, 1895 (1993).
Clauser, J. F., Horne, M. A., Shimony, A. & Holt, R. A. Proposed experiment to test local hidden variable theories. Phys. Rev. Lett. 24, 549 (1970).
Ekert, A. K. Quantum cryptography based on bell’s theorem. Phys. Rev. Lett. 67, 661 (1991).
Shor, P. W. Algorithms for quantum computation: discrete logarithms and factoring. In Proc. 35th Annual Symposium on Foundations of Computer Science, 124–134 (IEEE, 1994).
Jozsa, R. Entanglement and quantum computation. Preprint at https://arxiv.org/abs/quantph/9707034 (1997).
Bennett, C. H., Shor, P. W., Smolin, J. A. & Thapliyal, A. V. Entanglementassisted capacity of a quantum channel and the reverse shannon theorem. IEEE Trans. Inf. Theory 48, 2637–2655 (2002).
Raussendorf, R. & Briegel, H. J. A oneway quantum computer. Phys. Rev. Lett. 86, 5188 (2001).
Raussendorf, R., Browne, D. E. & Briegel, H. J. Measurementbased quantum computation on cluster states. Phys. Rev. A 68, 022312 (2003).
Zhao, X., Zhao, B., Wang, Z., Song, Z. & Wang, X. LOCCNet: a machine learning framework for distributed quantum information processing. npj Quantum Inf. 7, 159 (2021).
Gühne, O. & Tóth, G. Entanglement detection. Phys. Rep. 474, 1–75 (2009).
Friis, N., Vitagliano, G., Malik, M. & Huber, M. Entanglement certification from theory to experiment. Nat. Rev. Phys. 1, 72–87 (2019).
Horodecki, M., Horodecki, P. & Horodecki, R. Separability of mixed states: necessary and sufficient conditions. Phys. Lett. A 223, 1–8 (1996).
Gühne, O. & Lütkenhaus, N. Nonlinear entanglement witnesses. Phys. Rev. Lett. 96, 170502 (2006).
Bell, J. S. & Bell, J. S. Speakable and Unspeakable in Quantum Mechanics: Collected Papers on Quantum Philosophy (Cambridge University Press, 2004).
Chen, K. & Wu, L. A. A matrix realignment method for recognizing entanglement. Quantum Inf. Comput. 3, 193–202 (2003).
Rudolph, O. Further results on the cross norm criterion for separability. Quantum Inf. Process. 4, 219–239 (2005).
Horodecki, P. Separability criterion and inseparable mixed states with positive partial transposition. Phys. Lett. A 232, 333–339 (1997).
Nielsen, M. A. & Kempe, J. Separable states are more disordered globally than locally. Phys. Rev. Lett. 86, 5184 (2001).
D’Ariano, G. M., Paris, M. G. & Sacchi, M. F. Quantum tomography. Adv. Imaging Electron Phys. 128, 206–309 (2003).
Steffen, M. et al. Measurement of the entanglement of two superconducting qubits via state tomography. Science 313, 1423–1425 (2006).
Audenaert, K. M. R. & Plenio, M. B. When are correlations quantum?—Verification and quantification of entanglement by simple measurements. New J. Phys. 8, 266–266 (2006).
Zhou, Y., Zeng, P. & Liu, Z. Singlecopies estimation of entanglement negativity. Phys. Rev. Lett. 125, 1–39 (2020). 2004.11360.
Elben, A. et al. Mixedstate entanglement from local randomized measurements. Phys. Rev. Lett. 125, 200501 (2020).
Ketterer, A., Imai, S., Wyderka, N. & Gühne, O. Statistically significant tests of multiparticle quantum correlations based on randomized measurements. Preprint at https://arxiv.org/abs/2012.12176 (2020).
Buscemi, F., Dall’Arno, M., Ozawa, M. & Vedral, V. Direct observation of any twopoint quantum correlation function. Preprint at https://arxiv.org/abs/1312.4240 (2013).
Pashayan, H., Wallman, J. J. & Bartlett, S. D. Estimating outcome probabilities of quantum circuits using quasiprobabilities. Phys. Rev. Lett. 115, 070501 (2015).
Wang, X., Wilde, M. M. & Su, Y. Efficiently computable bounds for magic state distillation. Phys. Rev. Lett. 124, 090505 (2020).
Temme, K., Bravyi, S. & Gambetta, J. M. Error mitigation for shortdepth quantum circuits. Phys. Rev. Lett. 119, 180509 (2017).
Endo, S., Benjamin, S. C. & Li, Y. Practical quantum error mitigation for nearfuture applications. Phys. Rev. X 8, 031027 (2018).
Takagi, R. Optimal resource cost for error mitigation. Phys. Rev. Res. 3, 033178 (2020).
Jiang, J., Wang, K. & Wang, X. Physical implementability of linear maps and its application in error mitigation. Quantum 5, 600 (2021).
Buhrman, H., Cleve, R., Watrous, J. & De Wolf, R. Quantum fingerprinting. Phys. Rev. Lett. 87, 167902 (2001).
Cerezo, M., Sone, A., Volkoff, T., Cincio, L. & Coles, P. J. Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun. 12, 1–12 (2021).
Kiefer, J. & Wolfowitz, J. et al. Stochastic estimation of the maximum of a regression function. Ann. Math. Stat. 23, 462–466 (1952).
Kingma, D. P. & Ba, J. Adam: a method for stochastic optimization. Preprint at https://arxiv.org/abs/1412.6980 (2014).
Kübler, J. M., Arrasmith, A., Cincio, L. & Coles, P. J. An adaptive optimizer for measurementfrugal variational algorithms. Quantum 4, 263 (2020).
Arrasmith, A., Cincio, L., Somma, R. D. & Coles, P. J. Operator sampling for shotfrugal optimization in variational algorithms. Quantum 4, 263 (2020).
Fontana, E., Cerezo, M., Arrasmith, A., Rungger, I. & Coles, P. J. Optimizing parametrized quantum circuits via noiseinduced breaking of symmetries. Preprint at https://arxiv.org/abs/2011.08763 (2020).
Wang, S. et al. Noiseinduced barren plateaus in variational quantum algorithms. Nat. Commun. 12, 6961 (2021).
Hoeffding, W. Probability inequalities for sums of bounded random variables. In Fisher, N. I., Sen, P. K. (eds) The Collected Works of Wassily Hoeffding, 409–426 (Springer, 1994).
Peres, A. Separability criterion for density matrices. Phys. Rev. Lett. 77, 1413 (1996).
Cerf, N. J., Adami, C. & Gingrich, R. M. Reduction criterion for separability. Phys. Rev. A 60, 898–909 (1999).
Breuer, H.P. Optimal entanglement criterion for mixed quantum states. Phys. Rev. Lett. 97, 080501 (2006).
Hall, W. A new criterion for indecomposability of positive maps. J. Phys. A: Math. Gen. 39, 14119 (2006).
Choi, M.D. Positive semidefinite biquadratic forms. Linear Algebra Appl. 12, 95–100 (1975).
Choi, M.D. Some assorted inequalities for positive linear maps on c*algebras. J. Oper. Theory 4, 271–285 (1980).
Stormer, E. Positive linear maps of operator algebras. Acta Math. 110, 233–278 (1963).
Woronowicz, S. L. Positive maps of low dimensional matrix algebras. Rep. Math. Phys. 10, 165–183 (1976).
Wilde, M. M. Quantum Information Theory 2nd edn (Cambridge University Press, 2016).
Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information (Cambridge University Press, 2011).
O’Donnell, R. & Wright, J. Efficient quantum tomography. In Proc. 48th Annual ACM Symposium on Theory of Computing 899–912 (ACM, 2016).
Haah, J., Harrow, A. W., Ji, Z., Wu, X. & Yu, N. Sampleoptimal tomography of quantum states. IEEE Trans. Inf. Theory 63, 5628–5641 (2017).
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes. Nat. Commun. 9, 1–6 (2018).
Arrasmith, A., Cerezo, M., Czarnik, P., Cincio, L. & Coles, P. J. Effect of barren plateaus on gradientfree optimization. Quantum 5, 558 (2020).
Marrero, C. O., Kieferová, M. & Wiebe, N. Entanglementinduced barren plateaus. PRX Quantum 2, 040316 (2021).
Grimsley, H. R., Economou, S. E., Barnes, E. & Mayhall, N. J. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat. Commun. 10, 1–9 (2019).
Rattew, A. G., Hu, S., Pistoia, M., Chen, R. & Wood, S. A domainagnostic, noiseresistant, hardwareefficient evolutionary variational quantum eigensolver. Preprint at https://arxiv.org/abs/1910.09694 (2019).
Bilkis, M., Cerezo, M., Verdon, G., Coles, P. J. & Cincio, L. A semiagnostic ansatz with variable structure for quantum machine learning. Preprint at https://arxiv.org/abs/2103.06712 (2021).
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P. & Leib, M. Layerwise learning for quantum neural networks. Quantum Mach. Intell. 3, 1–11 (2021).
Verdon, G. et al. Learning to learn with quantum neural networks via classical neural networks. Preprint at https://arxiv.org/abs/1907.05415 (2019).
Grant, E., Wossnig, L., Ostaszewski, M. & Benedetti, M. An initialization strategy for addressing barren plateaus in parametrized quantum circuits. Quantum 3, 214 (2019).
Volkoff, T. & Coles, P. J. Large gradients via correlation in random parameterized quantum circuits. Quantum Sci. Technol. 6, 025008 (2021).
Li, Y. & Benjamin, S. C. Efficient variational quantum simulator incorporating active error minimization. Phys. Rev. X 7, 021050 (2017).
Kandala, A. et al. Error mitigation extends the computational reach of a noisy quantum processor. Nature 567, 491–495 (2019).
Zheng, M., Li, A., Terlaky, T. & Yang, X. A bayesian approach for characterizing and mitigating gate and measurement errors. Preprint at https://arxiv.org/abs/2010.09188 (2020).
Wang, K., Chen, Y.A. & Wang, X. Measurement error mitigation via truncated Neumann series. Preprint at https://arxiv.org/abs/2103.13856 (2021).
Vidal, G. & Werner, R. F. Computable measure of entanglement. Phys. Rev. A 65, 032314 (2002).
Plenio, M. B. Logarithmic negativity: a full entanglement monotone that is not convex. Phys. Rev. Lett. 95, 090503 (2005).
Chen, L., Aulbach, M. & Hajdušek, M. Comparison of different definitions of the geometric measure of entanglement. Phys. Rev. A 89, 042305 (2014).
Zhu, H., Hayashi, M. & Chen, L. Coherence and entanglement measures based on rényi relative entropies. J. Phys. A: Math. Theor. 50, 475303 (2017).
Wang, K., Wang, X. & Wilde, M. M. Quantifying the unextendibility of entanglement. Preprint at https://arxiv.org/abs/1911.07433 (2019).
MüllerLennert, M., Dupuis, F., Szehr, O., Fehr, S. & Tomamichel, M. On quantum Rényi entropies: a new generalization and some properties. J. Math. Phys. 54, 122203 (2013).
Wilde, M. M., Winter, A. & Yang, D. Strong converse for the classical capacity of entanglementbreaking and hadamard channels via a sandwiched Rényi relative entropy. Commun. Math. Phys. 331, 593–622 (2014).
Mitarai, K., Negoro, M., Kitagawa, M. & Fujii, K. Quantum circuit learning. Phys. Rev. A 98, 032309 (2018).
Abhijith, J. et al. Quantum algorithm implementations for beginners. Preprint at https://arxiv.org/abs/1804.03719 (2018).
Baidu Quleaf Simulator. https://github.com/baidu/QCompute (2020).
Paddle Quantum. https://github.com/paddlepaddle/Quantum (2020).
Ma, Y., Yu, D., Wu, T. & Wang, H. PaddlePaddle: an opensource deep learning platform from industrial practice. Front. Data Comput. 1, 105–115 (2019).
Horodecki, M. & Horodecki, P. Reduction criterion of separability and limits for a class of distillation protocols. Phys. Rev. A 59, 4206 (1999).
Wang, X. & Wilde, M. M. Cost of quantum entanglement simplified. Phys. Rev. Lett. 125, 040502 (2020).
Rains, E. M. A semidefinite program for distillable entanglement. IEEE Trans. Inf. Theory 47, 2921–2933 (2001).
Wang, X. & Duan, R. Improved semidefinite programming upper bound on distillable entanglement. Phys. Rev. A 94, 050301 (2016).
Werner, R. F. Quantum states with Einstein–Podolsky–Rosen correlations admitting a hiddenvariable model. Phys. Rev. A 40, 4277 (1989).
Gurvits, L. Classical deterministic complexity of Edmonds’ problem and quantum entanglement. In Proc. 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, USA 10–19 (ACM Press, New York, NY, USA, 2003).
Gharibian, S. Strong NPhardness of the quantum separability problem. Quantum Inf. Comput. 10, 343–360 (2010).
Kraus, K. States, Effects, and Operations. (SpringerVerlag, Berlin, 1983).
Acknowledgements
We thank Runyao Duan for helpful suggestions. X.W. would like to thank Youle Wang for useful discussions. Part of this work was done when Z.S. and X.Z. were research interns at Baidu Research.
Author information
Authors and Affiliations
Contributions
X.W. formulated the initial idea and the framework; K.W. and X.W. developed the theory; Z.S. and X.Z. developed the entanglement quantification method; Z.S., X.Z., and Z.W. performed the experiments and delivered the analysis. All coauthors contributed to the preparation of the manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare no competing interests.
Additional information
Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary information
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Wang, K., Song, Z., Zhao, X. et al. Detecting and quantifying entanglement on nearterm quantum devices. npj Quantum Inf 8, 52 (2022). https://doi.org/10.1038/s4153402200556w
Received:
Accepted:
Published:
DOI: https://doi.org/10.1038/s4153402200556w
This article is cited by

Quantum selfattention neural networks for text classification
Science China Information Sciences (2024)

XpookyNet: advancement in quantum system analysis through convolutional neural networks for detection of entanglement
Quantum Machine Intelligence (2024)

Variational quantum algorithms: fundamental concepts, applications and challenges
Quantum Information Processing (2024)

Noise effects on purity and quantum entanglement in terms of physical implementability
npj Quantum Information (2023)