Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems

• URL: http://arxiv.org/abs/2204.06193v2
• Date: Wed, 20 Jul 2022 09:19:39 GMT
• Title: Search for an efficient entanglement witness operator for bound entangled states in bipartite quantum systems
• Authors: Shruti Aggarwal, Satyabrata Adhikari
• Abstract summary: Entanglement detection problem is one of the important problem in quantum information theory. There are some powerful entanglement detection criterion such as partial transposition criterion, realignment criterion. In this work, we take an analytical approach to construct a witness operator.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Entanglement detection problem is one of the important problem in quantum information theory. Gurvit showed that this problem is NP complete and thus this may be the possible reason that only one criterion is not sufficient to detect all entangled states. There are some powerful entanglement detection criterion such as partial transposition criterion, realignment criterion but it may not be possible to implement them successfully in the experiment. This situation can be avoided if the entanglement is detected through the construction of witness operator method. In this work, we take an analytical approach to construct a witness operator. To achieve this task, we first construct a linear map using partial transposition and realignment operation. Then we find some conditions on the parameters of the map for which the map represent a positive map. Further, we have constructed a Choi matrix corresponding to the map and have shown that it is not completely positive. We then construct an entanglement witness operator, which is based on the linear combination of the function of Choi matrix and the identity matrix and it can detect both NPTES and PPTES. Finally, we prove its efficiency by detecting several bipartite bound entangled states which were previously undetected by some well-known separability criteria. We also compared the detection power of our witness operator with three well-known powerful entanglement detection criteria, namely, dV criterion, CCNR criterion and the separability criteria based on correlation tensor (CT) proposed by Sarbicki et. al. and find that our witness operator detect more entangled states than these criterion.

Related papers

• Bisimulation Learning [55.859538562698496]
  We compute finite bisimulations of state transition systems with large, possibly infinite state space. Our technique yields faster verification results than alternative state-of-the-art tools in practice.
  arXiv  Detail & Related papers  (2024-05-24T17:11:27Z)
• Separability criterion using one observable for special states: Entanglement detection via quantum quench [0.0]
  We establish the class of states where measuring connected correlations in just $textitone$ basis is sufficient. We discuss the possibility of one observable entanglement detection in a variety of systems, including those without conserved charges.
  arXiv  Detail & Related papers  (2023-07-07T17:37:11Z)
• Physical realization of realignment criteria using structural physical approximation [0.0]
  Entanglement detection is an important problem in quantum information theory. Realignment criteria is a powerful tool for detection of entangled states in bipartite and multipartite quantum system.
  arXiv  Detail & Related papers  (2023-01-24T09:41:33Z)
• Separability criteria based on the Weyl operators [0.0]
  Entanglement as a vital resource for information processing can be described by special properties of the quantum state. We propose a new Bloch decomposition of the quantum state and study its separability problem.
  arXiv  Detail & Related papers  (2022-08-09T14:04:19Z)
• Bounding Counterfactuals under Selection Bias [60.55840896782637]
  We propose a first algorithm to address both identifiable and unidentifiable queries. We prove that, in spite of the missingness induced by the selection bias, the likelihood of the available data is unimodal.
  arXiv  Detail & Related papers  (2022-07-26T10:33:10Z)
• Nested Counterfactual Identification from Arbitrary Surrogate Experiments [95.48089725859298]
  We study the identification of nested counterfactuals from an arbitrary combination of observations and experiments. Specifically, we prove the counterfactual unnesting theorem (CUT), which allows one to map arbitrary nested counterfactuals to unnested ones.
  arXiv  Detail & Related papers  (2021-07-07T12:51:04Z)
• Orbital MCMC [82.54438698903775]
  We propose two practical algorithms for constructing periodic orbits from any diffeomorphism. We also perform an empirical study demonstrating the practical advantages of both kernels.
  arXiv  Detail & Related papers  (2020-10-15T22:25:52Z)
• Witness Operator Provides Better Estimate of the Lower Bound of Concurrence of Bipartite Bound Entangled States in $d_{1}\otimes d_{2}$ Dimensional System [0.0]
  It is known that the witness operator is useful in the detection and quantification of entangled states. This family of witness operators is then used to estimate the lower bound of concurrence of the detected mixed entangled states.
  arXiv  Detail & Related papers  (2020-10-10T15:50:17Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Generating and detecting bound entanglement in two-qutrits using a family of indecomposable positive maps [0.0]
  We propose an indecomposable positive map for two-qutrit systems. A corresponding witness operator is constructed and shown to be weakly optimal. We find a new entangled state which is not detectable by certain other well-known entanglement detection criteria.
  arXiv  Detail & Related papers  (2020-08-29T12:52:27Z)
• Tractable Inference in Credal Sentential Decision Diagrams [116.6516175350871]
  Probabilistic sentential decision diagrams are logic circuits where the inputs of disjunctive gates are annotated by probability values. We develop the credal sentential decision diagrams, a generalisation of their probabilistic counterpart that allows for replacing the local probabilities with credal sets of mass functions. For a first empirical validation, we consider a simple application based on noisy seven-segment display images.
  arXiv  Detail & Related papers  (2020-08-19T16:04:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.