Distributed quantum entanglement sharing model for high-performance real-time 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. In this paper, we proposed the distributed quantum entanglement sharing (DQES) model to share quantum entanglement with processors. Assisted with DQES model, not only the system dependability can be enhanced, but the faulty processor can also be identified. We also presented some possible applications such like database consistency, job scheduling, system dependability, and reliable communication protocols.

[1]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[2]  Andris Ambainis,et al.  The quantum communication complexity of sampling , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[3]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[4]  Chyi-Ren Dow,et al.  Design and Implementation of IPv6-based Anycast System for Mobile Ad-hoc Networks , 2008 .

[5]  Sy-Yen Kuo,et al.  Enhancing Dependability through Quantum Entanglement In a Real-Time Distributed System , 2006, 2006 Sixth IEEE Conference on Nanotechnology.

[6]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[7]  Shi-Jinn Horng,et al.  Dependabilities in a High-performance Quantum Real-time Distributed System , 2007, Fourth International Conference on Information Technology (ITNG'07).

[8]  Juraj Hromkovic,et al.  Communication Complexity and Parallel Computing , 1997, Texts in Theoretical Computer Science An EATCS Series.

[9]  Ran Raz,et al.  Exponential separation of quantum and classical communication complexity , 1999, STOC '99.

[10]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[11]  Avi Wigderson,et al.  Quantum vs. classical communication and computation , 1998, STOC '98.

[12]  M. Lewenstein,et al.  Quantum Entanglement , 2020, Quantum Mechanics.

[13]  G. Brassard,et al.  Quantum Communication Complexity , 2003 .

[14]  Harry Buhrman,et al.  Quantum Entanglement and Communication Complexity , 2000, SIAM J. Comput..

[15]  R. Cleve,et al.  SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION , 1997, quant-ph/9704026.

[16]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[17]  Peter Hoyer,et al.  Multiparty quantum communication complexity. , 1997 .

[18]  Mohammad-R Akbarzadeh-T,et al.  Pareto Front Based Realistic Soft Real-Time Task Scheduling with Multi-objective Genetic Algorithm on Arbitrary Heterogeneous Multiprocessor System , 2011 .

[19]  Ching-Hsien Hsu,et al.  A Two-Level Scheduling Strategy for optimising communications of data parallel programs in clusters , 2010, Int. J. Ad Hoc Ubiquitous Comput..

[20]  Salvatore J. Stolfo,et al.  A data mining framework for building intrusion detection models , 1999, Proceedings of the 1999 IEEE Symposium on Security and Privacy (Cat. No.99CB36344).