Phase-space complexity of discrete-variable quantum states and operations

TL;DR

This paper introduces a phase-space complexity measure for discrete-variable quantum states based on the Husimi Q-function, combining Wehrl entropy and Fisher information, and analyzes its properties, behavior, and limitations across different quantum states and channels.

Contribution

It develops a novel complexity quantifier for discrete quantum systems, extending phase-space analysis and exploring its properties, state dependence, and channel effects.

Findings

Complexity normalized with coherent states as unit and maximally mixed as zero.

Analytic expressions derived for Gibbs and Dicke states.

Numerical analysis shows a monotonic relationship between complexity and purity.

Abstract

We introduce a quantifier of phase-space complexity for discrete-variable (DV) quantum systems. Motivated by a recent framework developed for continuous-variable systems, we construct a complexity measure of quantum states based on the Husimi Q-function defined over spin coherent states. The quantifier combines into a single scalar quantity two complementary information-theoretic quantities, the Wehrl entropy, which captures phase-space spread, and the Fisher information, which captures localization. We derive fundamental properties of this measure, including its invariance under SU(2) displacements. The complexity is normalized such that coherent states have unit complexity, while the completely mixed state has zero complexity, a feature distinct from the continuous-variable case. We provide analytic expressions for several relevant families of states, including Gibbs and Dicke states, and perform a numerical analysis of spin-squeezed states, NOON states, and randomly generated states. Numerical results reveal a monotonic, but not deterministic, relationship between complexity and purity, leading us to conjecture that maximal complexity is attained by pure states, thereby connecting the problem to the optimization of Wehrl entropy via Majorana constellations. Finally, we extend the framework to quantum channels, defining measures for both the generation and breaking of complexity. We analyze the performance of common unitary gates and the amplitude damping channel, showing that while low-dimensional systems can achieve maximal complexity via spin squeezing or NOON states, this becomes impossible in higher dimensions. These results highlight dimension-dependent limitations in the generation of phase-space complexity and establish a unified phase-space approach to complexity across both continuous and discrete variable regimes.