Information theoretical perspective on the method of Entanglement Witnesses
Abstract
We frame entanglement detection as a problem of random variable inference to introduce a quantitative method to measure and understand whether entanglement witnesses lead to an efficient procedure for that task. Hence we quantify how many bits of information a family of entanglement witnesses can infer about the entanglement of a given quantum state sample. The bits are computed in terms of the mutual information and we unveil there exists hidden information not efficiently processed. We show that there is more information in the expected value of the entanglement witnesses, i.e. E[W]= W than in the sign of E[W]. This suggests that an entanglement witness can provide more information about the entanglement if for our decision boundary we compute a different functional of its expectation value, rather than sign(E [ W ]).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.