Uncomplexity
Uncomplexity is a concept in quantum information theory and computational complexity that denotes the amount of computational resource remaining in a system. It is defined as the difference between the maximum possible circuit complexity for the system and its current circuit complexity. Intuitively, it measures how much further complexity a state or unitary can be driven before reaching a maximal, typical level.
For n qubits, the maximum circuit complexity grows rapidly with n, so the uncomplexity is a large,
Origin and usage: the term was popularized by Scott Aaronson in discussions of quantum complexity and holography.
Applications: in quantum information, uncomplexity provides intuition about the limits of quantum computation and information processing.
See also: complexity, quantum complexity, holography, black hole information paradox.