Semiclassical Quantum Computation Solutions to the Count to Infinity Problem: A Brief Discussion
Burc Gokden
Abstract
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.
Create a lesson
Related papers
Goal-Oriented Bundle Management and Flow Control for Deep-Space Communications via Reinforcement Learning
Sajjad Baghaeea, Aimin Lib, Shanmugarajan Balasubramanian et al.
One-Way Delay Model for 5G Low Latency, High Data Rate Communications
Hamid Hassani, Sonia M. Heemstra de Groot, Ignas G. Niemegeers et al.
RAPID: Proactive Rate Control for Enabling High Data Rate and Low Latency in 5G Edge Networks
Hamid Hassani, Sonia M. Heemstra de Groot, Ignas G. Niemegeers et al.
On the Alignment Between Spectral Efficiency and Positioning Accuracy in Multi-LEO Clusters
Konstantinos Kapoglis, Sharief Saleh, Henk Wymeersch et al.
Maneuver Coordination Using V2I to Improve Traffic Efficiency at Intersections
Lorenzo Farina, Marco Rapelli, Barbara Mavì Masini et al.
Configuration Migration Planning through Decoupled Modeling and Searching
Dan Wang, Peng Zhang, Ratul Mahajan