Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem

Simple item page
dc.creatorRamos, Rubens Viana
dc.date2006-11-30
dc.date2006-12-07
dc.date.accessioned2026-07-07T07:35:05Z
dc.date.available2026-07-07T07:35:05Z
dc.descriptionIn 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0612001
dc.identifierhttp://arxiv.org/abs/quant-ph/0612001
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/119985
dc.subjectQuantum Physics
dc.titleUsing Disentangled States and Algorithmic Information Theory to Construct a Not P Problem
dc.typetext

Files

Collections

arXiv