Complexity Inequalities for Quantum Subsystems

• URL: http://arxiv.org/abs/2606.20790v1
• Date: Thu, 18 Jun 2026 18:00:00 GMT
• Title: Complexity Inequalities for Quantum Subsystems
• Abstract summary: We introduce two quantities: a tripartite complexity, inspired by the tripartite information, and a complexity gap.<n>We study the sign structure of these quantities in three selected approaches to subsystem complexity.<n>Our results suggest that the complexity gap could be a natural candidate building block for a prospective hierarchy of subsystem complexity inequalities.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Motivated by the role of the holographic entropy cone in constraining the entanglement structure of states with classical gravitational duals, we investigate combinations of subsystem complexities associated with reduced density matrices in multipartite quantum systems. Focusing on subsystems composed of three disjoint regions, we introduce two quantities: a tripartite complexity, inspired by the tripartite information, and a complexity gap, designed to characterize emergent complexity in the full quantum state beyond that of its constituents. We study the sign structure of these quantities in three selected approaches to subsystem complexity. In holography, we employ the complexity=volume proposal in AdS spacetimes; for Gaussian many-body states, we use Fisher-Rao subsystem complexity; and we further develop a Krylov-space inspired, effective framework for reduced density matrices, which we test in few-qubit systems and coherent-state dynamics. Across all three approaches, we find that the tripartite complexity is not sign-definite in general. By contrast, the complexity gap exhibits a definite sign in every example we analyze, although the sign itself depends on the underlying notion of subsystem complexity. Our results suggest that the complexity gap could be a natural candidate building block for a prospective hierarchy of subsystem complexity inequalities.

Related papers

• Hysteretic squashed entanglement in many-body quantum systems [42.085941481155295]
  Entanglement in many-body quantum systems is distributed across spatial regions.<n>We propose hysteretic entanglement $T_sq$, a conditional entanglement that measures the genuine quantum correlations between two subregions.<n>We show that $T_sq$ can detect genuine quantum correlations across both adjacent and long-range subsystems.
  arXiv  Detail & Related papers  (2026-03-10T17:00:49Z)
• Phase-space complexity of discrete-variable quantum states and operations [0.0]
  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.
  arXiv  Detail & Related papers  (2026-03-03T19:00:02Z)
• The Large-Scale Structure of Entanglement in Quantum Many-body Systems [44.99833362998488]
  We show that the thermodynamic limit of a many-body system can reveal entanglement properties that are hard to detect in finite-size systems.<n>In particular, we show that every gapped phase of matter, even the trivial one, in $Dgeq 2$ dimensions contains models with the strongest possible bipartite large-scale entanglement.
  arXiv  Detail & Related papers  (2025-03-05T19:01:05Z)
• Krylov complexity of purification [0.0]
  purification can map mixed states into pure states and a non-unitary evolution into a unitary one by enlarging the Hilbert space.<n>We establish a connection between the complexities of mixed quantum states and their purification, proposing new inequalities among these complexities.
  arXiv  Detail & Related papers  (2024-08-01T18:00:00Z)
• Inducing Systematicity in Transformers by Attending to Structurally Quantized Embeddings [60.698130703909804]
  Transformers generalize to novel compositions of structures and entities after being trained on a complex dataset. We propose SQ-Transformer that explicitly encourages systematicity in the embeddings and attention layers. We show that SQ-Transformer achieves stronger compositional generalization than the vanilla Transformer on multiple low-complexity semantic parsing and machine translation datasets.
  arXiv  Detail & Related papers  (2024-02-09T15:53:15Z)
• Spread complexity in saddle-dominated scrambling [0.0]
  We study the spread complexity of the thermofield double state within emphintegrable systems that exhibit saddle-dominated scrambling. Applying the Lanczos algorithm, our numerical investigation reveals that the spread complexity in these systems exhibits features reminiscent of emphchaotic systems.
  arXiv  Detail & Related papers  (2023-12-19T20:41:14Z)
• Learning to Control Linear Systems can be Hard [19.034920102339573]
  We study the statistical difficulty of learning to control linear systems. We prove that learning complexity can be at most exponential with the controllability index, that is the degree of underactuation.
  arXiv  Detail & Related papers  (2022-05-27T15:07:30Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• 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)
• Subsystem complexity after a global quantum quench [0.0]
  We study the temporal evolution of the circuit complexity for a subsystem in harmonic lattices after a global quantum quench of the mass parameter. For infinite harmonic chains, the value of the subsystem complexity is studied through the generalised Gibbs ensemble.
  arXiv  Detail & Related papers  (2021-02-04T17:48:58Z)
• Entanglement marginal problems [0.0]
  entanglement marginal problem consists of deciding whether a number of reduced density matrices are compatible with an overall separable quantum state. We propose hierarchies of semidefinite programming relaxations of the set of quantum state marginals admitting a fully separable extension. Our results even extend to infinite systems, such as translation-invariant systems in 1D, as well as higher spatial dimensions with extra symmetries.
  arXiv  Detail & Related papers  (2020-06-16T10:48:56Z)
• Quantum computation of thermal averages in the presence of a sign problem [45.82374977939355]
  We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system. We show how quantum algorithms completely solve the problem, and discuss how this can apply to more complex systems of physical interest.
  arXiv  Detail & Related papers  (2020-01-15T14:01:11Z)

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.