REVIEW 3 cited by
Purification Complexity without Purifications
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Purification Complexity without Purifications
read the original abstract
We generalize the Fubini-Study method for pure-state complexity to generic quantum states by taking Bures metric or quantum Fisher information metric on the space of density matrices as the complexity measure. Due to Uhlmann's theorem, we show that the mixed-state complexity exactly equals the purification complexity measured by the Fubini-Study metric for purified states but without explicitly applying any purification. We also find the purification complexity is non-increasing under any trace-preserving quantum operations. We also study the mixed Gaussian states as an example to explicitly illustrate our conclusions for purification complexity.
Forward citations
Cited by 3 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Nielsen complexity for Lindbladian open systems induces a sub-Finslerian geometry on mixed states whose flag curvature depends on control penalty factors.
-
Complexity Inequalities for Quantum Subsystems
Introduces tripartite complexity and complexity gap for three-region subsystems and reports that the gap has a definite sign in holographic volume complexity, Fisher-Rao Gaussian complexity, and Krylov-space approaches.
-
Complexity Inequalities for Quantum Subsystems
Defines tripartite complexity and complexity gap for three-subsystem states and reports that the gap has definite sign across holographic CV, Fisher-Rao, and Krylov measures, suggesting it as a building block for comp...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.