A Linear Algebraic Framework for Dynamic Scheduling Over Memory-Equipped Quantum Networks
Quantum internetworking is a recent field that promises numerous interesting applications, many of which require the distribution of entanglement between arbitrary pairs of users. This article deals with the problem of scheduling in an arbitrary entanglement swapping quantum network—often...
Saved in:
| Main Authors: | Paolo Fittipaldi, Anastasios Giovanidis, Frederic Grosshans |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2024-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10352642/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Design and analysis of parallel quantum transfer fractal priority replay with dynamic memory algorithm in quantum reinforcement learning for robotics
by: R. Palanivel, et al.
Published: (2024-12-01) -
Entanglement and teleportation in quantum key distribution for secure wireless systems
by: Md. Ferdous Ahammed, et al.
Published: (2024-12-01) -
Blind signature scheme based on entangled quantum
by: Jian-wu LIANG, et al.
Published: (2016-02-01) -
Software defined network implementation of multi-node adaptive novel quantum key distribution protocol
by: Hardeer Kaur, et al.
Published: (2024-09-01) -
Wehrl entropy and entanglement complexity of quantum spin systems
by: Chen Xu, et al.
Published: (2025-01-01)