The separability problem and normal completions. (Q1415288): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1116414 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Juan Ramón Torregrosa Sánchez / rank | |||
Normal rank |
Revision as of 13:33, 22 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The separability problem and normal completions. |
scientific article |
Statements
The separability problem and normal completions. (English)
0 references
3 December 2003
0 references
The author deals with the separability problem via a new normal completion problem. He shows that generically the \(N \times M\) separability problem may be reduced to a \((N-1) \times M\) separability problem via a multi-matrix normal completion problem. In particular he proves that the \(2 \times M\) separability is equivalent to a normal completion problem that is a variation of the one introduced by P. Halmos. In addition, the author obtains upper bounds on the number of states in a separable representation in terms of the normal completions.
0 references
normal completions
0 references
separability problem
0 references
positive definite matrix
0 references