Timeline for A square root inequality for symmetric matrices?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 29, 2020 at 12:35 | comment | added | Mikael de la Salle | @leomonsaingeon : I do not remember having heard of the Bures distance before your question (but I am no expert in Quantum information theory). But its definition makes perfect sense for infinite dimensional spaces (and more generally for any tracial von Neumann algebra), and I guess that most properties known for finite matrices remain true in this setting. | |
| May 29, 2020 at 12:03 | comment | added | leo monsaingeon | Oh yes, merci encore, ça me tire une belle épine du pied! By the way, since you appear to be the expert here, and mostly out of curiosity: Have you ever heard of the Bures distance in the infinite-dimensional/operator-theoretical framework? It seems to be quite popular in information theory these days, and apparently plays a role in quantum mechanics, so I was just wondering... (Although I must admit I didn't particularly search the literature for this) | |
| May 29, 2020 at 11:46 | comment | added | Mikael de la Salle | Content que ça puisse t'être utile ! | |
| May 28, 2020 at 12:50 | comment | added | leo monsaingeon | Great, merci beaucoup Mikael! This $L^1$ version is even better than what I needed: I really was trying to control by $L^1$, but for some resaon I was convinced that $L^2$ should be used as an intermediate step. I guess I was wrong. Thank you again. | |
| May 28, 2020 at 12:47 | vote | accept | leo monsaingeon | ||
| May 28, 2020 at 12:13 | history | edited | Mikael de la Salle | CC BY-SA 4.0 |
added 58 characters in body
|
| May 28, 2020 at 12:08 | history | answered | Mikael de la Salle | CC BY-SA 4.0 |