Geometric quantum complexity of bosonic oscillator systems
arXiv:2307.13736 · doi:10.1007/JHEP10(2024)048
Abstract
According to the pioneering work of Nielsen and collaborators, the length of the minimal geodesic in a geometric realization of a suitable operator space provides a measure of the quantum complexity of an operation. Compared with the original concept of complexity based on the minimal number of gates required to construct the desired operation as a product, this geometrical approach amounts to a more concrete and computable definition, but its evaluation is nontrivial in systems with a high-dimensional Hilbert space. The geometrical formulation can more easily be evaluated by considering the geometry associated with a suitable finite-dimensional group generated by a small number of relevant operators of the system. In this way, the method has been applied in particular to the harmonic oscillator, which is also of interest in the present paper. However, subtle and previously unrecognized issues of group theory can lead to unforeseen complications, motivating a new formulation that remains on the level of the underlying Lie algebras for most of the required steps. Novel insights about complexity can thereby be found in a low-dimensional setting, with the potential of systematic extensions to higher dimensions as well as interactions. Specific examples include the quantum complexity of various target unitary operators associated with a harmonic oscillator, inverted harmonic oscillator, and coupled harmonic oscillators. The generality of this approach is demonstrated by an application to an anharmonic oscillator with a cubic term.
Discussions added, improved plots, typos fixed, references added. Matches the published version
References in corpus (37)
- Generalized gravitational entropy
- Ultimate physical limits to computation
- Complexity Equals Action
- Holographic Entanglement Entropy: An Overview
- Time Evolution of Entanglement Entropy from Black Hole Interiors
- Complexity, action, and black holes
- Quantum Computation as Geometry
- Circuit complexity in quantum field theory
- Towards Complexity for Quantum Field Theory States
- Holographic Entanglement Entropy
- Liouville Action as Path-Integral Complexity: From Continuous Tensor Networks to AdS/CFT
- Anti-de Sitter Space from Optimization of Path Integrals in Conformal Field Theories
- 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
- Quantum Computational Complexity -- From Quantum Information to Black Holes and Back
- Does Complexity Equal Anything?
- Circuit Complexity for Coherent States
- Time Evolution of Complexity: A Critique of Three Methods
- Chaos and Complexity in Quantum Mechanics
- Quantum Complexity of Time Evolution with Chaotic Hamiltonians
- Complexity of Mixed States in QFT and Holography
- The Complexity Geometry of a Single Qubit
- Path integral optimization as circuit complexity
- Complexity Equals Anything II
- Renormalized Circuit Complexity
- The Multi-faceted Inverted Harmonic Oscillator: Chaos and Complexity
- Complexity Growth in Integrable and Chaotic Models
- Conformal field theory complexity from Euler-Arnold equations
- Quantum aspects of chaos and complexity from bouncing cosmology: A study with two-mode single field squeezed state formalism
- Binding Complexity and Multiparty Entanglement
- Bounds on quantum evolution complexity via lattice cryptography
- Quantum Complexity as Hydrodynamics
- Integrability and complexity in quantum spin chains
- Faithful realizations of semiclassical truncations
- Circuit Complexity in