



01714nas a2200181   4500008004100000245004400041210004400085260001500129490000800144520120900152100002801361700002801389700002101417700002001438700001701458700002001475856003701495       2022                        eng d00aResource theory of quantum uncomplexity0 aResource theory of quantum uncomplexity  c12/19/20220 v1063 a<p>Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state&#39;s complexity quantifies the number of computational gates required to prepare the state from a simple tensor product. The greater a state&#39;s distance from maximal complexity, or &quot;uncomplexity,&quot; the more useful the state is as input to a quantum computation. Separately, resource theories -- simple models for agents subject to constraints -- are burgeoning in quantum information theory. We unite the two domains, confirming Brown and Susskind&#39;s conjecture that a resource theory of uncomplexity can be defined. The allowed operations, fuzzy operations, are slightly random implementations of two-qubit gates chosen by an agent. We formalize two operational tasks, uncomplexity extraction and expenditure. Their optimal efficiencies depend on an entropy that we engineer to reflect complexity. We also present two monotones, uncomplexity measures that decline monotonically under fuzzy operations, in certain regimes. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory.</p>1 aHalpern, Nicole, Yunger1 aKothakonda, Naga, B. T.1 aHaferkamp, Jonas1 aMunson, Anthony1 aEisert, Jens1 aFaist, Philippe  uhttps://arxiv.org/abs/2110.11371