Quantum Accelerated Estimation of Algorithmic Information

06/01/2020
by   Aritra Sarkar, et al.
0

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 https://github.com/Advanced-Research-Centre/QuBio.

READ FULL TEXT
research
09/18/2020

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

In this research we present a quantum circuit for estimating algorithmic...
research
10/23/2022

Transformations for accelerator-based quantum circuit simulation in Haskell

For efficient hardware-accelerated simulations of quantum circuits, we c...
research
04/05/2023

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

This research applies concepts from algorithmic probability to Boolean a...
research
10/13/2022

Efficient circuit implementation for coined quantum walks on binary trees and application to reinforcement learning

Quantum walks on binary trees are used in many quantum algorithms to ach...
research
12/08/2022

Compiler Optimization for Quantum Computing Using Reinforcement Learning

Any quantum computing application, once encoded as a quantum circuit, mu...
research
12/22/2021

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

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

Please sign up or login with your details

Forgot password? Click here to reset