Circuit Complexity in Topological Quantum Field Theory

Abstract

Quantum circuit complexity has played a central role in recent advances in holography and many-body physics. Within quantum field theory, it has typically been studied in a Lorentzian (real-time) framework. In a departure from standard treatments, we aim to quantify the complexity of the Euclidean path integral. In this setting, there is no clear separation between space and time, and the notion of unitary evolution on a fixed Hilbert space no longer applies. As a proof of concept, we argue that the pants decomposition provides a natural notion of circuit complexity within the category of 2-dimensional bordisms and use it to formulate the circuit complexity of states and operators in 2-dimensional topological quantum field theory. We comment on analogies between our formalism and others in quantum mechanics, such as tensor networks and second quantization.

47 pages, 8 figures; v3: comments, acknowledgements, and references added, matches published version

References in corpus (16)

• A class of quantum many-body states that can be efficiently simulated
• Complexity and Shock Wave Geometries
• Quantum Computation as Geometry
• Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT
• Path integral optimization as circuit complexity
• Complexity for Conformal Field Theories in General Dimensions
• From Path Integrals to Tensor Networks for AdS/CFT
• The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
• Spacetime as a quantum circuit
• Comments on wormholes and factorization
• Integrality, Duality and Finiteness in Combinatoric Topological Strings
• Symmetry Protected Quantum Computation
• Circuit complexity in proca theory
• Circuit Complexity in $U(1)$ Gauge Theory
• Complexity for link complement States in Chern Simons Theory
• How smooth is quantum complexity?

Cited by in corpus (11)

• From CFTs to theories with Bondi-Metzner-Sachs symmetries: Complexity and out-of-time-ordered correlators
• Krylov Complexity and Spectral Form Factor for Noisy Random Matrix Models
• The Early Universe as an Open Quantum System: Complexity and Decoherence
• Complexity of quantum circuits via sensitivity, magic, and coherence
• Action complexity in the presence of defects and boundaries
• Combinatoric topological string theories and group theory algorithms
• Dynamics of monitored SSH Model in Krylov Space: From Complexity to Quantum Fisher Information
• Circuit Complexity in ${\mathcal{Z}}_2$ $\mathcal{EEF}\mathcal{T}$
• Coherence and Imaginarity as Resources in Quantum Circuit Complexity
• Row-Column duality and combinatorial topological strings
• Probing the self-coherence of primordial quantum fluctuations with complexity