Detecting Entanglement by State Preparation and a Fixed Measurement
Abstract
It is shown that a fixed measurement setting, e.g., a measurement in the computational basis, can detect all entangled states by preparing multipartite quantum states, called network states. We present network states for both cases to construct decomposable entanglement witnesses (EWs) equivalent to the partial transpose criteria and also non-decomposable EWs that detect undistillable entangled states beyond the partial transpose criteria. Entanglement detection by state preparation can be extended to multipartite states such as graph states, a resource for measurement-based quantum computing. Our results readily apply to a realistic scenario, for instance, an array of superconducting qubits. neutral atoms, or photons, in which the preparation of a multipartite state and a fixed measurement are experimentally feasible.
I Introduction
A set of observables, called entanglement witnesses (EWs), can distinguish entangled states from separable ones both theoretically and experimentally [1, 2]. EWs are a versatile tool to characterize entangled states in general, i.e., multipartite quantum systems in arbitrary dimensions [3, 4, 5, 6, 7]. They have also been developed for the verification of entanglement in a practical scenario where assumptions, e.g., measurement devices or dimensions of quantum systems, cannot be justified [8, 8, 9]. Remarkably, all entangled states can be verified in a fully device-independent manner [10]. Experimentally certified entangled states enable one to achieve quantum advantages, such as efficient computation [11], higher channel capacities [12, 13], and a higher level of security in cryptographic protocols [14, 15].
In a realistic experimental scenario for detecting entangled states, particularly in the era of noisy-intermediate-scale-quantum technologies, limitations exist in manipulating quantum systems, where imperfections introducing quantum errors are naturally present [16]. For instance, one may attempt to circumvent varying measurement settings in most of the physical systems, superconducting qubits, e.g., [17], and neutral atoms, e.g.,[18, 19], where a fixed measurement setting in the computational basis applies. Therefore, on the one hand, while noise is present in the current technologies, the certification of quantum properties such as entanglement is vital to achieving quantum advantages. However, on the other hand, for detecting entangled states, all of the schemes mentioned above relying on EWs ask experimenters to be able to handle experimental settings.
In addition, general measurements, i.e., non-projective positive-operator-valued-measures, are often essential to construct EWs. They can be realized after interactions between systems and auxiliary systems followed by projective measurements on the auxiliary ones [20], see also [21, 22]. However, such interactions and measurements are also noisy within the currently available quantum technologies. Noisy EWs lead to loopholes in the detection of entanglement. On top of that, there are also quantum systems that hardly interact with each other such as photons, for which thus measurement strategies are limited.
In this work, we establish a framework for detecting entangled states with a fixed measurement, say the -direction, by preparing multipartite states that we call network states. Similarly to measurement-based quantum computation that realizes arbitrary unitary transformations by state preparation, we show that entanglement witnesses (EWs) can be estimated by preparing multipartite states. We present the construction of network states for decomposable EWs, which are equivalent to the partial transpose criteria, and also for non-decomposable EWs that detect bound entangled states beyond the partial transpose criteria, such as the Bell-diagonal EWs [23, 24] from the Choi map [25] and its various generalizations [26], and the Breuer-Hall EW [27, 28]. Our results apply to multipartite systems: graph states [29], a resource for measurement-based quantum computing [30], can be detected by state preparation and a fixed measurement.
II Entangled states
Let us begin by summarizing EWs and collecting related results. Let denote an observable for bipartite systems on a Hilbert space where . An observable is an EW if we have, for some entangled state
where denotes the set of separable states. EWs can be extended to multipartite states and characterize their various properties, such as the -separability that characterizes -partite states, which are separable in -partite splittings. EWs can also be used to certify the fidelity in the state preparation [31]. We also emphasize that an EW corresponds to an observable: its experimental estimation concludes entangled states without state identification by quantum tomography.
One of the intriguing properties of entangled states is the irreversibility in manipulations of entanglement. Entangled states from which no entanglement can be extracted, though entanglement is needed for their preparation, are identified as undistillable or bound entangled states [32, 33]. Multipartite quantum states that remain positive after partial transpose (PPT) turn out to be undistillable. Remarkably, PPT entangled states can be used to activate other entangled states [34].
Then, non-PPT entangled states can be characterized by decomposable EWs that have a general form as follows,
Here denotes the partial transpose. Then, non-decomposable EWs, which cannot be in the form above, can detect PPT entangled states. In general, it is highly non-trivial to construct non-decomposable EWs, which are the main object in the mathematically challenging problem of classifying positive linear maps of Operator Algebras [35], see also Refs. [36, 37].

