Statistical phase-space complexity of continuous-variable quantum channels
The statistical complexity of continuous-variable quantum states can be characterized with a quantifier defined in terms of information-theoretic quantities derived from the Husimi [Formula: see text]-function. In this work, we utilize this complexity quantifier of quantum states to study the complexity of single-mode bosonic quantum channels. We define the complexity of quantum channels as the maximal amount of complexity they can generate from an initial state with the minimal complexity. We illustrate this concept by evaluating the complexity of Gaussian channels and some examples of non-Gaussian channels.
Authors
- Sheng-Chuan Tang (ORCID: https://orcid.org/0009-0001-9116-3889)
- Francesco Albarelli (ORCID: https://orcid.org/0000-0001-5775-168X)
- Yue Zhang (ORCID: https://orcid.org/0000-0003-4012-537X)
- Shunlong Luo (ORCID: https://orcid.org/0000-0003-4362-051X)
- Matteo G. A. Paris
Institutions
- University of Parma (IT)
- University of Milan (IT)
- Academy of Mathematics and Systems Science (CN)
- University of Chinese Academy of Sciences (CN)
Publication Details
- Journal
- International Journal of Quantum Information
- Published
- 2025-12-30
- DOI
- https://doi.org/10.1142/s0219749925400143
- Primary Topic
- Quantum Computing Algorithms and Architecture
- Type
- article
- Field-Weighted Citation Impact
- 0.00