Weighting gates in circuit complexity and holography

Abstract

Motivated by recent studies of quantum computational complexity in quantum field theory and holography, we discuss how weighting certain classes of gates building up a quantum circuit more heavily than others does affect the complexity. Utilizing Nielsen's geometric approach to circuit complexity, we investigate the effects for a regulated field theory for which the optimal circuit is a representation of $GL(N,\mathbb{R})$. More precisely, we work out how a uniformly chosen weighting factor acting on the entangling gates affects the complexity and, particularly, its divergent behavior. We show that assigning a higher cost to the entangling gates increases the complexity. Employing the penalized and the unpenalized complexities for the ${\mathcal{F}}_{\kappa =2}$ cost, we further find an interesting relation between the latter and the one based on the unpenalized ${\mathcal{F}}_{\kappa =1}$ cost. In addition, we exhibit how imposing such penalties modifies the leading order UV divergence in the complexity. We show that appropriately tuning the gate weighting eliminates the additional logarithmic factor, thus, resulting in a simple power law scaling. We also compare the circuit complexity with holographic predictions, specifically, based on the complexity=action conjecture, and relate the weighting factor to certain bulk quantities. Finally, we comment on certain expectations concerning the role of gate penalties in defining complexity in field theory and also speculate on possible implications for holography.

44 pages, 3 figures; v2: references added, typos fixed, template changed, no change in results; v3: minor corrections, journal version

References in corpus (28)

• A class of quantum many-body states that can be efficiently simulated
• Complexity and Shock Wave Geometries
• Holography from Conformal Field Theory
• Quantum Computation as Geometry
• Gravitational action with null boundaries
• Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT
• Complexity and entanglement for thermofield double states
• Circuit complexity in interacting QFTs and RG flows
• Quantum Complexity and Negative Curvature
• Einstein's Equations from Varying Complexity
• Time Evolution of Complexity: A Critique of Three Methods
• Complexity and the bulk volume, a new York time story
• Holographic Complexity Equals Which Action?
• The First Law of Complexity
• Holographic Spacetimes as Quantum Circuits of Path-Integrations
• Complexity in de Sitter Space
• Holographic Complexity for Defects Distinguishes Action from Volume
• Circuit Complexity across a Topological Phase Transition
• Post-Quench Evolution of Complexity and Entanglement in a Topological System
• Complexity of Holographic Superconductors
• Complexity and Behind the Horizon Cut Off
• On complexity growth in massive gravity theories, the effects of chirality and more
• WdW-patches in AdS${}_3$ and complexity change under conformal transformations II
• Circuit Complexity for Fermionic Thermofield Double states
• Holographic complexity of anisotropic black branes
• Holographic Complexity and Charged Scalar Fields
• Holographic entanglement entropy and complexity in St$\ddot{u}$ckelberg superconductor
• More on Complexity in Finite Cut Off Geometry

Cited by in corpus (4)

• Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
• Chaos and Complexity in Quantum Mechanics
• Renormalized Circuit Complexity
• Complexity measures in QFT and constrained geometric actions