Predictive Complexity of Quantum Subsystems
Curtis T. Asplund, Elisa Panciu · 2024
Read Predictive Complexity of Quantum Subsystems by Curtis T. Asplund, Elisa Panciu (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11675421.txt.
Description
Curtis Asplund and Elisa Panciu define a new measure, predictive complexity, for quantum systems made of distinct parts, published in 2024. The measure generalizes entanglement entropy. It borrows from forecasting ideas in the study of complex systems, where states that predict the same future are grouped together, but it is built to be intrinsically quantum.
For a subsystem, predictive states are classes of outside state vectors that forecast the same behavior of that part for some time. In a spin chain example, the new measure flagged dynamically important events, such as collisions of magnetic excitations, better than entanglement entropy did. It can also act as a local order parameter, separating long-range from short-range entanglement. The authors present the definition and the illustrative calculations together.
Catalog record
| CREATOR | Curtis T. Asplund, Elisa Panciu |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 42 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |