DeepAI AI Chat
Log In Sign Up

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

by   Aritra Sarkar, et al.

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.


page 1

page 2

page 3

page 4


Quantum Accelerated Estimation of Algorithmic Information

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

On the statistical complexity of quantum circuits

In theoretical machine learning, the statistical complexity is a notion ...

Software science view on quantum circuit algorithms

We show that, on the abstraction level of quantum circuit diagrams, quan...

Learnability and Complexity of Quantum Samples

Given a quantum circuit, a quantum computer can sample the output distri...

Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis

Performance of cryptanalytic quantum search algorithms is mainly inferre...

Algorithmic No-Cloning Theorem

We introduce the notions of algorithmic mutual information and rarity of...

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

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