arXiv:1707.08582 · Physical Review Letters

Toward a Definition of Complexity for Quantum Field Theory States

Shira Chapman, Michał P. Heller, Hugo Marrochio, Fernando Pastawski

Published Mar 22, 2018• 403 citations

Abstract

We investigate notions of complexity of states in continuous many-body quantum systems. We focus on Gaussian states which include ground states of free quantum field theories and their approximations encountered in the context of the continuous version of the multiscale entanglement renormalization ansatz. Our proposal for quantifying state complexity is based on the Fubini-Study metric. It leads to counting the number of applications of each gate (infinitesimal generator) in the transformation, subject to a state-dependent metric. We minimize the defined complexity with respect to momentum-preserving quadratic generators which form su(1,1) algebras. On the manifold of Gaussian states generated by these operations, the Fubini-Study metric factorizes into hyperbolic planes with minimal complexity circuits reducing to known geodesics. Despite working with quantum field theories far outside the regime where Einstein gravity duals exist, we find striking similarities between our results and those of holographic complexity proposals.

DOI: 10.1103/physrevlett.120.121602

Related papers

Circuit complexity for free fermions

Lucas Hackl, Robert C. Myers

A bstract We study circuit complexity for free fermionic field theories and Gaussian states. Our definition of circuit complexity is based on the notion of geodesic distance on the Lie group of special orthogonal transformations equipped with a right-invariant metric. After analyzing the differences and similarities to bosonic circuit complexity, we develop a comprehensive mathematical framework to compute circuit complexity between arbitrary fermionic Gaussian states. We apply this framework to the free Dirac field in four dimensions where we compute the circuit complexity of the Dirac ground state with respect to several classes of spatially unentangled reference states. Moreover, we show that our methods can also be applied to compute the complexity of excited energy eigenstates of the free Dirac field. Finally, we discuss the relation of our results to alternative approaches based on the Fubini-Study metric, the relevance to holography and possible extensions.

arXiv:1803.10638Journal of High Energy PhysicsJul 1, 2018264 citations

The Complexity of Being Entangled

Stefano Baiguera, Shira Chapman, Giuseppe Policastro +1 more

Nielsen's approach to quantum state complexity relates the minimal number of quantum gates required to prepare a state to the length of geodesics computed with a certain norm on the manifold of unitary transformations. For a bipartite system, we investigate binding complexity, which corresponds to norms in which gates acting on a single subsystem are free of cost. We reduce the problem to the study of geodesics on the manifold of Schmidt coefficients, equipped with an appropriate metric. Binding complexity is closely related to other quantities such as distributed computing and quantum communication complexity, and has a proposed holographic dual in the context of AdS/CFT. For finite dimensional systems with a Riemannian norm, we find an exact relation between binding complexity and the minimal Rényi entropy. We also find analytic results for the most commonly used non-Riemannian norm (the so-called F1 norm) and provide lower bounds for the associated notion of state complexity ubiquitous in quantum computation and holography. We argue that our results are valid for a large class of penalty factors assigned to generators acting across the subsystems. We demonstrate that our results can be borrowed to study the usual complexity (not-binding) for a single spin for the case of the F1 norm which was previously lacking from the literature. Finally, we derive bounds for multi-partite binding complexities and the related (continuous) circuit complexity where the circuit contains at most 2 -local interactions.

arXiv:2311.04277QuantumSep 12, 20245 citations

Circuit Complexity of Mixed States

Shan-Ming Ruan

