The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP # P - II: An Irreducible Sentence

TL;DR

This paper explores the connection between algorithmic information theory and quantum states, aiming to construct an irreducible sentence whose length grows non-polynomially with the number of qubits, highlighting complexity in quantum information.

Contribution

It introduces a novel approach linking algorithmic information theory to quantum state complexity, proposing a method to construct irreducible sentences with non-polynomial length growth.

Findings

Proposes a theoretical framework connecting quantum states and algorithmic information

Suggests the existence of irreducible sentences with non-polynomial length growth

Highlights implications for complexity in quantum information theory

Abstract

In this short communication it is discussed the relation between disentangled states and algorithmic information theory aiming to construct an irreducible sentence whose length increases in a non-polynomial way when the number of qubits increases.