Dependabilities in a high-performance quantum real-time distributed system

Two processors jointly provide a real-time service which can be completed by exactly one processor. Assuming each processor is allowed to announce only a one-bit information in a distributed way to decide which one should process the job, inevitably some of the jobs will get lost if only classical resources are used. An example of this distributed system problems in real life can be found in baseball. Assume Alice and Bob are two outfielders in a baseball game. When the batter hits an outfield fly ball, they run toward the ball and try to make a catch. At the same time, depending on their confidence, Alice and Bob announce their intention to catch the ball by shouting "I'll get it". However, when both of them want to catch the ball, they will collide, fall down, and drop the ball. Or, in order not to collide with each other, sometimes neither of them will attempt to catch the ball and the ball will drop. Worse yet, if the ball drops, they will blame each other for having made the same decision. In this paper, we show the system dependability can be enhanced if those processors share quantum entanglement.