The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states (Q858019)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states |
scientific article |
Statements
The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states (English)
0 references
5 January 2007
0 references
entanglement
0 references
0.8748108148574829
0 references
0.8696560263633728
0 references
0.8641013503074646
0 references
0.8612139225006104
0 references
0.8546766042709351
0 references
