Complexity for superconformal primaries from BCH techniques
Abstract
We extend existing results for the Nielsen complexity of scalar primaries and spinning primaries in four dimensions by including supersymmetry. Specifically, we study the Nielsen complexity of circuits that transform a superconformal primary with definite scaling dimension, spin and R-charge by means of continuous unitary gates from the su(2,2|N) group. Our analysis makes profitable use of Baker-Campbell-Hausdorff formulas including a special class of BCH formulas we conjecture and motivate. With this approach we are able to determine the super-K\"ahler potential characterizing the circuit complexity geometry and obtain explicit expressions in the case of N=1 and N=2 supersymmetry.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.