In the thermodynamic limit the quantum and classical full-counting statistics of charge coincide exactly with no finite-time corrections, while the averaged von Neumann entanglement entropy admits a fully explicit expression obtained from the Jacobi-process dynamics of correlation-matrix eigenvalues
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 4roles
background 1polarities
background 1representative citing papers
Haar random qubit states show vanishing fermionic non-Gaussianity for subsystems smaller than half the total size without symmetry, small but finite non-Gaussianity with U(1) symmetry, and extensive non-Gaussianity for larger subsystems.
Three-spin interactions enable maximal concurrence near multicritical points and sustain entanglement for intra-phase quenches in a central spin model.
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.
citing papers explorer
-
Domain-wall melting in all-to-all QSSEP from random-matrix theory
In the thermodynamic limit the quantum and classical full-counting statistics of charge coincide exactly with no finite-time corrections, while the averaged von Neumann entanglement entropy admits a fully explicit expression obtained from the Jacobi-process dynamics of correlation-matrix eigenvalues
-
Non-Gaussianity of random quantum states
Haar random qubit states show vanishing fermionic non-Gaussianity for subsystems smaller than half the total size without symmetry, small but finite non-Gaussianity with U(1) symmetry, and extensive non-Gaussianity for larger subsystems.
-
Generation of concurrence in a generalized central spin model with a three-spin interacting environment
Three-spin interactions enable maximal concurrence near multicritical points and sustain entanglement for intra-phase quenches in a central spin model.
-
A graph-based approach to entanglement entropy of quantum error correcting codes
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.