Abdella Battou

Dr. Abdella Battou


Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2025 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
AAAmar Abane
Amar Abane
MCMichael Cubeddu
Michael Cubeddu
VMVan Sy Mai
Van Sy Mai
ABAbdella Battou
Abdella Battou
Entanglement routing in near-term quantum networks consists of choosing the optimal sequence of short-range entanglements to combine through swapping operations to establish end-to-end entanglement between two distant nodes. Similar to traditional routing technologies, a quantum routing protocol uses network information to choose the best paths to satisfy a set of end-to-end entanglement requests. However, in addition to network state information, a quantum routing protocol must also take into account the requested entanglement fidelity, the probabilistic nature of swapping operations, and the short lifetime of entangled states. In this work, we formulate a practical entanglement routing problem and analyze and categorize the main approaches to address it, drawing comparisons to, and inspiration from, classical network routing strategies where applicable. We classify and discuss the studied quantum routing schemes into reactive, proactive, and hybrid routing.

4 June 2018 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
VMVan Sy Mai
Van Sy Mai
ABAbdella Battou
Abdella Battou
KMKevin Mills
Kevin Mills
This paper considers problems related to suppressing epidemic spread over networks given limited curing resources. The spreading dynamic is captured by a susceptible-infected-susceptible model. The epidemic threshold and recovery speed are determined by the contact network structure and the heterogeneous infection and curing rates. We develop a distributed algorithm that can be used for allocating curing resources to meet three potential objectives: minimize total curing cost while preventing an epidemic; maximize recovery speed given sufficient curing resources; or given insufficient curing resources, limit the size of an endemic state. The distributed algorithm is of the Jacobi type, and converges geometrically. We provide an upper bound on the convergence rate that depends on the structure and infection rates of the underlying network. Numerical simulations illustrate the efficiency and scalability of our distributed algorithm.

14 October 2024 in Applied Physics Letters
Verified
Journal Article
Open access
WMWayne McKenzie
Wayne McKenzie
ARAnne Marie Richards
Anne Marie Richards
SPShirali Patel
Shirali Patel
TGThomas Gerrits
Thomas Gerrits
TAT. G. Akin
T. G. Akin
ABAbdella Battou
Abdella Battou
Quantum networking protocols relying on interference and precise time-of-flight measurements require high-precision clock synchronization. This study describes the design, implementation, and characterization of two optical time transfer methods in a metropolitan-scale quantum networking research testbed. With active electronic stabilization, sub-picosecond time deviation (TDEV) was achieved at integration times between 1 and 105 s over 53 km of deployed fiber. Over the same integration periods, 10-ps level TDEV was observed using the White Rabbit–Precision Time Protocol over 128 km. Measurement methods are described to understand the sources of environmental fluctuations on clock synchronization toward the development of in situ compensation methods. Path delay gradients, chromatic dispersion, polarization drift, and optical power variations all contributed to clock synchronization errors. The results from this study will inform future work in the development of compensation methods essential for enabling experimental research in developing practical quantum networking protocols.

17 May 2023 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
VMVan Sy Mai
Van Sy Mai
RLRichard J. La
Richard J. La
TZTao Zhang
Tao Zhang
ABAbdella Battou
Abdella Battou
We propose a new distributed optimization algorithm for solving a class of constrained optimization problems in which (a) the objective function is separable (i.e., the sum of local objective functions of agents), (b) the optimization variables of distributed agents, which are subject to nontrivial local constraints, are coupled by global constraints, and (c) only noisy observations are available to estimate (the gradients of) local objective functions. In many practical scenarios, agents may not be willing to share their optimization variables with others. For this reason, we propose a distributed algorithm that does not require the agents to share their optimization variables with each other; instead, each agent maintains a local estimate of the global constraint functions and shares the estimate only with its neighbors. These local estimates of constraint functions are updated using a consensus-type algorithm, while the local optimization variables of each agent are updated using a first-order method based on noisy estimates of gradient. We prove that, when the agents adopt the proposed algorithm, their optimization variables converge with probability 1 to an optimal point of an approximated problem based on the penalty method.

25 January 2022 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
IBIvan Burenkov
Ivan Burenkov
NAN. Fajar R. Annafianto
N. Fajar R. Annafianto
MJM. V. Jabir
M. V. Jabir
MWMichael Wayne
Michael Wayne
ABAbdella Battou
Abdella Battou
SPSergey V. Polyakov
Sergey V. Polyakov
We demonstrate the single-shot confidence estimation for individual quantum measurement outcomes using the continuous measurement theory of the quantum counting process applied to the quantum state identification problem. We experimentally obtain single-shot and average confidences for quantum measurements and show that they favorably compare to that of the idealized classical measurement. Finally, we demonstrate that single-shot confidence estimations correctly represent observed experimental outcomes for a large ensemble of measurements.

1 July 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
VMVan Sy Mai
Van Sy Mai
RLRichard J. La
Richard J. La
ABAbdella Battou
Abdella Battou
We study the problem of minimizing the (time) average security costs in large networks/systems comprising many interdependent subsystems, where the state evolution is captured by a susceptible-infected-susceptible (SIS) model. The security costs reflect security investments, economic losses and recovery costs from infections and failures following successful attacks. We show that the resulting optimization problem is nonconvex and propose a suite of algorithms - two based on convex relaxations, and the other two for finding a local minimizer, based on a reduced gradient method and sequential convex programming. Also, we provide a sufficient condition under which the convex relaxations are exact and, hence, an optimal solution of the original problem can be recovered. Numerical results are provided to validate our analytical results and to demonstrate the effectiveness of the proposed algorithms.