Tootfinder

Design and analysis of a set of discrete variable protocols for secure quantum communication
Arindam Dutta
https://arxiv.org/abs/2508.06380 https://arxiv.o…

Design and analysis of a set of discrete variable protocols for secure quantum communication
The advent of quantum key distribution (QKD) has revolutionized secure communication by providing unconditional security, unlike classical cryptographic methods. However, its effectiveness relies on robust identity authentication, as vulnerabilities in the authentication process can cause a compromise with the security of the entire communication system. Over the past three decades, numerous quantum identity authentication (QIA) protocols have been proposed. This thesis first presents a chronol…

SKR Analysis of MIMO FSO Systems with One- and Two-way CV-QKD Protocols in Hybrid Quantum Noise Environment
Sushil Kumar, Soumya P. Dash, George C. Alexandropoulos
https://arxiv.org/abs/2509.07408

SKR Analysis of MIMO FSO Systems with One- and Two-way CV-QKD Protocols in Hybrid Quantum Noise Environment
A multiple-input multiple-output (MIMO) free-space optical (FSO) communication system is considered in this paper, which supports the secret key transmission between two legitimate users, Alice and Bob, by employing continuous-variable quantum key distribution (CV-QKD). The wireless channels are subjected to the effects of atmospheric turbulence that lead to beam spreading, pointing error, and turbulence-induced fading, which, along with the presence of hybrid quantum noise, negatively impact t…

Demystifying NCCL: An In-depth Analysis of GPU Communication Protocols and Algorithms
Zhiyi Hu, Siyuan Shen, Tommaso Bonato, Sylvain Jeaugey, Cedell Alexander, Eric Spada, Jeff Hammond, Torsten Hoefler
https://arxiv.org/abs/2507.04786

Demystifying NCCL: An In-depth Analysis of GPU Communication Protocols and Algorithms
The NVIDIA Collective Communication Library (NCCL) is a critical software layer enabling high-performance collectives on large-scale GPU clusters. Despite being open source with a documented API, its internal design remains largely opaque. The orchestration of communication channels, selection of protocols, and handling of memory movement across devices and nodes are not well understood, making it difficult to analyze performance or identify bottlenecks. This paper presents a comprehensive anal…

A Sagnac-based arbitrary time-bin state encoder for quantum communication applications
Kannan Vijayadharan, Mat\'ias Rub\'en Bola\~nos, Marco Avesani, Giuseppe Vallone, Paolo Villoresi, Costantino Agnesi
https://arxiv.org/abs/2506.08971

A Sagnac-based arbitrary time-bin state encoder for quantum communication applications
Time-bin encoding of quantum information is highly advantageous for long-distance quantum communication protocols over optical fibres due to its inherent robustness in the channel and the possibility of generating high-dimensional quantum states. The most common implementation of time-bin quantum states using unbalanced interferometers presents challenges in terms of stability and flexibility of operation. In particular, a limited number of states can be generated without modifying the optical …

Whispering Agents: An event-driven covert communication protocol for the Internet of Agents
Kaibo Huang, Yukun Wei, WanSheng Wu, Tianhua Zhang, Zhongliang Yang, Linna Zhou
https://arxiv.org/abs/2508.02188

Whispering Agents: An event-driven covert communication protocol for the Internet of Agents
The emergence of the Internet of Agents (IoA) introduces critical challenges for communication privacy in sensitive, high-stakes domains. While standard Agent-to-Agent (A2A) protocols secure message content, they are not designed to protect the act of communication itself, leaving agents vulnerable to surveillance and traffic analysis. We find that the rich, event-driven nature of agent dialogues provides a powerful, yet untapped, medium for covert communication. To harness this potential, we i…

NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing
Serge Gaspers, Zixu He, Simon Mackenzie
https://arxiv.org/abs/2508.05597 https://…

NP-Hardness and ETH-Based Inapproximability of Communication Complexity via Relaxed Interlacing
We prove that computing the deterministic communication complexity D(f) of a Boolean function is NP-hard, even when protocols are limited to a constant number of alternations, resolving a question first posed by Yao (1979). Our reduction builds and expands on a suite of structural "interlacing" lemmas introduced by Mackenzie and Saffidine (arXiv:2505.12345); these lemmas can be reused as black boxes in future lower-bound constructions. The instances produced by our reduction admit optimal pro…

Scaling atomic ordering in shared memory
Lorenzo Martignetti, Eli\~a Batista, Gianpaolo Cugola, Fernando Pedone
https://arxiv.org/abs/2509.07781 https://ar…

