pith. sign in

arxiv: 1101.2001 · v2 · pith:LZG46IWZnew · submitted 2011-01-11 · 🪐 quant-ph

Measure of genuine multipartite entanglement with computable lower bounds

classification 🪐 quant-ph
keywords entanglementmeasureboundslowermultipartitegenuinebroadcases
0
0 comments X
read the original abstract

We introduce an intuitive measure of genuine multipartite entanglement which is based on the well-known concurrence. We show how lower bounds on this measure can be derived that also meet important characteristics of an entanglement measure. These lower bounds are experimentally implementable in a feasible way enabling quantification of multipartite entanglement in a broad variety of cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Entanglement Certification $-$ From Theory to Experiment

    quant-ph 2019-06 unverdicted

    Reviews paradigmatic entanglement quantifiers and state-of-the-art detection/certification methods, with emphasis on assumptions about states and measurements.