paper

Quantum complexity and the virial theorem

arXiv:1804.03242 · doi:10.1007/JHEP08(2018)144

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.

arXiv commentv2: add references and a footnote. v3: published version, with concrete examples

References in corpus (18)

Cited by in corpus (6)