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

• URL: http://arxiv.org/abs/2603.03431v1
• Date: Tue, 03 Mar 2026 19:00:02 GMT
• Title: Phase-space complexity of discrete-variable quantum states and operations
• Authors: Siting Tang, Shunlong Luo, Matteo G. A. Paris,
• Abstract summary: We introduce a quantifier of phase-space complexity for discrete-variable quantum systems.<n>The complexity is normalized such that coherent states have unit complexity, while the completely mixed state has zero complexity.<n>We extend the framework to quantum channels, defining measures for both the generation and breaking of complexity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Statistical phase-space complexity of continuous-variable quantum channels [5.3884682123261705]
  In this work, we utilize this complexity quantifier of quantum states to study the complexity of single-mode bosonic quantum channels.<n>We define the complexity of quantum channels as the maximal amount of complexity they can generate from an initial state with the minimal complexity.
  arXiv  Detail & Related papers  (2025-10-14T18:00:04Z)
• Direct probing of the simulation complexity of open quantum many-body dynamics [42.085941481155295]
  We study the role of dissipation in simulating open-system dynamics using both quantum and classical methods.<n>Our results show that dissipation affects correlation length and mixing time in distinct ways at intermediate and long timescales.
  arXiv  Detail & Related papers  (2025-08-27T15:14:36Z)
• Quantifying complexity of continuous-variable quantum states via Wehrl entropy and Fisher information [8.52497147463548]
  We introduce a quantifier of complexity of continuous-variable states, e.g. quantum optical states, based on the Husimi quasiprobability distribution.<n>We analyze the basic properties of the quantifier and illustrate its features by evaluating complexity of Gaussian states and some relevant non-Gaussian states.
  arXiv  Detail & Related papers  (2025-05-14T17:59:31Z)
• Comparing quantum complexity and quantum fidelity [0.0]
  We show that complexity provides the same information as quantum fidelity and is therefore capable of detecting quantum phase transitions.<n>We conclude that incorporating a notion of spatial locality into the computation of complexity is essential to uncover new physics.
  arXiv  Detail & Related papers  (2025-03-12T13:04:57Z)
• Attention to Quantum Complexity [21.766643620345494]
  We introduce the Quantum Attention Network (QuAN), a versatile classical AI framework. QuAN treats measurement snapshots as tokens while respecting their permutation invariance. We rigorously test QuAN across three distinct quantum simulation settings.
  arXiv  Detail & Related papers  (2024-05-19T17:46:40Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application.<n>We analyse the generation of random states in PQCs under restrictions on the qubits connectivities.<n>We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Enhanced Entanglement in the Measurement-Altered Quantum Ising Chain [43.80709028066351]
  Local quantum measurements do not simply disentangle degrees of freedom, but may actually strengthen the entanglement in the system.<n>This paper explores how a finite density of local measurement modifies a given state's entanglement structure.
  arXiv  Detail & Related papers  (2023-10-04T09:51:00Z)
• Circuit Complexity through phase transitions: consequences in quantum state preparation [0.0]
  We analyze the circuit complexity for preparing ground states of quantum many-body systems. In particular, how this complexity grows as the ground state approaches a quantum phase transition.
  arXiv  Detail & Related papers  (2023-01-11T19:00:10Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Aspects of The First Law of Complexity [0.0]
  We investigate the first law of complexity proposed in arXiv:1903.04511, i.e., the variation of complexity when the target state is perturbed. Based on Nielsen's geometric approach to quantum circuit complexity, we find the variation only depends on the end of the optimal circuit.
  arXiv  Detail & Related papers  (2020-02-13T21:15:57Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.