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.









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)