𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transformations on the sets of states and density operators

✍ Scribed by Lajos Molnár; Werner Timmermann

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
136 KB
Volume
418
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we consider two physically relevant numerical quantities (namely, the concurrence and -fidelity) and an operation (called ♦-product) defined on the set of all quantum states or density operators. Our main aim is to present the complete descriptions of all bijective transformations which preserve any of these quantities or operation.

📜 SIMILAR VOLUMES

On the density of primitive sets
On the density of primitive sets
✍ R. Ahlswede; L. Khachatrian; A. Sárközy 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Classical results by Behrend, Erdös, Pillai, Szemerédi, the authors, and others are improved and extended to other concepts of densities in two directions, based on smooth and multiplicative weightings.

On the density of sets of vectors
On the density of sets of vectors
✍ Noga Alon 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 143 KB

Answering a question of Erd6s, Sauer [4] and indepe~dently Pcrles and Shelah [5] found the maximal cardinality of a collection ~ of subsets of a se~: N of cardinality n such that for ever/ subset M ~ N of cardinality m I{C f3 M: C ~ 3b'}l < 2". Karl~)vsky and Milman [3] generalised this result. Here

On the density of sets of divisors
On the density of sets of divisors
✍ R.E.L. Aldred; R.P. Anstee 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Consider the lattice of divisors of n, [1, n]. For any downset (ideal) J in [1, n] we get a forbidden configuration theorem of the type that if a set of divisors D avoids certain configurations, then ] D ] ~< I J ]. If we let 5 ¢ be the set of minimal elements of [ 1, n] not in J, then we forbid in

Optimization of Polytomies: State Set an
Optimization of Polytomies: State Set and Parallel Operations
✍ Pablo A. Goloboff 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 87 KB

New algorithms for calculating the most parsimonious state sets for polytomies under Fitch parsimony are described. Because they are based on state set operations, these algorithms can be extended for optimization of several characters in parallel, thus increasing speed by a significant factor. This