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 9 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.
-
Krylov complexity and fidelity susceptibility in two-band Hamiltonians
Derivative of Krylov spread complexity diverges logarithmically at SSH topological transitions and is bounded by fidelity susceptibility in general two-band Hamiltonians, with a non-unitary duality between phases.
-
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.
-
Krylov Complexity for Open Quantum System: Dissipation and Decoherence
Krylov complexity saturates in the full high-temperature Caldeira-Leggett system, reproduces dissipative features when decoherence is suppressed, shows oscillations when dissipation is suppressed, and remains insensit...
-
A Quantum Computational Perspective on Spread Complexity
Spread complexity is recovered as the infinitesimal-time limit of a circuit complexity defined by minimal-cost synthesis with time-evolution and beam-splitting operations.
-
Holographic complexity of the Klebanov-Strassler background
Studies holographic complexity in the Klebanov-Strassler background, reporting common scaling with confinement scale across functionals and more complex UV divergences than in AdS.
-
Inhomogeneous Jacobi equation and Holographic subregion complexity
A variational perturbative method using the inhomogeneous Jacobi equation computes first-order changes in holographic subregion complexity for strip and disk subsystems under boosted black brane perturbations in AdS4,...
-
Holographic entanglement entropy and complexity for the cosmological braneworld model
Time-dependent holographic entanglement entropy and complexity are computed perturbatively for braneworld FLRW universes with radiation, matter, and exotic matter by using time-dependent brane positions in black brane...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.