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

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

2006-11-30

arxiv.org/abs/quant-ph/0612001v2

Physics

Quantum Physics

5 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Using Disentangled States and Algorithmic Information Theory to Construct a Not P Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391151