论文标题
ACSS-Q：通过量子加速方法的短字符串的算法复杂性
ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach
论文作者
论文摘要
在这项研究中，我们提出了使用编码定理方法估算算法复杂性的量子电路。这加速了在发现因果生成模型的数据中推断算法结构。计算模型在时间和空间资源中受到限制，以使其在近似目标指标时可计算。提出了基于我们较早的工作允许执行自动机叠加的量子电路设计。作为用例，提出了基于算法复杂性的蛋白质蛋白质相互作用本体的应用框架。使用小规模量子计算机，这有可能增强经典块分解方法的结果来弥合基于熵的方法中的因果关系。
In this research we present a quantum circuit for estimating algorithmic complexity using the coding theorem method. This accelerates inferring algorithmic structure in data for discovering causal generative models. The computation model is restricted in time and space resources to make it computable in approximating the target metrics. The quantum circuit design based on our earlier work that allows executing a superposition of automata is presented. As a use-case, an application framework for protein-protein interaction ontology based on algorithmic complexity is proposed. Using small-scale quantum computers, this has the potential to enhance the results of classical block decomposition method towards bridging the causal gap in entropy based methods.
