Preprint Article Version 3 Preserved in Portico This version is not peer-reviewed

Entanglement Monotones and Measures: An Overview

Version 1 : Received: 14 April 2017 / Approved: 17 April 2017 / Online: 17 April 2017 (11:01:38 CEST)
Version 3 : Received: 21 April 2017 / Approved: 21 April 2017 / Online: 21 April 2017 (08:47:32 CEST)

How to cite: Erol, V. Entanglement Monotones and Measures: An Overview. Preprints 2017, 2017040098. Erol, V. Entanglement Monotones and Measures: An Overview. Preprints 2017, 2017040098.


Quantum information theory and quantum computing are theoritical basis of quantum computers. Thanks to entanglement, quantum mechanical systems are provisioned to realize many information processing problems faster than classical counterparts. For example, Shor’s factorization algorithm, Grover’s search algorithm, quantum Fourrier transformation, etc. Entanglement, is the theoretical basis providing the expected speedups. It can be view in bipartite or multipartite forms. In order to quantify entanglement, some measures are defined. On the other hand, a general and accepted criterion, which can measure the amount of entanglement of multilateral systems, has not yet been found. In this work, we make a short review of recent research on the topic entanglement monotones and measures with an analitical approach.


quantum information; entanglement; entaglement measures; entanglement monotones


Computer Science and Mathematics, Computer Science

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0

Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.