Scaling atomic ordering in shared memory
Atomic multicast is a communication primitive used in dependable systems to ensure consistent ordering of messages delivered to a set of replica groups. This primitive enables critical services to integrate replication and sharding (i.e., state partitioning) to achieve fault tolerance and scalability. While several atomic multicast protocols have been developed for message-passing systems, only a few are designed for the shared memory system model. This paper introduces TRAM, an atomic multicas…

Less Signals, More Understanding: Channel-Capacity Codebook Design for Digital Task-Oriented Semantic Communication
Anbang Zhang, Shuaishuai Guo, Chenyuan Feng, Hongyang Du, Haojin Li, Chen Sun, Haijun Zhang
https://arxiv.org/abs/2508.04291

Less Signals, More Understanding: Channel-Capacity Codebook Design for Digital Task-Oriented Semantic Communication
Discrete representation has emerged as a powerful tool in task-oriented semantic communication (ToSC), offering compact, interpretable, and efficient representations well-suited for low-power edge intelligence scenarios. Its inherent digital nature aligns seamlessly with hardware-friendly deployment and robust storage/transmission protocols. However, despite its strengths, current ToSC frameworks often decouple semantic-aware discrete mapping from the underlying channel characteristics and task…

FPV Protocols Explained (CRSF, SBUS, DSHOT, ACCST, PPM, PWM and more)
This post will give a broad overview of all the common RC protocols in FPV, and how they fit into the communication system in an FPV drone, and what their differences are.
🌐 https://oscarliang.com/rc-protocols/

FPV Protocols Explained (CRSF, SBUS, DSHOT, ACCST, PPM, PWM and more) - Oscar Liang
I will explain the common RC protocols between flight controller, radio receiver and transmitter communications, including SBUS, CRSF, PWM, DSMX, FPort etc.

High-Performance Heterodyne Receiver for Quantum Information Processing in a Laser Written Integrated Photonic Platform
Andrea Peri, Giulio Gualandi, Tommaso Bertapelle, Mattia Sabatini, Giacomo Corrielli, Yoann Pi\'etri, Davide Giacomo Marangon, Giuseppe Vallone, Paolo Villoresi, Roberto Osellame, Marco Avesani
https://arxi…

High-Performance Heterodyne Receiver for Quantum Information Processing in a Laser Written Integrated Photonic Platform
Continuous-Variable Quantum Key Distribution (CV-QKD) and Quantum Random Number Generation (CV-QRNG) are critical technologies for secure communication and high-speed randomness generation, exploiting shot-noise-limited coherent detection for their operation. Integrated photonic solutions are key to advancing these protocols, as they enable compact, scalable, and efficient system implementations. In this work, we introduce Femtosecond Laser Micromachining (FLM) on borosilicate glass as a novel …

Revisiting Gossip Protocols: A Vision for Emergent Coordination in Agentic Multi-Agent Systems
Mansura Habiba, Nafiul I. Khan
https://arxiv.org/abs/2508.01531 https://

Revisiting Gossip Protocols: A Vision for Emergent Coordination in Agentic Multi-Agent Systems
As agentic platforms scale, agents are evolving beyond static roles and fixed toolchains, creating a growing need for flexible, decentralized coordination. Today's structured communication protocols (e.g., direct agent-to-agent messaging) excel at reliability and task delegation, but they fall short in enabling emergent, swarm-like intelligence, where distributed agents continuously learn, adapt, and communicate to form collective cognition. This paper revisits gossip protocols, long valued in …

Conquering High Packet-Loss Erasure: MoE Swin Transformer-Based Video Semantic Communication
Lei Teng, Senran Fan, Chen Dong, Haotai Liang, Zhicheng Bao, Xiaodong Xu, Rui Meng, Ping Zhang
https://arxiv.org/abs/2508.01205

Conquering High Packet-Loss Erasure: MoE Swin Transformer-Based Video Semantic Communication
Semantic communication with joint semantic-channel coding robustly transmits diverse data modalities but faces challenges in mitigating semantic information loss due to packet drops in packet-based systems. Under current protocols, packets with errors are discarded, preventing the receiver from utilizing erroneous semantic data for robust decoding. To address this issue, a packet-loss-resistant MoE Swin Transformer-based Video Semantic Communication (MSTVSC) system is proposed in this paper. Se…

Entanglement Purification With Finite Latency Classical Communication in Quantum Networks
Vivek Vasan, Alexander Nico-Katz, Boulat A. Bash, Daniel C. Kilper, Marco Ruffini
https://arxiv.org/abs/2509.03667

