Quantum complexity and the virial theorem

From MaRDI portal
Publication:1783871

DOI10.1007/JHEP08(2018)144zbMATH Open1396.83016arXiv1804.03242OpenAlexW3101087868WikidataQ129354523 ScholiaQ129354523MaRDI QIDQ1783871FDOQ1783871


Authors: Ning Bao, Junyu Liu Edit this on Wikidata


Publication date: 21 September 2018

Published in: Journal of High Energy Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1804.03242




Recommendations




Cites Work


Cited In (5)





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)