DeepAI AI Chat
Log In Sign Up

Quantum Accelerated Estimation of Algorithmic Information

by   Aritra Sarkar, et al.

In this research we present a quantum circuit for estimating algorithmic information metrics like the universal prior distribution. 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. A classical exhaustive enumeration is shown for a few examples. The precise quantum circuit design that allows executing a superposition of automata is presented. As a use-case, an application framework for experimenting on DNA sequences for meta-biology is proposed. To our knowledge, this is the first time approximating algorithmic information is implemented for quantum computation. Our implementation on the OpenQL quantum programming language and the QX Simulator is copy-left and can be found on


ACSS-q: Algorithmic complexity for short strings via quantum accelerated approach

In this research we present a quantum circuit for estimating algorithmic...

Transformations for accelerator-based quantum circuit simulation in Haskell

For efficient hardware-accelerated simulations of quantum circuits, we c...

Visualizing Quantum Circuit Probability – estimating computational action for quantum program synthesis

This research applies concepts from algorithmic probability to Boolean a...

Compiler Optimization for Quantum Computing Using Reinforcement Learning

Any quantum computing application, once encoded as a quantum circuit, mu...

Computable Model Discovery and High-Level-Programming Approximations to Algorithmic Complexity

Motivated by algorithmic information theory, the problem of program disc...

A technical note for a Shor's algorithm by phase estimation

The objective of this paper concerns at first the motivation and the met...