The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P
Quantum Physics
2007-05-23 v1
Abstract
In this short communication, it is shown a simple problem using quantum circuits for which the algorithmic information theory guarantee that the minimal length of the algorithm able to solve it grows exponentially with the number of qubits.
Cite
@article{arxiv.quant-ph/0611027,
title = {The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P},
author = {Rubens Viana Ramos},
journal= {arXiv preprint arXiv:quant-ph/0611027},
year = {2007}
}
Comments
3 pages, 1 figure