2
talks
0
committee roles
0
leadership roles
2024–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Continuity bounds for quantum entropies arising from a fundamental entropic inequality | QIP 2025 | regular | Koenraad Audenaert, Bjarne Bergh, Nilanjana Datta, Michael G. Jabbour, Ángela Capel |
|
Conditional independence of 1D Gibbs states with applications to efficient learning ↗
|
TQC 2024 | regular ▸ presenter | Samuel Scalet, Alberto Ruiz-de-Alarcón, Alvaro Alhambra, Ángela Capel |
We show that spin chains in thermal equilibrium have a correlation structure in which individual regions are strongly correlated at most with their near vicinity. We quantify this with alternative notions of the conditional mutual information defined through the so-called Belavkin-Staszewski relative entropy. We prove that these measures decay super-exponentially, under the assumption that the spin chain Hamiltonian is translation-invariant. Using a recovery map associated with these measures, we sequentially construct tensor network approximations in terms of marginals of small (sub-logarithmic) size. As a main application, we show that classical representations of the states can be learned efficiently from local measurements with a polynomial sample complexity. We also prove an approximate factorization condition for the purity of the entire Gibbs state, which implies that it can be efficiently estimated to a small multiplicative error from a small number of local measurements. As a technical step of independent interest, we show an upper bound to the decay of the Belavkin-Staszewski relative entropy upon the application of a conditional expectation. |
|||
Collaborators
| Co-author | Joint talks |
|---|---|
| Ángela Capel | 2 |
| Alberto Ruiz-de-Alarcón | 1 |
| Alvaro Alhambra | 1 |
| Bjarne Bergh | 1 |
| Koenraad Audenaert | 1 |
| Michael G. Jabbour | 1 |
| Nilanjana Datta | 1 |
| Samuel Scalet | 1 |