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

IEEE International Conference on Recent Advances in Systems Science and Engineering (RASSE)

Scalable Quantum Network Simulation with Non-Markovian Noise and Batch-Optimized Parallel Scheduling

Amith Mathew, Ranjith Babu, Jayesh V Patil, Aswath Babu H

Published Nov 4, 2025• 0 citations
Publisher

Abstract

Most simulators for quantum networks employ rudimentary Markovian noise models that neglect the effects of history, quantum memory fatigue, and temporal correlations. In this work, we enhance the SeQUeNCe simulator by implementing (i) Enhanced Non-Markovian Noise Models (ENNM, NMAD), which incorporate memory and post-recoherence dynamics, and (ii) a batch-optimized parallel scheduling engine addressing scalability. The recoherence effect improves quantum memory performance by $\mathbf{5}-\mathbf{1 0 \%}$. The Non-Markovian models predict a $\mathbf{1 9 \%}$ reduction in the length of optimal paths for quantum memories, while the batch-parallel execution achieves an overall $4 \times$ speedup. These developments advance the realism of large-scale simulations and, more importantly, provide valuable design principles for adaptive quantum routing and scalable architectures.

DOI
10.1109/rasse64831.2025.11315307

Related papers

An Adaptive, Simulation-Driven Design of Scalable and Resilient Quantum Internet Systems Using Entanglement- Centric Networking Paradigms

A Neelavathi, A Yogameena

The realization of a large-scale Quantum Internet is a long-term objective of quantum information science, aiming to interconnect quantum devices through the reliable distribution of entanglement across long distances. Unlike classical networks, quantum networks are constrained by decoherence, probabilistic operations, and the no-cloning theorem, which fundamentally alter network design principles. This paper presents a new simulation-driven study of a scalable and resilient Quantum Internet architecture based on adaptive, entanglement-centric networking. A detailed system model is developed, incorporating realistic quantum channel noise, memory decoherence, and repeater-assisted communication. Novel fidelity-aware routing and resource-adaptive entanglement management strategies are evaluated through extensive simulations. Mathematical models, algorithmic pseudocode, and performance analysis demonstrate how adaptive control significantly improves end-to-end fidelity and network throughput under non-ideal conditions. The results provide actionable design insights for future experimental and large-scale quantum networking deployments.

Shanlax International Journal of Arts Science and Humanities•Feb 27, 2026•0 citations

Quantum Neural Networks with Non-Markovian Dynamics

Jincheng Zhang

This paper investigates the potential of quantum neural networks (QNNs) enhanced by non-Markovian dynamics. Traditional Markovian QNNs suffer from limitations in capturing long-range dependencies, a crucial aspect in complex data processing. We propose a novel QNN architecture that incorporates quantum memory and entanglement to facilitate non-Markovian information processing. This approach allows the network to retain and utilize the entire past history of the input, fundamentally altering the dynamics of information flow. Through theoretical analysis and mathematical formulations, we demonstrate how this architecture can significantly improve the network's ability to learn and represent complex patterns, particularly those exhibiting long-range correlations. Specifically, we introduce a modified update rule leveraging the concept of quantum memory and entanglement, expressed as: $ \Delta w_{ij} = \alpha \cdot E[\rho(t)|x_1, x_2, ..., x_K] \cdot \langle \psi_i | \rho(t) | \psi_j \rangle - (1 - \alpha) \cdot w_{ij}$ Where: * $ \Delta w_{ij}$ is the change in the synaptic weight between neurons *i* and *j*. * $\alpha$ is the learning rate. * $E[\rho(t)|x_1, x_2, ..., x_K]$ represents the expected state of the quantum memory at time *t*, given the entire input sequence $x_1, x_2, ..., x_K$. * $\rho(t)$ is the density matrix representing the quantum state at time *t*. * $\langle \psi_i | \rho(t) | \psi_j \rangle$ is the inner product between the quantum states $\psi_i$ and $\psi_j$ within the density matrix $\rho(t)$. * $w_{ij}$ is the current synaptic weight between neurons *i* and *j*. The core of our innovation lies in the utilization of quantum memory, modeled as a quantum state $\rho(t)$, which retains information about the entire past sequence. The entanglement between neurons further enables correlated updates, bypassing the limitations of Markovian models that only consider immediate dependencies. We explore the impact of varying the strength of entanglement and the capacity of the quantum memory on the network's performance using mathematical models. The results suggest a significant improvement in accuracy and convergence speed compared to standard Markovian QNNs when dealing with datasets exhibiting long-range dependencies. Further investigation into the scalability and practical implementation of this architecture is warranted.

