Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem
Quantum Physics
2007-05-23 v2
Abstract
In this work, are used Chaitin number Omega and the fact that the general decomposition of an N-way disentangled state is an irreducible sentence whose number of coefficients grows in a non-polynomial way with N, to construct a problem that can never be solved in P.
Cite
@article{arxiv.quant-ph/0612001,
title = {Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem},
author = {Rubens Viana Ramos},
journal= {arXiv preprint arXiv:quant-ph/0612001},
year = {2007}
}
Comments
5 pages