Properties of the (Un)Complexity of Subsystems
arXiv:1807.05218 · doi:10.1103/PhysRevD.98.126012
Abstract
I investigate some properties of proposed definitions for subsystem/mixed state complexity and uncomplexity. A very strong dependence arises on the density matrix's degeneracy which gives a large separation in the scaling of maximum subsystem complexity with number of qubits (linear compared to exponential). I also investigate several cases where the uncomplexity of quantum states are superadditive and present some challenges and progress in showing that the relation holds in complete generality.
arXiv comment7 pages, 3 figures V2: typos fixed and citations added
References in corpus (19)
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- Average Entropy of a Subsystem
- Black Holes: Complementarity or Firewalls?
- Black holes as mirrors: quantum information in random subsystems
- Cool horizons for entangled black holes
- Complexity Equals Action
- Complexity and Shock Wave Geometries
- Gravitation from Entanglement in Holographic CFTs
- Circuit complexity in quantum field theory
- Towards Complexity for Quantum Field Theory States
- The resource theory of informational nonequilibrium in thermodynamics
- The Second Law of Quantum Complexity
- On the Time Dependence of Holographic Complexity
- Holographic Complexity
- Quantum Computation vs. Firewalls
- On Volumes of Subregions in Holography and Complexity
- The Typical-State Paradox: Diagnosing Horizons with Complexity
- Uncomplexity and Black Hole Geometry
- Thoughts on Holographic Complexity and its Basis-dependence