•Aug 29, 2026•0 citations

Scheduling Concurrent Entanglement Requests in Quantum Networks

Gongyu Ni, Lester Ho

This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.

quant-pharXiv:2605.04767•May 7, 2026•0 citations

Parallel Simulation of Quantum Networks with Distributed Quantum State Management

Xiaoliang Wu, Alexander Kolar, Joaquín Chung +3 more

Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.

arXiv:2111.03918•ACM Transactions on Modeling and Computer Simulation•Jan 31, 2024•23 citations

Toward Scalable Quantum Networks: Fidelity-Driven Memory Optimization with Adaptive Scheduling and Decoherence Control

Dheeraj Sai Tukkugudam

Quantum networking is causing a revolution in technology. It allows secure communication and spreads quantum computing through interactions based on entanglement. However, keeping qubit coherence and making sure transmission is high-quality are big problems. This is because of decoherence, the times spent waiting for entanglement, and the delays in synchronizing up. This study suggests an improved quantum memory system to tackle these issues. It does this through making entanglement in parallel using reinforcement learning to schedule jobs and advanced ways to stop decoherence. These include quantum error correction (QEC) and dynamic decoupling (DD). The study creates a math formula to make fidelity as good as possible. It shows that this problem can be solved in polynomial time. Tests show that this system improves how well fidelity is kept and how well quantum states are sent overall. This proves that the suggested system is a good way to create quantum networks that can grow and be trusted.

•Jan 1, 2026•0 citations

Adaptive Job Scheduling in Quantum Clouds Using Reinforcement Learning

Waylon Luo, Jiapeng Zhao, Tong Zhan +1 more

Present-day quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors—all of which obstruct the execution of large and complex circuits. The advancement of quantum algorithms has outpaced the capabilities of existing quantum hardware, making it difficult to scale computations effectively. Additionally, inconsistencies in hardware performance and pervasive quantum noise undermine system stability and computational accuracy. To optimize quantum workloads under these constraints, strategic approaches to task scheduling and resource coordination are essential. One of the persistent challenges in this domain is how to efficiently divide and execute large circuits across multiple quantum processors (QPUs), especially in error-prone environments. In response, we introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels. The tool models circuit decomposition for workloads that surpass individual QPU limits, allowing for parallel execution through inter-processor communication. Using this simulation environment, we compare four distinct scheduling techniques—among them, a model informed by reinforcement learning. These strategies are evaluated across multiple metrics, including runtime efficiency, fidelity preservation, and communication costs. Our analysis underscores the trade-offs inherent in each approach and highlights how parallelized, noise-aware scheduling can meaningfully improve computational throughput in distributed quantum infrastructures.