Quantum information has produced fresh insights into foundational questions about the AdS/CFT correspondence. One fascinating concept, which has captured increasing attention, is quantum circuit complexity. As a natural generalization for the complexity of pure states, we investigate the circuit complexity of mixed states in this thesis. \n \nFirst of all, we explore the so-called puriﬁcation complexity which is deﬁned as the lowest value of the circuit complexity, optimized over all possible puriﬁcations of a given mixed state. We focus on studying the complexity of Gaussian mixed states in a free scalar ﬁeld theory using the ‘puriﬁcation complexity’. We argue that the optimal puriﬁcations only contain the essential number of ancillary degrees of freedom necessary in order to purify the mixed state. We also introduce the concept of ‘mode-by-mode puriﬁcations’ where each mode in the mixed state is puriﬁed separately and examine the extent to which such puriﬁcations are optimal. In order to compare with the results from using the various holographic proposals for the complexity of subregions, we explore the puriﬁcation complexity for thermal states of a free scalar QFT, and for subregions of the vacuum state in two dimensions. We ﬁnd a number of qualitative similarities between the two in terms of the structure of divergences and the presence of a volume law. We also examine the ‘mutual complexity’ in the various cases studied in this thesis. \n \nIn addition, we propose to generalize the Fubini-Study method for pure-state complexity to generic quantum states including mixed states by taking Bures metric or quantum Fisher information metric on the space of density matrices as the complexity measure. Due to Uhlmann’s theorem, we show that the mixed-state complexity exactly equals the puriﬁcation complexity measured by the Fubini-Study metric for puriﬁed states but without explicitly applying any puriﬁcations. We also ﬁnd that the puriﬁcation complexity is nonincreasing under any trace-preserving quantum operations. As an illustration, we study the mixed Gaussian states as an example to explicitly show our conclusions for puriﬁcation complexity.

Jul 20, 20216 citations

Principles and symmetries of complexity in quantum field theory

Run-Qiu Yang, Yu-Sen An, Chao Niu +2 more

Based on general and minimal properties of the discrete circuit complexity, we define the complexity in continuous systems in a geometrical way. We first show that the Finsler metric naturally emerges in the geometry of the complexity in continuous systems. Due to fundamental symmetries of quantum field theories, the Finsler metric is more constrained and consequently, the complexity of SU( n ) operators is uniquely determined as a length of a geodesic in the Finsler geometry. Our Finsler metric is bi-invariant contrary to the right-invariance of discrete qubit systems. We clarify why the bi-invariance is relevant in quantum field theoretic systems. After comparing our results with discrete qubit systems we show most results in k -local right-invariant metric can also appear in our framework. Based on the bi-invariance of our formalism, we propose a new interpretation for the Schrödinger’s equation in isolated systems – the quantum state evolves by the process of minimizing “computational cost”.

arXiv:1803.01797The European Physical Journal CFeb 1, 201966 citations

Circuit complexity in quantum field theory

Ro Jefferson, Robert C. Myers

Motivated by recent studies of holographic complexity, we examine the question of circuit complexity in quantum field theory. We provide a quantum circuit model for the preparation of Gaussian states, in particular the ground state, in a free scalar field theory for general dimensions. Applying the geometric approach of Nielsen to this quantum circuit model, the complexity of the state becomes the length of the shortest geodesic in the space of circuits. We compare the complexity of the ground state of the free scalar field to the analogous results from holographic complexity, and find some surprising similarities.

arXiv:1707.08570Journal of High Energy PhysicsOct 1, 2017476 citations

CFT complexity and penalty factors

Stefano Baiguera, Nicolas Chagnet, Shira Chapman +1 more

A bstract Quantum complexity of conformal field theory (CFT) states has recently gained significant attention, both as a diagnostic tool in condensed matter systems and in connection with holographic observables probing black hole interiors. Previous studies have primarily focused on cases where all generators of the conformal group contribute equally to the cost of building a circuit. In this work, we present a general framework for studying the complexity of circuits in generic Lie groups, where penalty factors assign relative weights to different generators. Our approach constructs a metric on the coset space of quantum states, induced from a (pseudo-)Riemannian norm on the space of unitary circuits. The geodesics of this metric are interpreted as optimal circuits. The method builds on the formalism of (pseudo-)Riemannian submersions and connects naturally to other prescriptions in the literature, including cost function minimization along stabilizer directions and constructions based on coadjoint orbits. As a concrete application, we compute state complexity for states in one- and two-dimensional CFTs. For specific choices of penalty factors, our prescription yields a positive-definite metric with a viable interpretation as complexity; in other cases, the resulting metric is indefinite. In the viable regime, we derive analytic results when a specific penalty factor is turned off, develop perturbative expansions for small values of the penalty factors, and provide numerical results in the general case. We comment on the relation of our measure of complexity to holography.

arXiv:2507.22118Journal of High Energy PhysicsFeb 25, 20261 citation