Protocol learns k-local Lindbladians to ε accuracy with Õ(n^{2k}/ε²) samples and projects to valid generators; improves to log n under sparsity assumptions.
hub
23 Karl Werner, Magnus Jansson, and Petre Stoica
3 Pith papers cite this work, alongside 4,101 external citations. Polarity classification is still indexing.
3
Pith papers citing it
4,101
external citations · OpenAlex
hub tools
years
2026 3representative citing papers
RDGC is the least affine-invariant length of an admissible metric path to a Hessian-relative condition target, with global Green and bordered Jacobi–KKT response laws on Hadamard path space.
Quantum capacity of 4D MAD channels is analyzed with a technique valid outside degradable regimes, and the complete degradability region is characterized for general d-dimensional MAD channels.
citing papers explorer
-
Robust Structure Learning of $k$-local Lindbladians
Protocol learns k-local Lindbladians to ε accuracy with Õ(n^{2k}/ε²) samples and projects to valid generators; improves to log n under sparsity assumptions.
-
Restricted Dynamic Geometric Complexity: Path-Space Reduction and M\"obius--Jacobi Response
RDGC is the least affine-invariant length of an admissible metric path to a Hessian-relative condition target, with global Green and bordered Jacobi–KKT response laws on Hadamard path space.
-
Quantum capacity analysis of finite-dimensional lossy channels
Quantum capacity of 4D MAD channels is analyzed with a technique valid outside degradable regimes, and the complete degradability region is characterized for general d-dimensional MAD channels.