arXiv:2506.10889•Proceedings of the International Conference on Parallel Processing•Sep 8, 2025•14 citations
Most simulators for quantum networks employ rudimentary Markovian noise models that neglect the effects of history, quantum memory fatigue, and temporal correlations. In this work, we enhance the SeQUeNCe simulator by implementing (i) Enhanced Non-Markovian Noise Models (ENNM, NMAD), which incorporate memory and post-recoherence dynamics, and (ii) a batch-optimized parallel scheduling engine addressing scalability. The recoherence effect improves quantum memory performance by 5−10%\mathbf{5}-\mathbf{1 0 \%}5−10%. The Non-Markovian models predict a 19%\mathbf{1 9 \%}19% reduction in the length of optimal paths for quantum memories, while the batch-parallel execution achieves an overall 4×4 \times4× speedup. These developments advance the realism of large-scale simulations and, more importantly, provide valuable design principles for adaptive quantum routing and scalable architectures.
The realization of a large-scale Quantum Internet is a long-term objective of quantum information science, aiming to interconnect quantum devices through the reliable distribution of entanglement across long distances. Unlike classical networks, quantum networks are constrained by decoherence, probabilistic operations, and the no-cloning theorem, which fundamentally alter network design principles. This paper presents a new simulation-driven study of a scalable and resilient Quantum Internet architecture based on adaptive, entanglement-centric networking. A detailed system model is developed, incorporating realistic quantum channel noise, memory decoherence, and repeater-assisted communication. Novel fidelity-aware routing and resource-adaptive entanglement management strategies are evaluated through extensive simulations. Mathematical models, algorithmic pseudocode, and performance analysis demonstrate how adaptive control significantly improves end-to-end fidelity and network throughput under non-ideal conditions. The results provide actionable design insights for future experimental and large-scale quantum networking deployments.
This paper investigates the potential of quantum neural networks (QNNs) enhanced by non-Markovian dynamics. Traditional Markovian QNNs suffer from limitations in capturing long-range dependencies, a crucial aspect in complex data processing. We propose a novel QNN architecture that incorporates quantum memory and entanglement to facilitate non-Markovian information processing. This approach allows the network to retain and utilize the entire past history of the input, fundamentally altering the dynamics of information flow. Through theoretical analysis and mathematical formulations, we demonstrate how this architecture can significantly improve the network's ability to learn and represent complex patterns, particularly those exhibiting long-range correlations. Specifically, we introduce a modified update rule leveraging the concept of quantum memory and entanglement, expressed as: $ \Delta w_{ij} = \alpha \cdot E[\rho(t)|x_1, x_2, ..., x_K] \cdot \langle \psi_i | \rho(t) | \psi_j \rangle - (1 - \alpha) \cdot w_{ij}$ Where: * $ \Delta w_{ij}$ is the change in the synaptic weight between neurons *i* and *j*. * α\alphaα is the learning rate. * E[ρ(t)∣x1,x2,...,xK]E[\rho(t)|x_1, x_2, ..., x_K]E[ρ(t)∣x1​,x2​,...,xK​] represents the expected state of the quantum memory at time *t*, given the entire input sequence x1,x2,...,xKx_1, x_2, ..., x_Kx1​,x2​,...,xK​. * ρ(t)\rho(t)ρ(t) is the density matrix representing the quantum state at time *t*. * ⟨ψi∣ρ(t)∣ψj⟩\langle \psi_i | \rho(t) | \psi_j \rangle⟨ψi​∣ρ(t)∣ψj​⟩ is the inner product between the quantum states ψi\psi_iψi​ and ψj\psi_jψj​ within the density matrix ρ(t)\rho(t)ρ(t). * wijw_{ij}wij​ is the current synaptic weight between neurons *i* and *j*. The core of our innovation lies in the utilization of quantum memory, modeled as a quantum state ρ(t)\rho(t)ρ(t), which retains information about the entire past sequence. The entanglement between neurons further enables correlated updates, bypassing the limitations of Markovian models that only consider immediate dependencies. We explore the impact of varying the strength of entanglement and the capacity of the quantum memory on the network's performance using mathematical models. The results suggest a significant improvement in accuracy and convergence speed compared to standard Markovian QNNs when dealing with datasets exhibiting long-range dependencies. Further investigation into the scalability and practical implementation of this architecture is warranted.
This paper investigates resource allocation for entanglement distribution in multi-node, multi-channel quantum networks at the metropolitan scale. A multi-slot quantum network simulation framework is developed across physical and network layers, incorporating heterogeneous link characteristics, limited quantum memories, request queuing, retry mechanisms, and concurrent entanglement distribution. Based on this framework, a centralized scheduling architecture is proposed to coordinate quantum memories, communication channels, and routing paths for multiple simultaneous entanglement requests. Three classes of resource allocation strategies are evaluated: heuristic approaches, a mixed-integer linear programming (MILP) optimization method, and a Proximal Policy Optimization (PPO)-based reinforcement learning approach. The heuristic schemes reveal fundamental trade-offs between request delay and entanglement success rate: Dynamic Efficient minimizes delay, Success Enhancement improves success probability through adaptive multi-path allocation, and Static Efficient provides a balance between these objectives. The MILP approach achieves optimized resource allocation by jointly considering request handling and multi-path assignment, while the PPO-based method learns adaptive scheduling policies to improve overall performance. Simulation results demonstrate that these approaches provide different performance advantages in terms of request delay, entanglement success rate, capacity utilization, and request handling rate, highlighting the trade-offs between efficiency and reliability in metropolitan-scale quantum network scheduling.
Quantum network simulators offer the opportunity to cost-efficiently investigate potential avenues for building networks that scale with the number of users, communication distance, and application demands by simulating alternative hardware designs and control protocols. Several quantum network simulators have been recently developed with these goals in mind. As the size of the simulated networks increases, however, sequential execution becomes time-consuming. Parallel execution presents a suitable method for scalable simulations of large-scale quantum networks, but the unique attributes of quantum information create unexpected challenges. In this work, we identify requirements for parallel simulation of quantum networks and develop the first parallel discrete-event quantum network simulator by modifying the existing serial simulator SeQUeNCe. Our contributions include the design and development of a quantum state manager (QSM) that maintains shared quantum information distributed across multiple processes. We also optimize our parallel code by minimizing the overhead of the QSM and decreasing the amount of synchronization needed among processes. Using these techniques, we observe a speedup of 2 to 25 times when simulating a 1,024-node linear network topology using 2 to 128 processes. We also observe an efficiency greater than 0.5 for up to 32 processes in a linear network topology of the same size and with the same workload. We repeat this evaluation with a randomized workload on a caveman network. We also introduce several methods for partitioning networks by mapping them to different parallel simulation processes. We have released the parallel SeQUeNCe simulator as an open source tool alongside the existing sequential version.
Quantum networking is causing a revolution in technology. It allows secure communication and spreads quantum computing through interactions based on entanglement. However, keeping qubit coherence and making sure transmission is high-quality are big problems. This is because of decoherence, the times spent waiting for entanglement, and the delays in synchronizing up. This study suggests an improved quantum memory system to tackle these issues. It does this through making entanglement in parallel using reinforcement learning to schedule jobs and advanced ways to stop decoherence. These include quantum error correction (QEC) and dynamic decoupling (DD). The study creates a math formula to make fidelity as good as possible. It shows that this problem can be solved in polynomial time. Tests show that this system improves how well fidelity is kept and how well quantum states are sent overall. This proves that the suggested system is a good way to create quantum networks that can grow and be trusted.
Present-day quantum systems face critical bottlenecks, including limited qubit counts, brief coherence intervals, and high susceptibility to errors—all of which obstruct the execution of large and complex circuits. The advancement of quantum algorithms has outpaced the capabilities of existing quantum hardware, making it difficult to scale computations effectively. Additionally, inconsistencies in hardware performance and pervasive quantum noise undermine system stability and computational accuracy. To optimize quantum workloads under these constraints, strategic approaches to task scheduling and resource coordination are essential. One of the persistent challenges in this domain is how to efficiently divide and execute large circuits across multiple quantum processors (QPUs), especially in error-prone environments. In response, we introduce a simulation-based tool that supports distributed scheduling and concurrent execution of quantum jobs on networked QPUs connected via real-time classical channels. The tool models circuit decomposition for workloads that surpass individual QPU limits, allowing for parallel execution through inter-processor communication. Using this simulation environment, we compare four distinct scheduling techniques—among them, a model informed by reinforcement learning. These strategies are evaluated across multiple metrics, including runtime efficiency, fidelity preservation, and communication costs. Our analysis underscores the trade-offs inherent in each approach and highlights how parallelized, noise-aware scheduling can meaningfully improve computational throughput in distributed quantum infrastructures.