activity
20242026
collaborators

6 papers

math.RA2026

Some more talents of the talented monoid of a higher-rank graph

Roozbeh Hazrat, Huanhuan Li, Promit Mukherjee

In this paper, we explore the idea that the graded Grothendieck group , or equivalently its positive cone, the talented monoid, can detect the structural type of higher-r…

quant-ph2026

Feasibility of satellite-augmented global quantum repeater networks

Manik Dawar, Clement Paillet, Nilesh Vyas +3

A large scale quantum network requires the distribution of high-fidelity end-to-end entanglement. To overcome the range limitations inherent to terrestrial fiber, a leading archite…

cs.CR2026

Reliable and Private Anonymous Routing for Satellite Constellations

Nilesh Vyas, Fabien Geyer, Svetoslav Duhovnikov

Shared, dynamic network infrastructures, such as dual-use LEO satellite constellations, pose critical threats to metadata privacy, particularly for state actors operating in mixed-…

quant-ph2025

Quantum Internet: Resource Estimation for Entanglement Routing

Manik Dawar, Ralf Riedinger, Nilesh Vyas +1

Quantum repeaters have promised efficient scaling of quantum networks for over two decades. Despite numerous platforms proclaiming functional repeaters, the realization of large-sc…

quant-ph2025

Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks

Vladlen Galetsky, Nilesh Vyas, Alberto Comin +1

This study explores the feasibility of utilizing quantum error correction (QEC) to generate and store logical Bell states in heralded quantum entanglement protocols, crucial for qu…

quant-ph2024

Relaxing Trust Assumptions on Quantum Key Distribution Networks

Nilesh Vyas, Paulo Mendes

Quantum security over long distances with untrusted relays is largely unfounded and is still an open question for active research. Nevertheless, quantum networks based on trusted r…