III Measurement-Based EWs
Let us now illustrate entanglement detection by state preparation with two-qubit EWs, in which all EWs are decomposable. We in particular consider an EW that detects a state , where four Bell states are written by and .
III.1 Two-qubit network states
To realize entanglement detection by state preparation, we introduce a multipartite state, called a network state, to construct an EW as follows,
(1) | |||||
which is located at sites , see Fig. 1. We then place a state of interest in at , denoted by . It holds that
(2) |
where . One can find the expectation value by estimating a singlet fraction,
(3) |
where the left-hand-side can be obtained by preparing a network state followed by a fixed measurement. Once a Bell measurement reports an outcome , a singlet fraction is estimated by finding the probability of having outcome on . In fact, an entangled state is detected if the probability, i.e., the left-hand-side in Eq. (3), is greater than , since for all separable states .
Experimental resources to obtain the left-hand side in Eq. (3) are summarized as follows. One prepares a four-partite network state . Note that for two-qubit cases, a network state in Eq. (1) is a variation of a Smolin state, a four-partite bound entangled state [38]. Note that a Smolin state has been realized with photonic qubits [39, 40, 41]. The detection scheme also needs a measurement in the basis , which is equivalent to the capability of realizing a controlled-NOT gate, a Hadamard gate, and a fixed-measurement in the -direction; see also Fig. 1. All these are compatible with the resources to realize measurement-based quantum computing.
III.2 EWs via entanglement activation
To show a general construction of network states for arbitrary EWs for high-dimensional quantum systems, let us first recall the result in Ref. [42] that all EWs can be expressed in the following form,
(4) |
for some multipartite network state and a parameter , where . Note that the parameter satisfies the condition, where is called a maximal singlet fraction,
(5) | |||||
where and . It is worth mentioning that EWs in Eq. (4) identify entangled states that activate a network state in the sense that
(6) |
In fact, all entangled states can be used to activate some other state: in Eq. (6) a state is entangled if and only if it can activate some other entangled state .
III.3 General construction of network states
We now present a construction of a network state for a given EW, see Eq. (4). For convenience, let us consider an EW on , and its decomposition may be found as follows,
so that one can choose normalized non-negative operators and constants such that,
(7) |
and
(8) |
for some and . One can find and are related as follow,
For a state it holds that
(9) |
For an entangled state detected by , i.e., , Eq. (9) shows that
(10) | |||||
The above may be rephrased by a teleportation protocol: once a measurement is successful, a state prepared at is sent to via a network state . Then, a singlet fraction is estimated and compared with , which is pre-determined by a network state to realize an EW. As mentioned, experimental resources for the realization contain preparing a network state and Bell measurements that require bi-interactions and a fixed local measurement setting; see also Fig. 1. In Appendix A, we reproduce a network state in Eq. (1) by applying the general construction above.
IV Examples
Let us then apply the general construction of network states and present network states for decomposable and non-decomposable EWs. We recall that identifying all EWs, equivalent to characterizing the set of separable states, is a challenging mathematical problem [35]. Its computational complexity also belongs to NP-Hard [43]. In what follows, we consider EWs known so far and show network states to construct them.
To this end, let denote a projection onto a Bell state, for , in a dimension ,
(11) |
where . Projectors onto symmetric and anti-symmetric subspaces are denoted by and , respectively,
(12) |
where is a flip operator [32]. Note that and . Interestingly, high-dimensional Bell states and projections onto symmetric and anti-symmetric subspaces suffice to construct network states for known non-decomposable maps.
IV.1 Decomposable EWs: the partial transposition
Firstly, we consider a decomposable EW for and , for which a network state can be constructed as follows. We write by where are eigenvalues of an EW and a network state is obtained as,
(13) | |||||
where superscript stands for systems and
In the other way around, from a network state in Eq. (13) one can reproduce a decomposable EW, see Eq. (4)
Hence, the partial transpose criteria [44] can be generally realized by preparing a network state with a fixed measurement.
As an instance, a network state for the decomposable and optimal EW can be found as
The network state above is known as a symmetric state being -invariant, and has been used to activate entanglement distillation with an infinitesimal amount of bound entanglement [45].
IV.2 Non-decomposable EWs
Secondly, to construct network states for non-decomposable EWs, we introduce paired Bell-diagonal (PBD) states as follows,
(14) |
where and .
IV.2.1 Bell-diagonal EWs
A network state in Eq. (14) can be used to estimate expectation values of Bell-diagonal EWs [23],
(15) |
Note that the Choi map and its generalizations are well-known instances. Then, PBD network states construct Bell-diagonal EWs as follows,
Hence, it is shown that all entangled states characterized by Bell-diagonal EWs can be detected by a fixed measurement and state preparation.
IV.2.2 Choi EWs
Instances of Bell-diagonal EWs for contain the Choi map [25] and its generalizations [26, 46], that detect PPT entangled states. As it is shown in Eq. (10), once a filtering operation with a PBD network state in Eq. (14) is successful, entangled states are concluded by finding a singlet fraction. For the case the Choi map, entangled states are detected if the singlet fraction is larger than . The proof is provided in Appendix B.
IV.2.3 Multipartite bound entangled states as a network state
We also observe that a PBD state for with corresponds to a Smolin state [38],
The state is invariant under permutations of and remains PPT in any bipartite splitting: it is called a four-partite unlockable and undistillable entangled state. A Smolin state can be used to activate distillation of entanglement.
A Smolin state can be generalized to higher dimensions, with ,
However, a Smolin state in a higher dimension no longer remains PPT in the bipartite splitting . The network state then realizes an EW,
which is decomposable. It is also an EW that is derived from a reduction map [47]. Note that a Smolin state corresponds to a network state that realizes a reduction EW for .
IV.2.4 EWs from the Breuer-Hall map
The Breuer-Hall (BH) map shown in Refs. [27, 28] derives highly non-trivial non-decomposable EWs,
(16) |
where is an skew-symmetric unitary operator satisfying and . Then the BH EW is obtained as follows,
(17) |
where . Note that the BH EW is optimal.
A network state for the BH EW is obtained as follows,
(18) | |||||
where
and . One can find that, from Eq. (8)
(19) |
Once a filtering operation in Eq. (10) is successful, entangled states are detected if a singlet fraction of a resulting state on is larger than .

