About: Squashed entanglement

An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Squashed entanglement, also called CMI entanglement (CMI can be pronounced "see me"), is an information theoretic measure of quantum entanglement for a bipartite quantum system. If is the density matrix of a system composed of two subsystems and , then the CMI entanglement of system is defined by

thumbnail
Property Value
dbo:abstract
  • Squashed entanglement, also called CMI entanglement (CMI can be pronounced "see me"), is an information theoretic measure of quantum entanglement for a bipartite quantum system. If is the density matrix of a system composed of two subsystems and , then the CMI entanglement of system is defined by where is the set of all density matrices for a tripartite system such that . Thus, CMI entanglement is defined as an extremum of a functional of . We define , the quantum Conditional Mutual Information (CMI), below. A more general version of Eq.(1) replaces the ``min" (minimum) in Eq.(1) by an ``inf" (infimum). When is a pure state, , in agreement with the definition of entanglement of formation for pure states. Here is the Von Neumann entropy of density matrix . (en)
dbo:thumbnail
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 5577596 (xsd:integer)
dbo:wikiPageLength
  • 14507 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1087469663 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • Squashed entanglement, also called CMI entanglement (CMI can be pronounced "see me"), is an information theoretic measure of quantum entanglement for a bipartite quantum system. If is the density matrix of a system composed of two subsystems and , then the CMI entanglement of system is defined by (en)
rdfs:label
  • Squashed entanglement (en)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy