2000 character limit reached
Quantum Computation as Gravity (1807.04422v2)
Published 12 Jul 2018 in hep-th and quant-ph
Abstract: We formulate Nielsen's geometric approach to complexity in the context of two dimensional conformal field theories, where series of conformal transformations are interpreted as unitary circuits. We show that the complexity functional can be written as the Polyakov action of two dimensional gravity or, equivalently, as the geometric action on the coadjoint orbits of the Virasoro group. This way, we argue that gravity sets the rules for optimal quantum computation in conformal field theories.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.