Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs (Q1690020): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q58005529, #quickstatements; #temporary_batch_1710862453543 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Quantum entanglement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classical deterministic complexity of Edmonds' Problem and quantum entanglement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separability Criterion for Density Matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Separability criterion and inseparable mixed states with positive partial transposition. / rank | |||
Normal rank |
Latest revision as of 00:17, 15 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs |
scientific article |
Statements
Combinatorial entanglement: detecting entanglement in quantum states using grid-labelled graphs (English)
0 references
18 January 2018
0 references
quantum physics
0 references
quantum entanglement
0 references
0 references
0 references