Show simple item record

dc.contributor.authorGökden, B.en_US
dc.date.accessioned2016-02-08T11:51:56Z
dc.date.available2016-02-08T11:51:56Z
dc.date.issued2005en_US
dc.identifier.issn0219-7499
dc.identifier.urihttp://hdl.handle.net/11693/27386
dc.description.abstractIn 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.en_US
dc.language.isoEnglishen_US
dc.source.titleInternational Journal of Quantum Informationen_US
dc.relation.isversionofhttp://dx.doi.org/10.1142/S0219749905000645en_US
dc.subjectComputer networksen_US
dc.subjectCounting to infinity problemen_US
dc.subjectDistance vector routingen_US
dc.subjectEntanglementen_US
dc.subjectHalting problemen_US
dc.subjectQuantum computersen_US
dc.subjectRouting information protocolen_US
dc.titleSemiclassical quantum computation solutions to the count to infinity problem: A brief discussionen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Physics
dc.citation.spage159en_US
dc.citation.epage164en_US
dc.citation.volumeNumber3en_US
dc.citation.issueNumber1en_US
dc.identifier.doi10.1142/S0219749905000645en_US
dc.publisherWorld Scientificen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record