Circuit complexity and functionality: a thermodynamic perspective

arXiv:2309.05731v2 Announce Type: replace-cross
Abstract: Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem [1]. Recently, in the context of black holes, circuit complexity has been promoted to a physical property, wherein the growth of complexity is reflected in the time evolution of the Einstein-Rosen bridge (``wormhole'') connecting the two sides of an AdS ``eternal'' black …

arxiv complexity computation computational computer computer science concept context cs.cr defined foundational hard perspective problem quant-ph science size