Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion

Details Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion

2003-05-27

arxiv.org/abs/cs/0305045v2

Computer Science

Networking and Internet Architecture

5 pages, revtex, draft version, a quick and brief discussion, comments and criticisms are welcome; writing errors corrected

Scientific paper

In this paper we briefly define distance vector routing algorithms, their advantages and possible drawbacks. On these possible drawbacks, currently widely used methods split horizon and poisoned reverse are defined and compared. The count to infinity problem is specified and it is classified to be a halting problem and a proposition stating that entangled states used in quantum computation can be used to handle this problem is examined. Several solutions to this problem by using entangled states are proposed and a very brief introduction to entangled states is presented.

Affiliated with

Also associated with

No associations

Rating

Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion 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 Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-478613