The Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P

Simple item page
dc.creatorRamos, Rubens Viana
dc.date2006-11-02
dc.date.accessioned2026-07-07T07:34:07Z
dc.date.available2026-07-07T07:34:07Z
dc.descriptionIn 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.
dc.description3 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/quant-ph/0611027
dc.identifierhttp://arxiv.org/abs/quant-ph/0611027
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119695
dc.subjectQuantum Physics
dc.titleThe Importance of the Algorithmic Information Theory to Construct a Possible Example Where NP#P
dc.typetext

Files

Collections

arXiv