libCreme: an optimization library for evaluating convex-roof entanglement measures

Roethlisberger, Beat and Lehmann, Joerg and Loss, Daniel. (2012) libCreme: an optimization library for evaluating convex-roof entanglement measures. Computer physics communications, Vol. 183, H. 1. pp. 155-165.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/dok/A6083506

Downloads: Statistics Overview


We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in such states is in general a non-trivial task requiring to solve a highly non-linear complex optimization problem. The algorithms provided here are able to achieve to do this for a large and important class of entanglement measures. The library is mostly written in the MATLAB programming language, but is fully compatible to the free and open-source OCTAVE platform. Some inefficient subroutines are written in C/C++ for better performance. This manuscript discusses the most important theoretical concepts and workings of the algorithms, focusing on the actual implementation and usage within the library. Detailed examples in the end should make it easy for the user to apply libCreme to specific problems. Program summary Program title: libCreme Catalogue identifier: AEKD_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEKD_v1_0.html Program obtainable from: CPC Program Library, Queen`s University, Belfast, N. Ireland Licensing provisions: GNU GPL version 3 No. of lines in distributed program, including test data, etc.: 4323 No. of bytes in distributed program, including test data, etc.: 70 542 Distribution format: tar.gz Programming language: Matlab/Octave and C/C++ Computer: All systems running Matlab or Octave Operating system: All systems running Matlab or Octave Classification: 4.9, 4.15 Nature of problem: Evaluate convex-roof entanglement measures. This involves solving a non-linear (unitary) optimization problem. Solution method: Two algorithms are provided: A conjugate-gradient method using a differential-geometric approach and a quasi-Newton method together with a mapping to Euclidean space. Running time: Typically seconds to minutes for a density matrix of a few low-dimensional systems and a decent implementatio of the pure-state entanglement measure. (C) 2011 Elsevier B.V. All rights reserved.
Faculties and Departments:05 Faculty of Science > Departement Physik
05 Faculty of Science > Departement Physik > Physik > Theoretische Physik Mesoscopics (Loss)
UniBasel Contributors:Loss, Daniel
Item Type:Article, refereed
Article Subtype:Research Article
Note:Publication type according to Uni Basel Research Database: Journal article
Related URLs:
Identification Number:
Last Modified:10 Apr 2015 09:13
Deposited On:24 May 2013 09:02

Repository Staff Only: item control page