Semiclassical quantum computation solutions to the count to infinity problem : A brief discussion
International Journal of Quantum Information
159 - 164
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27386
In this paper we briefly define distance vector routingalgorithms, their advantages and possible drawbacks. On thesepossible drawbacks, currently widely used methods split horizonand poisoned reverse are defined and compared. The count toinfinity problem is specified and classified to be a haltingproblem, and a proposition stating that entangled states used inquantum computation can be used to handle this problem isexamined. Several solutions to this problem by using entangledstates are proposed and a very brief introduction to entangledstates is presented.