Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ESTIMATION OF QUANTUM TIME LENGTH FOR ROUND-ROBIN SCHEDULING ALGORITHM USING NEURAL NETWORKS

Omar Alheyasat, Randa Herzallah

Published Jan 1, 2010• 3 citations
Publisher
DOI
10.5220/0003058002530257

Related papers

Time Series Forecasting with Quantum Neural Networks

Manuel Pegalájar Cuéllar, M.C. Pegalajar, L. G. B. Ruiz +1 more

Lecture notes in computer science•Jan 1, 2023•5 citations

Quantum time lenghth estimation for round-robin scheduling algorithm using neural networks

Omar Alheyasat

Алгоритм планування Round Robin (RR), що використовується для планування процесора, вважається компромісним щодо справедливості серед різних механізмів і дисциплін, які опікуються розподілом процесорного часу між процесами, що перебувають у черзі готових. RR, «першим прийшов — першим обслужений», високий пріоритет, «найкоротша задача першою» та інші алгоритми мають кілька недоліків під час роботи із системами реального часу та обмеженнями за кінцевими термінами. У реальних системах з розподілом часу обслуговування (поведінка) RR широко використовується.

•Jan 1, 2007•0 citations

Quantum Neural Networks

Sanjay Gupta, Royce K. P. Zia

arXiv:quant-ph/0201144•Journal of Computer and System Sciences•Nov 1, 2001•200 citations

A security proof of the round-robin differential phase shift quantum key distribution protocol based on the signal disturbance

Toshihiko Sasaki, Masato Koashi

Abstract The round-robin differential phase shift (RRDPS) quantum key distribution (QKD) protocol is a unique QKD protocol whose security has not been understood through an information-disturbance trade-off relation, and a sufficient amount of privacy amplification was given independently of signal disturbance. Here, we discuss the security of the RRDPS protocol in the asymptotic regime when a good estimate of the bit error rate is available as a measure of signal disturbance. The uniqueness of the RRDPS protocol shows up as a peculiar form of information-disturbance trade-off curve. When the length of a block of pulses used for encoding and the signal disturbance are both small, it provides a significantly better key rate than that from the original security proof. On the other hand, when the block length is large, the use of the signal disturbance makes little improvement in the key rate. Our analysis will bridge a gap between the RRDPS protocol and the conventional QKD protocols.

arXiv:1701.08509•Quantum Science and Technology•Apr 24, 2017•16 citations

Round-robin-differential-phase-shift quantum key distribution with monitoring signal disturbance

Rong Wang, Zhen−Qiang Yin, Shuang Wang +3 more

In recent years, round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) has attracted great attention for its unique characteristics, i.e., the information leakage can be bounded without learning bit error rate. Though the RRDPS QKD has made a breakthrough, it is still a question of how RRDPS will perform with monitoring signal disturbance, e.g., decoy-state and error rate statistics are both used. Here, we present simulations to study RRDPS protocol while monitoring signal disturbance. To our excitement, when using the infinite decoy-states method, RRDPS protocol can outperform the commonly used Bennett and Brassard 1984 (BB84) protocol in terms of channel length under typical experimental parameters. In the case of finite decoy states, we find that only two decoy-states and one signal state are sufficient to obtain performance very close to the infinite decoy-states case. Our simulations prove that RRDPS is a competitive protocol in real-life situations.

Optics Letters•Aug 24, 2018•8 citations

Quantum Neural Nets

Michail A. Zak, Colin P. Williams

International Journal of Theoretical Physics•Feb 1, 1998•60 citations
Алгоритм планування Round Robin (RR), що використовується для планування процесора, вважається компромісним щодо справедливості серед різних механізмів і дисциплін, які опікуються розподілом процесорного часу між процесами, що перебувають у черзі готових. RR, «першим прийшов — першим обслужений», високий пріоритет, «найкоротша задача першою» та інші алгоритми мають кілька недоліків під час роботи із системами реального часу та обмеженнями за кінцевими термінами. У реальних системах з розподілом часу обслуговування (поведінка) RR широко використовується.
Abstract The round-robin differential phase shift (RRDPS) quantum key distribution (QKD) protocol is a unique QKD protocol whose security has not been understood through an information-disturbance trade-off relation, and a sufficient amount of privacy amplification was given independently of signal disturbance. Here, we discuss the security of the RRDPS protocol in the asymptotic regime when a good estimate of the bit error rate is available as a measure of signal disturbance. The uniqueness of the RRDPS protocol shows up as a peculiar form of information-disturbance trade-off curve. When the length of a block of pulses used for encoding and the signal disturbance are both small, it provides a significantly better key rate than that from the original security proof. On the other hand, when the block length is large, the use of the signal disturbance makes little improvement in the key rate. Our analysis will bridge a gap between the RRDPS protocol and the conventional QKD protocols.
In recent years, round-robin-differential-phase-shift (RRDPS) quantum key distribution (QKD) has attracted great attention for its unique characteristics, i.e., the information leakage can be bounded without learning bit error rate. Though the RRDPS QKD has made a breakthrough, it is still a question of how RRDPS will perform with monitoring signal disturbance, e.g., decoy-state and error rate statistics are both used. Here, we present simulations to study RRDPS protocol while monitoring signal disturbance. To our excitement, when using the infinite decoy-states method, RRDPS protocol can outperform the commonly used Bennett and Brassard 1984 (BB84) protocol in terms of channel length under typical experimental parameters. In the case of finite decoy states, we find that only two decoy-states and one signal state are sufficient to obtain performance very close to the infinite decoy-states case. Our simulations prove that RRDPS is a competitive protocol in real-life situations.