output
20192025
most citedPaving the Way towards 800 Gbps Quantum-Secured Optical Channel Deployment in Mission-Critical Environments

11 citations

7 papers

quant-ph2025

Bell-Inequality Violation for Continuous, Non-Projective Measurements

Shalender Singh, Santosh Kumar

Many solid-state quantum platforms do not permit sharp, projective measurements but instead yield continuous voltage or field traces under weak, non-demolition readout. In such sys…

cs.LG2023

Reinforcement Learning in a Birth and Death Process: Breaking the Dependence on the State Space

Jonatha Anselmi, Bruno Gaujal, Louis-Sébastien Rebuffi

In this paper, we revisit the regret of undiscounted reinforcement learning in MDPs with a birth and death structure. Specifically, we consider a controlled queue with impatient jo…

quant-ph2022★ 11 cited

Paving the Way towards 800 Gbps Quantum-Secured Optical Channel Deployment in Mission-Critical Environments

Marco Pistoia, Omar Amer, Monik R. Behera +16

This article describes experimental research studies conducted towards understanding the implementation aspects of high-capacity quantum-secured optical channels in mission-critica…

cs.LG2021

Reinforcement Learning for Markovian Bandits: Is Posterior Sampling more Scalable than Optimism?

Nicolas Gast, Bruno Gaujal, Kimang Khun

We study learning algorithms for the classical Markovian bandit problem with discount. We explain how to adapt PSRL [24] and UCRL2 [2] to exploit the problem structure. These varia…

cs.DC2021

Simulation-based Optimization and Sensibility Analysis of MPI Applications: Variability Matters

Tom Cornebize, Arnaud Legrand

Finely tuning MPI applications and understanding the influence of keyparameters (number of processes, granularity, collective operationalgorithms, virtual topology, and process pla…

cs.PF2020

Exponential Convergence Rate for the Asymptotic Optimality of Whittle Index Policy

Nicolas Gast, Bruno Gaujal, Chen Yan

We evaluate the performance of Whittle index policy for restless Markovian bandits, when the number of bandits grows. It is proven in [30] that this performance is asymptotically o…

cs.DC2019

DGEMM performance is data-dependent

Tom Cornebize, Arnaud Legrand

The DGEMM function is a widely used implementation of the matrix product. While the asymptotic complexity of the algorithm only depends on the sizes of the matrices, we show that t…