Recognition: unknown
Circuit complexity in quantum field theory
read the original abstract
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.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
Bridging Krylov Complexity and Universal Analog Quantum Simulator
Generalized Krylov complexity predicts the minimum time to realize target operations in analog quantum simulators such as Rydberg atom arrays.
-
A Timelike Quantum Focusing Conjecture
A timelike quantum focusing conjecture implies a complexity-based quantum strong energy condition and a complexity bound analogous to the covariant entropy bound for suitable codimension-0 field theory complexity measures.
-
Holographic complexity of conformal fields in global de Sitter spacetime
Holographic complexity of CFTs in global dS_d is computed via volume and action prescriptions in AdS foliation and brane setups, then compared to results from static and Poincare patches.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.