Fisher discord as a quantifier of quantum complexity

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Li, Huihui, Luo, Shunlong, Zhang, Yue
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909852613214208
author Li, Huihui
Luo, Shunlong
Zhang, Yue
author_facet Li, Huihui
Luo, Shunlong
Zhang, Yue
contents Two classically equivalent expressions of mutual information of probability distributions (classical bipartite states) diverge when extended to quantum systems, and this difference has been employed to define quantum discord, a quantifier of quantum correlations beyond entanglement. Similarly, equivalent expressions of classical Fisher information of parameterized probability distributions diverge when extended to quantum states, and this difference may be exploited to characterize the complex nature of quantum states. By complexity of quantum states, we mean some hybrid nature which intermingles the classical and quantum features. It is desirable to quantify complexity of quantum states from various perspectives. In this work, we pursue the idea of discord and introduce an information-theoretic quantifier of complexity for quantum states (relative to the Hamiltonian that drives the evolution of quantum systems) via the notion of Fisher discord, which is defined by the difference between two important versions of quantum Fisher information: the quantum Fisher information defined via the symmetric logarithmic derivatives and the Wigner-Yanase skew information defined via the square roots of quantum states. We reveal basic properties of the quantifier of complexity, and compare it with some other quantifiers of complexity. In particular, we show that equilibrium states (or stable states, which commute with the Hamiltonian of the quantum system) and all pure states exhibit zero complexity in this setting. As illustrations, we evaluate the complexity for various prototypical states in both discrete and continuous-variable quantum systems.
format Preprint
id arxiv_https___arxiv_org_abs_2510_15375
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Fisher discord as a quantifier of quantum complexity
Li, Huihui
Luo, Shunlong
Zhang, Yue
Quantum Physics
Two classically equivalent expressions of mutual information of probability distributions (classical bipartite states) diverge when extended to quantum systems, and this difference has been employed to define quantum discord, a quantifier of quantum correlations beyond entanglement. Similarly, equivalent expressions of classical Fisher information of parameterized probability distributions diverge when extended to quantum states, and this difference may be exploited to characterize the complex nature of quantum states. By complexity of quantum states, we mean some hybrid nature which intermingles the classical and quantum features. It is desirable to quantify complexity of quantum states from various perspectives. In this work, we pursue the idea of discord and introduce an information-theoretic quantifier of complexity for quantum states (relative to the Hamiltonian that drives the evolution of quantum systems) via the notion of Fisher discord, which is defined by the difference between two important versions of quantum Fisher information: the quantum Fisher information defined via the symmetric logarithmic derivatives and the Wigner-Yanase skew information defined via the square roots of quantum states. We reveal basic properties of the quantifier of complexity, and compare it with some other quantifiers of complexity. In particular, we show that equilibrium states (or stable states, which commute with the Hamiltonian of the quantum system) and all pure states exhibit zero complexity in this setting. As illustrations, we evaluate the complexity for various prototypical states in both discrete and continuous-variable quantum systems.
title Fisher discord as a quantifier of quantum complexity
topic Quantum Physics
url https://arxiv.org/abs/2510.15375