IV.3 EWs for multipartite systems
Thirdly, entanglement detection by state preparation can be extended to multipartite quantum states. We here, in particular, consider graph states, a class of states as a resource for measurement-based quantum computing [30]. Let us again present an instance for a three-qubit graph state, a Greenberger–Horne–Zeilinger (GHZ) state [48], see Fig. 2. An EW to detect a GHZ state may be given as,
(20) |
A network state for an EW above can be constructed as,
(21) |
where ,
(22) |
with Pauli matrices and . It holds that
which shows detection of a genuinely multipartite entangled state by finding that the left-hand-side is greater than . Further generalization for detecting entangled -qubit graph states is provided in Appendix C.
IV.4 To construct non-decomposable EWs
Finally, let us investigate two entangled states defined by an EW. One denotes an entangled state detected by an EW, and the other realizing an EW by its preparation; see also Eq. (4). The result in Ref. [42] shows that an EW detects a set of entangled states that can activate its network state. Since a pair of PPT states cannot activate each other, either the states or must be non-PPT. Hence, a network state to detect a PPT entangled state should be non-PPT. We thus conclude that multipartite non-PPT entangled states can construct non-decomposable EWs, which are then highly non-trivial.
Conclusion
In conclusion, we have established the framework of detecting entangled states in terms of state preparation and a fixed measurement. We have presented the construction of network states that allow one to estimate EWs. Network states for EWs known so far are explicitly provided, both decomposable and non-decomposable cases. Our results shed new light on detecting entangled states: a measurement setting for estimating EWs is replaced by a state preparation and then simplified to a fixed one.
Acknowledgement
This work is supported by National Research Foundation of Korea (NRF-2021R1A2C2006309, NRF-2022M1A3C2069728) and the Institute for Information & Communication Technology Promotion (IITP) (the ITRC Program/IITP-2023-2018-0-01402). AB and DC were supported by the Polish National Science Center project No. 2018/30/A/ST2/00837.
References
- Terhal [2000] B. M. Terhal, Bell inequalities and the separability criterion, Physics Letters A 271, 319 (2000).
- Lewenstein et al. [2000] M. Lewenstein, B. Kraus, J. I. Cirac, and P. Horodecki, Optimization of entanglement witnesses, Phys. Rev. A 62, 052310 (2000).
- Horodecki et al. [1996] M. Horodecki, P. Horodecki, and R. Horodecki, Separability of mixed states: necessary and sufficient conditions, Physics Letters A 223, 1 (1996).
- Gühne and Tóth [2009] O. Gühne and G. Tóth, Entanglement detection, Physics Reports 474, 1 (2009).
- Horodecki et al. [2009] R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Quantum entanglement, Rev. Mod. Phys. 81, 865 (2009).
- Chruściński and Sarbicki [2014] D. Chruściński and G. Sarbicki, Entanglement witnesses: construction, analysis and classification, Journal of Physics A: Mathematical and Theoretical 47, 483001 (2014).
- Friis et al. [2019] N. Friis, G. Vitagliano, M. Malik, and M. Huber, Entanglement certification from theory to experiment, Nature Reviews Physics 1, 72 (2019).
- Branciard et al. [2013] C. Branciard, D. Rosset, Y.-C. Liang, and N. Gisin, Measurement-device-independent entanglement witnesses for all entangled quantum states, Phys. Rev. Lett. 110, 060405 (2013).
- Bae et al. [2011] J. Bae, W.-Y. Hwang, and Y.-D. Han, No-signaling principle can determine optimal quantum state discrimination, Phys. Rev. Lett. 107, 170403 (2011).
- Bowles et al. [2018] J. Bowles, I. Šupić, D. Cavalcanti, and A. Acín, Device-independent entanglement certification of all entangled states, Physical Review Letters 121, 180503 (2018).
- Grover [1997] L. K. Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79, 325 (1997).
- Quek and Shor [2017] Y. Quek and P. W. Shor, Quantum and superquantum enhancements to two-sender, two-receiver channels, Phys. Rev. A 95, 052329 (2017).
- Yun et al. [2020] J. Yun, A. Rai, and J. Bae, Nonlocal network coding in interference channels, Phys. Rev. Lett. 125, 150502 (2020).
- Acín et al. [2007] A. Acín, N. Brunner, N. Gisin, S. Massar, S. Pironio, and V. Scarani, Device-independent security of quantum cryptography against collective attacks, Phys. Rev. Lett. 98, 230501 (2007).
- Pironio et al. [2009] S. Pironio, A. Acín, N. Brunner, N. Gisin, S. Massar, and V. Scarani, Device-independent quantum key distribution secure against collective attacks, New Journal of Physics 11, 045021 (2009).
- Preskill [2018] J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).
- Krantz et al. [2019] P. Krantz, M. Kjaergaard, F. Yan, T. P. Orlando, S. Gustavsson, and W. D. Oliver, A quantum engineer’s guide to superconducting qubits, Applied Physics Reviews 6, 021318 (2019), https://doi.org/10.1063/1.5089550 .
- Henriet et al. [2020] L. Henriet, L. Beguin, A. Signoles, T. Lahaye, A. Browaeys, G.-O. Reymond, and C. Jurczak, Quantum computing with neutral atoms, Quantum 4, 327 (2020).
- Graham et al. [2022] T. M. Graham, Y. Song, J. Scott, C. Poole, L. Phuttitarn, K. Jooya, P. Eichler, X. Jiang, A. Marra, B. Grinkemeyer, M. Kwon, M. Ebert, J. Cherek, M. T. Lichtman, M. Gillette, J. Gilbert, D. Bowman, T. Ballance, C. Campbell, E. D. Dahl, O. Crawford, N. S. Blunt, B. Rogers, T. Noel, and M. Saffman, Multi-qubit entanglement and algorithms on a neutral-atom quantum computer, Nature 604, 457 (2022).
- Doran and Society [1994] R. Doran and A. Society, C*-algebras: 1943-1993 : a Fifty Year Celebration : AMS Special Session Commemorating the First Fifty Years of C*-algebra Theory, January 13-14, 1993, San Antonio, Texas, Contemporary mathematics (American Mathematical Society, 1994).
- Sparaciari and Paris [2013] C. Sparaciari and M. G. A. Paris, Canonical naimark extension for generalized measurements involving sets of pauli quantum observables chosen at random, Phys. Rev. A 87, 012106 (2013).
- Yordanov and Barnes [2019] Y. S. Yordanov and C. H. W. Barnes, Implementation of a general single-qubit positive operator-valued measure on a circuit-based quantum computer, Phys. Rev. A 100, 062317 (2019).
- Chruściński [2014] D. Chruściński, A class of symmetric bell diagonal entanglement witnesses—a geometric perspective, Journal of Physics A: Mathematical and Theoretical 47, 424033 (2014).
- Bera et al. [2022a] A. Bera, F. A. Wudarski, G. Sarbicki, and D. Chruściński, Class of bell-diagonal entanglement witnesses in : Optimization and the spanning property, Phys. Rev. A 105, 052401 (2022a).
- Choi [1975] M.-D. Choi, Completely positive linear maps on complex matrices, Linear Algebra and its Applications 10, 285 (1975).
- Ha and Kye [2011] K.-C. Ha and S.-H. Kye, One-parameter family of indecomposable optimal entanglement witnesses arising from generalized choi maps, Phys. Rev. A 84, 024302 (2011).
- Breuer [2006] H.-P. Breuer, Optimal entanglement criterion for mixed quantum states, Phys. Rev. Lett. 97, 080501 (2006).
- Hall [2006] W. Hall, A new criterion for indecomposability of positive maps, Journal of Physics A: Mathematical and General 39, 14119 (2006).
- Hein et al. [2004] M. Hein, J. Eisert, and H. J. Briegel, Multiparty entanglement in graph states, Phys. Rev. A 69, 062311 (2004).
- Raussendorf and Briegel [2001] R. Raussendorf and H. J. Briegel, A one-way quantum computer, Phys. Rev. Lett. 86, 5188 (2001).
- Gühne et al. [2007] O. Gühne, C.-Y. Lu, W.-B. Gao, and J.-W. Pan, Toolbox for entanglement detection and fidelity estimation, Phys. Rev. A 76, 030305 (2007).
- Dür et al. [2000a] W. Dür, J. I. Cirac, M. Lewenstein, and D. Bruß, Distillability and partial transposition in bipartite systems, Phys. Rev. A 61, 062313 (2000a).
- Shor et al. [2001] P. W. Shor, J. A. Smolin, and B. M. Terhal, Nonadditivity of bipartite distillable entanglement follows from a conjecture on bound entangled werner states, Phys. Rev. Lett. 86, 2681 (2001).
- Horodecki et al. [1999] P. Horodecki, M. Horodecki, and R. Horodecki, Bound entanglement can be activated, Physical review letters 82, 1056 (1999).
- Størmer [1963] E. Størmer, Positive linear maps of operator algebras, Acta Mathematica 110, 233 (1963).
- Bera et al. [2022b] A. Bera, G. Scala, G. Sarbicki, and D. Chruściński, Generalizing choi map in beyond circulant scenario, arXiv:2212.03807 (2022b).
- Bera et al. [2022c] A. Bera, G. Sarbicki, and D. Chruściński, A class of optimal positive maps in , arXiv:2207.03821 (2022c).
- Smolin [2001] J. A. Smolin, Four-party unlockable bound entangled state, Phys. Rev. A 63, 032306 (2001).
- Amselem and Bourennane [2009] E. Amselem and M. Bourennane, Experimental four-qubit bound entanglement, Nature Physics 5, 748 (2009).
- Lavoie et al. [2010] J. Lavoie, R. Kaltenbaek, M. Piani, and K. J. Resch, Experimental bound entanglement in a four-photon state, Phys. Rev. Lett. 105, 130501 (2010).
- Kaneda et al. [2012] F. Kaneda, R. Shimizu, S. Ishizaka, Y. Mitsumori, H. Kosaka, and K. Edamatsu, Experimental activation of bound entanglement, Phys. Rev. Lett. 109, 040501 (2012).
- Masanes [2006] L. Masanes, All bipartite entangled states are useful for information processing, Phys. Rev. Lett. 96, 150501 (2006).
- Gurvits [2003] L. Gurvits, Classical deterministic complexity of edmonds’ problem and quantum entanglement, in Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC ’03 (Association for Computing Machinery, New York, NY, USA, 2003) pp. 10–19.
- Peres [1996] A. Peres, Separability criterion for density matrices, Phys. Rev. Lett. 77, 1413 (1996).
- Vollbrecht and Wolf [2002] K. G. H. Vollbrecht and M. M. Wolf, Activating distillation with an infinitesimal amount of bound entanglement, Physical review letters 88, 247901 (2002).
- Chruściński and Sarbicki [2013] D. Chruściński and G. Sarbicki, Optimal entanglement witnesses for two qutrits, Open Systems & Information Dynamics 20, 1350006 (2013), https://doi.org/10.1142/S1230161213500066 .
- Horodecki and Horodecki [1999] M. Horodecki and P. Horodecki, Reduction criterion of separability and limits for a class of distillation protocols, Phys. Rev. A 59, 4206 (1999).
- Dür et al. [2000b] W. Dür, G. Vidal, and J. I. Cirac, Three qubits can be entangled in two inequivalent ways, Phys. Rev. A 62, 062314 (a 2000b).
- Jungnitsch et al. [2011] B. Jungnitsch, T. Moroder, and O. Gühne, Entanglement witnesses for graph states: General theory and examples, Phys. Rev. A 84, 032310 (2011).
Appendix A Entanglement detection by state preparation for two-qubit states
We here reproduce a network state for two-qubit EWs. Let and denote four Bell states. We show how to construct a network state for an EW
One may find a decomposition of the above EW in the following way
where two non-negative operators are obtained as and . A network state may be written as
for some positive constants and non-negative normalized operators . To realize entanglement detection of a state of interest using an entanglement witness , one may seek that satisfy
with , since all two-qubit entangled states are distillable. The goal is now to find the parameters and that satisfy the relation in the above. The left-hand-side (lhs) is given by
and the right-hand-side (rhs) by
where
From the lhs and the rhs, one can find that
from which
For convenience, we choose although it is not a unique choice. It follows that and . The consequence is that . Thus, we have
All these conclude a network state
Note that a network state for an EW is not unique.
Appendix B Network states for high-dimensional EWs
B.1 The framework
Recall that for a given EW , we are looking for a network state , which are separable in , satisfying the following condition:
(23) |
for some . It is easy to see that the following relation holds:
(24) | |||||
(25) |
where denotes the Bell measurements on both sides. The scheme can be understood as follows. First, a filtering operation teleports the state to , leaving a result state :
(26) |
Then the singlet fraction, or the overlap with the Bell state , of the resulting state is checked whether it is higher than or not.
The singlet fraction can also be estimated with a fixed measurement on individual quantum systems. The main idea is to place unitary interactions before a measurement. A -dimensional Hadamard gate and a -dimensional CNOT gate may be obtained as,
Note that a maximally entangled state can be generated, . Then, instead of a joint measurement, one can first apply to a resulting state and then perform a measurement in the computational basis. The probability of having outcomes gives the singlet fraction .
It holds that if and only if , which certifies that a state given in the beginning is entangled.
B.2 Decomposable EW
Consider a decomposable EW for and . Let where are eigenvalues of . Then, a network state for the EW is obtained as
(27) | |||||
with the threshold value ,
The superscript stands for the composite space for . From the equation
it holds that
(28) |
where .
Hence, the partial transpose criteria can be realized by preparing a network state in Eq. (27). In particular, a network state for the decomposable EW
(29) |
which is proportional to the flip operator that detects entangled Werner states, can be found as
(30) | |||||
Note that this network state is invariant under for any unitary operation . This network state is positive under the partial transpose , so it is undistillable. This state (30) has been used in the activation of non-PPT entangled states and proved to be PPT in [45].
B.3 Bell-diagonal EW
The next examples are Bell-diagonal witnesses , which are decomposable or non-decomposable depending on the parameter :
(31) |
where and . Note also that in Eq. (31) is an EW if a vector satisfies the cyclic inequalities in the following,
for all . The value is critical in implementing this witness with state preparation, as shown below. To construct a network state for a Bell-diagonal EW, we use paired Bell-diagonal (PBD) states:
(32) |
with the threshold value . Then the following holds:
where . It is possible to achieve with a separable state :
In particular, EWs from a reduction map and the Choi map can be written in the form of Bell-diagonal witness and can be implemented by preparing the corresponding PBD state. A decomposable EW from the reduction map corresponds to a Bell-diagonal EW with :
(33) | |||||
(34) |
with the threshold value .
The PBD state can be seen as a direct generalization of Smolin state [38] into -dimension. In , Smolin state is PPT in . However, the state is not PPT in higher dimensions in general. Smolin state in two-dimension is undistillable, but the distillability of in higher dimensions is unknown.
B.4 Breuer-Hall EW
The Breuer-Hall map [27, 28] finds an EW,
(37) |
where for any skew-symmetric unitary operator such that and . In even dimensions , one can set as
then it acts as where for even and for odd .
One can think of as a combination of reduction EW (33) and the flip operator from reduction map with additional . A network state for the BH EW is as follows,
(38) | |||||
with the threshold value , where , , and . One can show that
(39) |
which leads to
where .

