Physics-Informed Neural Networks for Quantum Internet Modeling: Concepts, Implementation, and Future Directions
Bibliographic record
Abstract
The classical Internet faces increasing limitations as data generation and device interconnectivity expand at unprecedented rates. In recent years, this has highlighted the need for communication frameworks that surpass classical limitations. The quantum Internet (QI), composed of multiple layers of quantum communication networks (QCNs), holds promise for remarkable capabilities in secure transmission, distributed quantum computing, and quantum-enhanced sensing. Accurate and scalable modeling of QCNs is essential for designing, analyzing, and optimizing QI protocols under realistic physical conditions. To model such open quantum systems under Markovian noise, the Lindblad master equation is widely used, but its modeling complexity grows exponentially with the system size. In this work, we introduce a learned approach that utilizes a physics-informed neural network (PINN) to model the dynamics of open quantum systems, which embeds the Lindblad formalism directly into the neural network's loss function. We demonstrate the effectiveness of our method by simulating the entanglement fidelity decay of a two-qubit Bell state under energy damping and phase decoherence noise, which is a relevant scenario for entanglement-based QI protocols. Preliminary numerical results show that the PINN-based solver aligns with conventional partial differential equation techniques while offering improved scalability. These findings suggest that PINNs could serve as an efficient approach for accelerating the analysis of future quantum networking solutions. Finally, we conclude by outlining key future directions for scaling the framework to support QCN-level optimization.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".