Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.
Leung, and Andreas Winter
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
verdicts
UNVERDICTED 3representative citing papers
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.
citing papers explorer
-
Large $N$ factorization of families of tensor trace-invariants
Families of complex tensor trace-invariants with tree-like dominant pairings factorize at large N, allowing computation of typical multipartite Rényi entropies for uniform random states.
-
Accessible Quantum Correlations Under Complexity Constraints
Computational constraints exponentially suppress accessible entanglement for some highly entangled quantum states and can make mixed-state min-entropy appear maximal when the information-theoretic version is negative.
-
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups
Random states from symplectic and orthogonal unitaries show exponentially large strong state complexity and near-orthogonality, with average-case hardness for learning circuits from these groups.