pith. sign in

arxiv: 1807.05218 · v2 · pith:AK22YAZQnew · submitted 2018-07-13 · 🪐 quant-ph · gr-qc· hep-th

Properties of the (Un)Complexity of Subsystems

classification 🪐 quant-ph gr-qchep-th
keywords complexityinvestigatepropertiessomesubsystemuncomplexityarisescases
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.