Related papers: Adaptive-time Synchronization Algorithm for Superl…
We present a synchronization algorithm to let nodes in a sensor network simultaneously execute a task at a given point in time. In contrast to other time synchronization algorithms we do not provide a global time basis that is shared on all…
We present techniques that improve the performance of asymmetric stabilizer codes in the presence of unital channels with unknown parameters. Our method estimates the channel parameters using information recovered from syndrome measurements…
The Augmented Lagrangian Alternating Direction Inexact Newton (ALADIN) method is a cutting-edge distributed optimization algorithm known for its superior numerical performance. It relies on each agent transmitting information to a central…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
This paper shows that structured transmission schemes are a good choice for secret communication over interference networks with an eavesdropper. Structured transmission is shown to exploit channel asymmetries and thus perform better than…
Dual decomposition is widely utilized in distributed optimization of multi-agent systems. In practice, the dual decomposition algorithm is desired to admit an asynchronous implementation due to imperfect communication, such as time delay…
In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…
In this paper we present a novel method of atomic clock synchronisation combining digital error correction and phase tracking. Microwave broadcasts are used to measure the difference in frequency between a pair of atomic clocks. We use the…
Accurate network synchronization is a key enabler for services such as coherent transmission, cooperative decoding, and localization in distributed and cell-free networks. Unlike centralized networks, where synchronization is generally…
We develop a theory for long-distance quantum key distribution based on concatenated entanglement swapping using parametric down-conversion sources and show numerical results of our model. The model incorporates practical resources…
Quantum key distribution (QKD) is a cryptographic solution that leverages the properties of quantum mechanics to be resistant and secure even against an attacker with unlimited computational power. Satellite-based links are important in QKD…
We present a scalable star-shaped quantum key distribution (QKD) optical fiber network. We use wavelength-division demultiplexing (WDM) of broadband photon pairs to establish key exchange between multiple pairs of participants…
Quantum photonic technologies, such as quantum key distribution, are already benefiting greatly from the rise of integrated photonics. However, the flexibility in design of these systems is often restricted by the properties of the…
Quantum Key Distribution (QKD) allows to share random keys between two users with unconditional security: the key is usually generated by exchanging a stream of photons. The long-term vision of QKD is represented by a quantum network,…
The proliferation of wireless communications networks over the past decades, combined with the scarcity of the wireless spectrum, have motivated a significant effort towards increasing the throughput of wireless networks. One of the major…
We come up with a class of distributed quantized averaging algorithms on asynchronous communication networks with fixed, switching and random topologies. The implementation of these algorithms is subject to the realistic constraint that the…
A linear regression algorithm is applied to a digital-supermode distributed Bragg reflector laser to optimise wavelength switching times. The algorithm uses the output of a digital coherent receiver as feedback to update the pre-emphasis…
This paper introduces a novel entanglement-based QKD protocol, that makes use of a modified symmetric version of the Bernstein-Vazirani algorithm, in order to achieve a secure and efficient key distribution. Two variants of the protocol,…
We consider the decentralized stochastic asynchronous optimization setup, where many workers asynchronously calculate stochastic gradients and asynchronously communicate with each other using edges in a multigraph. For both homogeneous and…
Collective communication algorithms are an important component of distributed computation. Indeed, in the case of deep-learning, collective communication is the Amdahl's bottleneck of data-parallel training. This paper introduces SCCL (for…