Maximal exponent of the Lorentz cones
We show that the maximal exponent (i.e., the minimum number of iterations required for a primitive map to become strictly positive) of the $n$-dimensional Lorentz cone is equal to $n$. As a byproduct, we show that the optimal exponent in the quantum Wielandt inequality for qubit channels is equal to...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Académie des sciences
2024-11-01
|
| Series: | Comptes Rendus. Mathématique |
| Subjects: | |
| Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.649/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | We show that the maximal exponent (i.e., the minimum number of iterations required for a primitive map to become strictly positive) of the $n$-dimensional Lorentz cone is equal to $n$. As a byproduct, we show that the optimal exponent in the quantum Wielandt inequality for qubit channels is equal to $3$. |
|---|---|
| ISSN: | 1778-3569 |