Complexity for superconformal primaries from BCH techniques

From MaRDI portal
Publication:6407543




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 mathbfmathfraksu(2,2|mathcalN) 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"{a}hler potential characterizing the circuit complexity geometry and obtain explicit expressions in the case of mathcalN=1 and mathcalN=2 supersymmetry.











This page was built for publication: Complexity for superconformal primaries from BCH techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407543)