Entanglement Purification With Finite Latency Classical Communication in Quantum Networks
Quantum networks rely on high fidelity entangled pairs distributed to nodes, but maintaining their fidelity is challenged by environmental decoherence during storage. Entanglement purification is used to restore fidelity, but the idle periods imposed by the associated classical communication delays counteract this goal by exposing the states to further decoherence. In this work, we analyze the practical viability of entanglement purification protocols (BBPSSW, DEJMPS), under non-instantaneous c…

A Framework for Building Data Structures from Communication Protocols
Alexandr Andoni, Shunhua Jiang, Omri Weinstein
https://arxiv.org/abs/2506.20761 https…

A Framework for Building Data Structures from Communication Protocols
We present a general framework for designing efficient data structures for high-dimensional pattern-matching problems ($\exists \;? i\in[n], f(x_i,y)=1$) through communication models in which $f(x,y)$ admits sublinear communication protocols with exponentially-small error. Specifically, we reduce the data structure problem to the Unambiguous Arthur-Merlin (UAM) communication complexity of $f(x,y)$ under product distributions. We apply our framework to the Partial Match problem (a.k.a, matchin…

A Simple and Robust Protocol for Distributed Counting
Edith Cohen, Moshe Shechner, Uri Stemmer
https://arxiv.org/abs/2509.05870 https://arxiv.org/pdf/2509.…

A Simple and Robust Protocol for Distributed Counting
We revisit the distributed counting problem, where a server must continuously approximate the total number of events occurring across $k$ sites while minimizing communication. The communication complexity of this problem is known to be $Θ(\frac{k}ε\log N)$ for deterministic protocols. Huang, Yi, and Zhang (2012) showed that randomization can reduce this to $Θ(\frac{\sqrt{k}}ε\log N)$, but their analysis is restricted to the {\em oblivious setting}, where the stream of events is independent …

Lilith: Developmental Modular LLMs with Chemical Signaling
Mohid Farooqi, Alejandro Comas-Leon
https://arxiv.org/abs/2507.04575 https://

Lilith: Developmental Modular LLMs with Chemical Signaling
Current paradigms in Artificial Intelligence rely on layers of feedforward networks which model brain activity at the neuronal level. We conjecture that expanding to the level of multiple brain regions with chemical signaling may be a productive step toward understanding the emergence of consciousness. We propose LILITH, a novel architecture that combines developmental training of modular language models with brain-inspired token-based communication protocols, mirroring chemical signaling in th…

MACTAS: Self-Attention-Based Module for Inter-Agent Communication in Multi-Agent Reinforcement Learning
Maciej Wojtala, Bogusz Stefa\'nczyk, Dominik Bogucki, {\L}ukasz Lepak, Jakub Strykowski, Pawe{\l} Wawrzy\'nski
https://arxiv.org/abs/2508.13661

MACTAS: Self-Attention-Based Module for Inter-Agent Communication in Multi-Agent Reinforcement Learning
Communication is essential for the collective execution of complex tasks by human agents, motivating interest in communication mechanisms for multi-agent reinforcement learning (MARL). However, existing communication protocols in MARL are often complex and non-differentiable. In this work, we introduce a self-attention-based communication module that exchanges information between the agents in MARL. Our proposed approach is fully differentiable, allowing agents to learn to generate messages in …

AgentMaster: A Multi-Agent Conversational Framework Using A2A and MCP Protocols for Multimodal Information Retrieval and Analysis
Callie C. Liao, Duoduo Liao, Sai Surya Gadiraju
https://arxiv.org/abs/2507.21105

AgentMaster: A Multi-Agent Conversational Framework Using A2A and MCP Protocols for Multimodal Information Retrieval and Analysis
The rise of Multi-Agent Systems (MAS) in Artificial Intelligence (AI), especially integrated with Large Language Models (LLMs), has greatly facilitated the resolution of complex tasks. However, current systems are still facing challenges of inter-agent communication, coordination, and interaction with heterogeneous tools and resources. Most recently, the Model Context Protocol (MCP) by Anthropic and Agent-to-Agent (A2A) communication protocol by Google have been introduced, and to the best of o…

Cyber Attacks Detection, Prevention, and Source Localization in Digital Substation Communication using Hybrid Statistical-Deep Learning
Nicola Cibin, Bas Mulder, Herman Carstens, Peter Palensky, Alexandru \c{S}tefanov
https://arxiv.org/abs/2507.00522

Cyber Attacks Detection, Prevention, and Source Localization in Digital Substation Communication using Hybrid Statistical-Deep Learning
The digital transformation of power systems is accelerating the adoption of IEC 61850 standard. However, its communication protocols, including Sampled Values (SV), lack built-in security features such as authentication and encryption, making them vulnerable to malicious packet injection. Such cyber attacks can delay fault clearance or trigger unintended circuit breaker operations. While most existing research focuses on detecting cyber attacks in digital substations, intrusion prevention syste…

AI Agent Communication from Internet Architecture Perspective: Challenges and Opportunities
Chenguang Du, Chuyi Wang, Yihan Chao, Xiaohui Xie, Yong Cui
https://arxiv.org/abs/2509.02317

AI Agent Communication from Internet Architecture Perspective: Challenges and Opportunities
The rapid development of AI agents leads to a surge in communication demands. Alongside this rise, a variety of frameworks and protocols emerge. While these efforts demonstrate the vitality of the field, they also highlight increasing fragmentation, with redundant innovation and siloed designs hindering cross-domain interoperability. These challenges underscore the need for a systematic perspective to guide the development of scalable, secure, and sustainable AI agent ecosystems. To address thi…

Carry the Tail in Consensus Protocols
Suyash Gupta, Dakai Kang, Dahlia Malkhi, Mohammad Sadoghi
https://arxiv.org/abs/2508.12173 https://arxiv.org/pdf/2508…

Carry the Tail in Consensus Protocols
We present Carry-the-Tail, the first deterministic atomic broadcast protocol in partial synchrony that, after GST, guarantees a constant fraction of commits by non-faulty leaders against tail-forking attacks, and maintains optimal, worst-case quadratic communication under a cascade of faulty leaders. The solution also guarantees linear amortized communication, i.e., the steady-state is linear. Prior atomic broadcast solutions achieve quadratic word communication complexity in the worst case. …

Secure Quantum Key Distribution via Entangled Quantum Walkers
Chia-Tso Lai
https://arxiv.org/abs/2508.05593 https://arxiv.org/pdf/2508.05593

Secure Quantum Key Distribution via Entangled Quantum Walkers
Quantum Key Distribution (QKD) is an emerging cryptographic method designed for secure key sharing. Its security is theoretically guaranteed by fundamental principles of quantum mechanics, making it a leading candidate for future communication protocols. Quantum Random Walks (QRWs), on the other hand, are quantum processes that exhibit intriguing phenomena such as interference and superposition, enabling the generation of decentralized and asymmetric probability distributions. Inspired by both …

Enhanced V2X Communication Using Game-Theory Based Adaptive MAC Protocols
Dhrumil Bhatt, Nirbhay Singhal
https://arxiv.org/abs/2506.09817 https://

Enhanced V2X Communication Using Game-Theory Based Adaptive MAC Protocols
This paper presents an enhanced Vehicle-to-Everything (V2X) communication system featuring adaptive Medium Access Control (MAC) using game theory. Our approach integrates dynamic transmission power control, dynamic beacon rates, contention window adaptation, and implicit acknowledgment mechanisms within a Manhattan-like grid-based mobility scenario. Simulations are conducted in a circular coverage area, incorporating refined signal propagation models and probabilistic vehicle mobility with boun…

Agentic AI Frameworks: Architectures, Protocols, and Design Challenges
Hana Derouiche, Zaki Brahmi, Haithem Mazeni
https://arxiv.org/abs/2508.10146 https://

Agentic AI Frameworks: Architectures, Protocols, and Design Challenges
The emergence of Large Language Models (LLMs) has ushered in a transformative paradigm in artificial intelligence, Agentic AI, where intelligent agents exhibit goal-directed autonomy, contextual reasoning, and dynamic multi-agent coordination. This paper provides a systematic review and comparative analysis of leading Agentic AI frameworks, including CrewAI, LangGraph, AutoGen, Semantic Kernel, Agno, Google ADK, and MetaGPT, evaluating their architectural principles, communication mechanisms, m…

Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks
Kangfeng Ye, Roberto Metere, Jim Woodcock, Poonam Yadav
https://arxiv.org/abs/2508.19430

Formal Verification of Physical Layer Security Protocols for Next-Generation Communication Networks
Formal verification is crucial for ensuring the robustness of security protocols against adversarial attacks. The Needham-Schroeder protocol, a foundational authentication mechanism, has been extensively studied, including its integration with Physical Layer Security (PLS) techniques such as watermarking and jamming. Recent research has used ProVerif to verify these mechanisms in terms of secrecy. However, the ProVerif-based approach limits the ability to improve understanding of security beyon…

Sum-frequency-based photon-number-resolving detector for telecom wavelengths
Silvia Cassina, Alex Pozzoli, Guglielmo Vesco, Marco Lamperti, Marco Marangoni, Alessia Allevi
https://arxiv.org/abs/2508.02203

Sum-frequency-based photon-number-resolving detector for telecom wavelengths
The use of C-band wavelengths in the field of quantum communication has grown significantly, driving the need for versatile detection solutions, especially in the low intensity domain. Among the desirable features for such detectors, photon-number-resolving (PNR) capability is particularly valuable, since it can offer new possibilities for enhancing security of communication protocols. In this paper, we present the implementation of a receiver that combines low-cost PNR detectors with nonlinear…

from my link log —
Idris 2: quantitative type theory in practice.
https://arxiv.org/abs/2104.00480
saved 2025-06-11 https://dotat…

Idris 2: Quantitative Type Theory in Practice
Dependent types allow us to express precisely what a function is intended to do. Recent work on Quantitative Type Theory (QTT) extends dependent type systems with linearity, also allowing precision in expressing when a function can run. This is promising, because it suggests the ability to design and reason about resource usage protocols, such as we might find in distributed and concurrent programming, where the state of a communication channel changes throughout program execution. As yet, howe…

Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
Gurleen Padda, Dave Touchette
https://arxiv.org/abs/2507.13464 https://

Round-Preserving Asymptotic Compression of Prior-Free Interactive Protocols
There is a close relationship between the communication complexity and information complexity of communication problems, as demonstrated by results such as Shannon's noiseless source coding theorem, and the Slepian-Wolf theorem. Here, we study this relationship in the prior-free and interactive setting, where we provide an alternate proof for the result of Braverman [SIAM Review, vol. 59, no. 4, 2017], that the amortized communication complexity of simulating a prior-free interactive communicat…

ros2 fanuc interface: Design and Evaluation of a Fanuc CRX Hardware Interface in ROS2
Paolo Franceschi, Marco Faroni, Stefano Baraldo, Anna Valente
https://arxiv.org/abs/2506.14487

ros2 fanuc interface: Design and Evaluation of a Fanuc CRX Hardware Interface in ROS2
This paper introduces the ROS2 control and the Hardware Interface (HW) integration for the Fanuc CRX- robot family. It explains basic implementation details and communication protocols, and its integration with the Moveit2 motion planning library. We conducted a series of experiments to evaluate relevant performances in the robotics field. We tested the developed ros2_fanuc_interface for four relevant robotics cases: step response, trajectory tracking, collision avoidance integrated with Moveit…

A Survey of LLM-Driven AI Agent Communication: Protocols, Security Risks, and Defense Countermeasures
Dezhang Kong, Shi Lin, Zhenhua Xu, Zhebo Wang, Minghao Li, Yufeng Li, Yilun Zhang, Zeyang Sha, Yuyuan Li, Changting Lin, Xun Wang, Xuan Liu, Muhammad Khurram Khan, Ningyu Zhang, Chaochao Chen, Meng Han
https://arxiv.org/abs/2506…

A Survey of LLM-Driven AI Agent Communication: Protocols, Security Risks, and Defense Countermeasures
In recent years, Large-Language-Model-driven AI agents have exhibited unprecedented intelligence, flexibility, and adaptability, and are rapidly changing human production and lifestyle. Nowadays, agents are undergoing a new round of evolution. They no longer act as an isolated island like LLMs. Instead, they start to communicate with diverse external entities, such as other agents and tools, to collectively perform more complex tasks. Under this trend, agent communication is regarded as a found…

Synergizing Logical Reasoning, Knowledge Management and Collaboration in Multi-Agent LLM System
Adam Kostka, Jaros{\l}aw A. Chudziak
https://arxiv.org/abs/2507.02170

Synergizing Logical Reasoning, Knowledge Management and Collaboration in Multi-Agent LLM System
This paper explores the integration of advanced Multi-Agent Systems (MAS) techniques to develop a team of agents with enhanced logical reasoning, long-term knowledge retention, and Theory of Mind (ToM) capabilities. By uniting these core components with optimized communication protocols, we create a novel framework called SynergyMAS, which fosters collaborative teamwork and superior problem-solving skills. The system's effectiveness is demonstrated through a product development team case study,…

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
Jinyuan Chen
https://arxiv.org/abs/2509.01118 https://…

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
In this work, we propose Ocior, a practical asynchronous Byzantine fault-tolerant (BFT) consensus protocol that achieves the optimal performance in resilience, communication, computation, and round complexity. Unlike traditional BFT consensus protocols, Ocior processes incoming transactions individually and concurrently using parallel instances of consensus. While leader-based consensus protocols rely on a designated leader to propose transactions, Ocior is a leaderless consensus protocol that …

Finite Gaussian assistance protocols and a conic metric for extremizing spacelike vacuum entanglement
Boyu Gao, Natalie Klco
https://arxiv.org/abs/2506.23968

Finite Gaussian assistance protocols and a conic metric for extremizing spacelike vacuum entanglement
In a pure Gaussian tripartition, a range of entanglement between two parties ($AB$) can be purified through classical communication of Gaussian measurements performed within the third ($C$). To begin, this work introduces a direct method to calculate a hierarchic series of projective $C$ measurements for the removal of any $AB$ Gaussian noise, circumventing divergences in prior protocols. Next, a multimode conic framework is developed for pursuing the maximum (Gaussian entanglement of assistanc…

ML-MaxProp: Bridging Machine Learning and Delay-Tolerant Routing for Resilient Post-Disaster Communication
Tao Xiuyuan, Milena Radenkovic
https://arxiv.org/abs/2508.20077 https:…

ML-MaxProp: Bridging Machine Learning and Delay-Tolerant Routing for Resilient Post-Disaster Communication
In disaster-stricken and large-scale urban emergency scenarios, ensuring reliable communication remains a formidable challenge, as collapsed infrastructure, unpredictable mobility, and severely constrained resources disrupt conventional networks. Delay-Tolerant Networks (DTNs), though resilient through their store-carry-forward paradigm, reveal the fundamental weaknesses of classical protocols - Epidemic, Spray-and-Wait, and MaxProp - when confronted with sparse encounters, buffer shortages, an…

Equality is Far Weaker than Constant-Cost Communication
Mika G\"o\"os, Nathaniel Harms, Artur Riazanov
https://arxiv.org/abs/2507.11162 https://

Equality is Far Weaker than Constant-Cost Communication
We exhibit an $n$-bit communication problem with a constant-cost randomized protocol but which requires $n^{Ω(1)}$ deterministic (or even non-deterministic) queries to an Equality oracle. Therefore, even constant-cost randomized protocols cannot be efficiently "derandomized" using Equality oracles. This improves on several recent results and answers a question from the survey of Hatami and Hatami (SIGACT News 2024). It also gives a significantly simpler and quantitatively superior proof of the…

Apology of Green Digitalization in the Context of Information and Climate Feedback Theory
Eldar Knar
https://arxiv.org/abs/2507.14162 https://

Apology of Green Digitalization in the Context of Information and Climate Feedback Theory
Amid accelerated digitalization, not only is the scale of data processing and storage increasing, but so too is the associated infrastructure load on the climate. Current climate models and environmental protocols almost entirely overlook the impact of information and communication technologies on the thermal and energy balance of the biosphere. This paper proposes the theory of information and climate feedback (ICF) as a new nonlinear model describing the loop of digitalization, energy consu…

Replaced article(s) found for cs.AR. https://arxiv.org/list/cs.AR/new
[1/1]:
- ProtocolLLM: RTL Benchmark for SystemVerilog Generation of Communication Protocols
Arnav Sheth, Ivaxi Sheth, Mario Fritz

Distributed Download from an External Data Source in Asynchronous Faulty Settings
John Augustine, Soumyottam Chatterjee, Valerie King, Manish Kumar, Shachar Meir, David Peleg
https://arxiv.org/abs/2509.03755

Distributed Download from an External Data Source in Asynchronous Faulty Settings
The distributedData Retrieval (DR) model consists of $k$ peers connected by a complete peer-to-peer communication network, and a trusted external data source that stores an array $\textbf{X}$ of $n$ bits ($n \gg k$). Up to $βk$ of the peers might fail in any execution (for $β\in [0, 1)$). Peers can obtain the information either by inexpensive messages passed among themselves or through expensive queries to the source array $\textbf{X}$. In the DR model, we focus on designing protocols that mi…

Long-distance device-independent quantum key distribution with standard optics tools
Makoto Ishihara, Anthony Brendan, Wojciech Roga, Masahiro Takeoka
https://arxiv.org/abs/2508.02262

Long-distance device-independent quantum key distribution with standard optics tools
Device-independent quantum key distribution (DI-QKD) enables information-theoretically secure key distribution between remote parties without any assumptions on the internal workings of the devices used for its implementation. However, its communication distance is strictly limited since the loophole-free Bell violation is required to guarantee its security. Therefore, in this paper, we propose two long-distance DI-QKD protocols which use a heralding scheme based on single-photon interference. …

CAN Networks Security in Smart Grids Communication Technologies
Ayman W. Baharia, Khaled T. Naga, Hesham S. Abdelfattah, Shady A. Maged, Sherif A. Hammad
https://arxiv.org/abs/2508.12181

CAN Networks Security in Smart Grids Communication Technologies
The rapid evolution of smart grids requires effective communication protocols to transfer data reliably and securely. Controller Area Network (CAN) is one of the most recognized protocols that offer reliable data transmission in smart grids due to its robustness, real-time capabilities, and relatively low initial cost of its required hardware. However, as a smart city becomes more interconnected, it also becomes more vulnerable to cyber-attacks. As there are many mechanisms to secure the CAN no…

Entanglement Management in Space-Based Quantum Information Networks
Luca Paccard, Agathe Blaise, Fabrice Arnal, Laurent de Forges de Parny
https://arxiv.org/abs/2508.00793 https…

Entanglement Management in Space-Based Quantum Information Networks
With the evolution of quantum computing, quantum sensing and secure quantum communication protocols, the demand for global development of Quantum Information Networks (QIN) has become crucial. Satellites play an indispensable role in enabling connectivity across vast distances, transcending terrestrial limitations. In this article, we explore various ways in which satellites may be involved in the deployment of these novel networks from their integration into the network architecture to the cha…

A Grant-free Coded Random Access Scheme for Near-field Communications
Enrico Testi, Giulia Torcolacci, Nicol\`o Decarli, Davide Dardari, Enrico Paolini
https://arxiv.org/abs/2508.15673

A Grant-free Coded Random Access Scheme for Near-field Communications
The industrial Internet of things (IIoT) is revolutionizing industrial processes by facilitating massive machine-type communications among countless interconnected devices. To efficiently handle the resulting large-scale and sporadic traffic, grant-free random access protocols-especially coded random access (CRA)-have emerged as scalable and reliable solutions. At the same time, advancements in wireless hardware, including extremely large-scale MIMO arrays and high-frequency communication (e.g.…

Optimal distillation of photonic indistinguishability
Francesco Hoch, Anita Camillini, Giovanni Rodari, Eugenio Caruccio, Gonzalo Carvacho, Taira Giordani, Riccardo Albiero, Niki Di Giano, Giacomo Corrielli, Francesco Ceccarelli, Roberto Osellame, Marco Robbio, Leonardo Novo, Nicol\`o Spagnolo, Ernesto F. Galv\~ao, Fabio Sciarrino
https://…

Optimal distillation of photonic indistinguishability
Imperfect photons' indistinguishability limits the performance of photonic quantum communication and computation . Distillation protocols, inspired by entanglement purification, enhance photons' indistinguishability by leveraging quantum interference in linear optical circuits. In this work, we present a three-photon distillation protocol optimized to achieve the maximum visibility gain, which requires consideration of multi-photon effects such as collective photonic phases. We employ interfero…

Hybrid quantum memory leveraging slow-light and gradient-echo duality
Stanis{\l}aw Kurzyna, Mateusz Mazelanik, Wojciech Wasilewski, Micha{\l} Parniak
https://arxiv.org/abs/2509.02810

Hybrid quantum memory leveraging slow-light and gradient-echo duality
We demonstrate a hybrid quantum memory that combines Gradient Echo Memory (GEM) and Electromagnetically Induced Transparency (EIT) protocols for reversible mapping between light and atomic coherence. By leveraging GEM and EIT complementarity, we realize time-to-frequency and frequency-to-time conversion mechanisms for spectro-temporal modes. This capability provides a versatile tool for quantum communication, where coherent frequency-time conversion enhances network interoperability. In additio…

Qualitative Assessment of Low Power Wide Area Network Protocols and their Security Aspect
Wesley dos Reis Bezerra, Lais Machado Bezerra, Carlos Becker Westphal
https://arxiv.org/abs/2507.08677

Qualitative Assessment of Low Power Wide Area Network Protocols and their Security Aspect
There are currently many communication options in the Internet of Things, even in particular areas such as constrained and battery-powered devices, such as Low Power Wide Area Networks. Understanding the differences and characteristics of each option is a challenge, even for professionals and researchers in the field. To meet this need, this work analyses the qualitative characteristics of Low Power Wide Area Network protocols and the challenges and opportunities of using constrained devices fo…

QNPU: Quantum Network Processor Unit for Quantum Supercomputers
Peiyi Li, Chenxu Liu, Ji Liu, Huiyang Zhou, Ang Li
https://arxiv.org/abs/2509.02827 https://

QNPU: Quantum Network Processor Unit for Quantum Supercomputers
As quantum computing progresses, the need for scalable solutions to address large-scale computational problems has become critical. Quantum supercomputers are the next upcoming frontier by enabling multiple quantum processors to collaborate effectively to solve large-scale computational problems. The emergence of quantum supercomputers necessitates an efficient interface to manage the quantum communication protocols between quantum processors. In this paper, we propose the Quantum Network Proce…

Addressing Weak Authentication like RFID, NFC in EVs and EVCs using AI-powered Adaptive Authentication
Onyinye Okoye
https://arxiv.org/abs/2508.19465 https://

Addressing Weak Authentication like RFID, NFC in EVs and EVCs using AI-powered Adaptive Authentication
The rapid expansion of the Electric Vehicles (EVs) and Electric Vehicle Charging Systems (EVCs) has introduced new cybersecurity challenges, specifically in authentication protocols that protect vehicles, users, and energy infrastructure. Although widely adopted for convenience, traditional authentication mechanisms like Radio Frequency Identification (RFID) and Near Field Communication (NFC) rely on static identifiers and weak encryption, making them highly vulnerable to attack vectors such as…

Quantum Communication Complexity of L2-Regularized Linear Regression Protocols
Sayaki Matsushita
https://arxiv.org/abs/2508.16141 https://arxiv.org/pdf/250…

Quantum Communication Complexity of L2-Regularized Linear Regression Protocols
Linear regression is fundamental to statistical analysis and machine learning, but its application to large-scale datasets necessitates distributed computing. The problem also arises in quantum computing, where handling extensive data requires distributed approaches. This paper investigates distributed linear regression in the quantum coordinator model. Building upon the distributed quantum least squares protocol developed by Montanaro and Shao, we propose improved and extended quantum protocol…

Combining Static and Dynamic Traffic with Delay Guarantees in Time-Sensitive Networking
Lisa Maile, Kai-Steffen Hielscher, Reinhard German
https://arxiv.org/abs/2508.18883 https…

Combining Static and Dynamic Traffic with Delay Guarantees in Time-Sensitive Networking
To support reliable and low-latency communication, Time-Sensitive Networking introduced protocols and interfaces for resource allocation in Ethernet. However, the implementation of these allocation algorithms has not yet been covered by the standards. Our work focuses on deadline-guaranteeing resource allocation for networks with static and dynamic traffic. To achieve this, we combine offline network optimization heuristics with online admission control and, thus, allow for new flow registratio…

The Proportional Fair Scheduler in Wavelength-Multiplexed Quantum Networks
Sanidhay Bhambay, Siddarth Koduru Joshi, Thirupathaiah Vasantam, Neil Walton
https://arxiv.org/abs/2507.13999

The Proportional Fair Scheduler in Wavelength-Multiplexed Quantum Networks
We address the problem of optimal pumping strategies in quantum networks. These networks enable secure communication by distributing entangled photon pairs to user (or node) pairs. Quantum Key Distribution (QKD) protocols, like BBM92, generate secret keys from entangled photons. While secure communication and error correction are essential for any quantum communication channel, resource contention, optimization, and fairness issues are critical for networks. In this article, we analyze the perf…

A Group-Theoretic Perspective on the PPT and Realignment Entanglement Criteria
Tobias C. Sutter, Christopher Popp, Beatrix C. Hiesmayr
https://arxiv.org/abs/2508.18393 https://

A Group-Theoretic Perspective on the PPT and Realignment Entanglement Criteria
Entanglement is a key feature in many quantum technologies, including secure communication protocols and quantum computing. However, detecting it in mixed quantum states remains a challenging task. While the PPT and realignment criteria are well-established tools for entanglement detection in general, and are especially effective in Bell-diagonal states, their connection to the underlying group structure of this state family has not been fully explored. In this work, we analyze the PPT and real…

System design and realisation towards optimising secure key bits in free space QKD
Pooja Chandravanshi, Jayanth Ramakrishnan, Tanya Sharma, Ayan Biswas, Ravindra P. Singh
https://arxiv.org/abs/2508.10458

System design and realisation towards optimising secure key bits in free space QKD
Quantum Key Distribution (QKD) is rapidly transitioning from cutting-edge laboratory research to real-world deployment in established communication networks. Although QKD promises future-proof security, practical challenges stil exist due to imperfections in physical devices. Many protocols offer strong security guarantees, but their implementation can be complex and difficult. To bridge this gap, we present a practical and systematic framework for implementing QKD, focused on the BB84 protocol…

Bipartite entanglement extracted from multimode squeezed light generated in lossy waveguides
Denis A. Kopylov, Torsten Meier, Polina R. Sharapova
https://arxiv.org/abs/2506.09587 …

Bipartite entanglement extracted from multimode squeezed light generated in lossy waveguides
Entangled two-mode Gaussian states constitute an important building block for continuous variable quantum computing and communication protocols and are thus of high demand for many experiments. In this work, we study such kind of states which are extracted from multimode light generated via type-II parametric down-conversion (PDC) in lossy waveguides. For such states, we demonstrate that the squeezing quantifies entanglement and we construct a measurement basis which results in the maximal bipa…