Circuit Complexity in Gauge Theory
arXiv:2108.08208 · doi:10.1142/S0217732321502400
Abstract
We study circuit complexity for a free vector field of a gauge theory in Coulomb gauge, and Gaussian states. We introduce a quantum circuit model with Gaussian states, including reference and target states. Using the Nielsen's geometric approach, the complexity then can be found as the shortest geodesic in the space of states. This geodesic is based on the notion of geodesic distance on the Lie group of Bogoliubov transformations equipped with a right-invariant metric. We use the framework of the covariance matrix to compute circuit complexity between Gaussian states. We apply this framework to the free vector field in general dimensions where we compute the circuit complexity of the ground state of the Hamiltonian.
arXiv comment11 pages, submitted to MPLA
References in corpus (18)
- Holographic Derivation of Entanglement Entropy from AdS/CFT
- Building up spacetime with quantum entanglement
- Complexity Equals Action
- Complexity and Shock Wave Geometries
- Complexity, action, and black holes
- Quantum Computation as Geometry
- Gravitation from Entanglement in Holographic CFTs
- Circuit complexity in quantum field theory
- Towards Complexity for Quantum Field Theory States
- Gravitational Dynamics From Entanglement "Thermodynamics"
- Circuit Complexity in Fermionic Field Theory
- Complexity and entanglement for thermofield double states
- Circuit complexity for free fermions
- Circuit complexity in interacting QFTs and RG flows
- Universality of Gravity from Entanglement
- Switchbacks and the Bridge to Nowhere
- From Geometry to Quantum Computation
- Circuit complexity in proca theory