Quantum complexity and the virial theorem
From MaRDI portal
Publication:1783871
Abstract: It is conjectured that in the geometric formulation of quantum computing, one can study quantum complexity through classical entropy of statistical ensembles established non-relativistically in the group manifold of unitary operators. The kinetic and positional decompositions of statistical entropy are conjectured to correspond to the Kolmogorov complexity and computational complexity, respectively, of corresponding quantum circuits. In this paper, we claim that by applying the virial theorem to the group manifold, one can derive a generic relation between Kolmogorov complexity and computational complexity in the thermal equilibrium.
Recommendations
Cites work
- A formulation of the virial theorem in general relativity
- Chaos and complexity by design
- Chaos and random matrices in supersymmetric SYK
- Chaos, complexity, and random matrices
- Circuit complexity for free fermions
- Circuit complexity in quantum field theory
- Comments on holographic complexity
- Complexity of formation in holography
- Computational complexity and black hole horizons
- Holographic complexity in Vaidya spacetimes. II.
- Holographic complexity is nonlocal
- Holographic second laws of black hole thermodynamics
- On the time dependence of holographic complexity
- Post-Newtonian Equations of Hydrodynamics and the Stability of Gaseous Masses in General Relativity
Cited in
(5)- How smooth is quantum complexity?
- Complexity growth of operators in the SYK model and in JT gravity
- Quantum cellular automata, black hole thermodynamics and the laws of quantum complexity
- Complexity Invariance by Replication in the Quantum Square Well
- Statistical complexity and classical-quantum frontier
This page was built for publication: Quantum complexity and the virial theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1783871)