Appendix C Entanglement witnesses for graph states
A graph is defined by a set of vertices and a set of edges :
Also define the neighborhood of vertex : , which is a set of vertices connected to vertex .
The generators and the projectors of a graph state determined by the graph are given by
(40) |
Note that the eigenvalue of is either 1 or -1, and the eigenvalue of is either 1 or 0. Now we define an orthonormal graph state basis consisting of states:
The states are the eigenstates of the generators and projectors:
(41) | |||||
(42) |
A graph state, denoted by , corresponds to an eigenstate with eigenvalue for all generators (). A state can be obtained by preparing placed at vertices in , and applying the controlled-Z () gate to all edges in , see Fig. 4.


For instance, the four-qubit linear cluster state can be defined by a graph , where and , see Fig. 5. The generators define graph states and . The graph state is detected by an EW in the following,
(43) |
where 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1010, 1100, 1110. Then the network state for this graph state can be constructed by
(44) |
It holds that
(45) |
where
Then a four-qubit entangled state is detected by when
(46) |
where the map is defined as,
A typical decomposable EW can be written in the following form [49]:
(47) |
where the set depends on . Then the network states for this entanglement witnesses are given by
(48) |
An -qubit entangled state is detected by when
(49) |
for
where denotes the set of vertices of the graph .
The overlap can be estimated with a fixed measurement on individual qubits. Note that a graph state is generated as follows, is obtained as . Then, the estimation of a singlet fraction can be achieved by applying an interaction to a resulting state and then performing a measurement in the computational basis. The probability of obtaining an outcome gives the overlap . It holds that if and only if , which certifies that is entangled.