Semiclassical quantum computation solutions to the count to infinity problem: a brief discussion
Date
2005
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
BUIR Usage Stats
2
views
views
21
downloads
downloads
Citation Stats
Series
Abstract
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.
Source Title
International Journal of Quantum Information
Publisher
World Scientific Publishing
Course
Other identifiers
Book Title
Degree Discipline
Degree Level
Degree Name
Citation
Permalink
Published Version (Please cite this version)
Collections
Language
English