Stav Haldar

Stav Haldar

Auto-generated profile, based on publicly available information

Stav Haldar

Louisiana State University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
21 February 2024 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
SHStav Haldar
Stav Haldar
PBPratik J. Barge
Pratik J. Barge
SKSumeet Khatri
Sumeet Khatri
HLHwang Lee
Hwang Lee
Future quantum technologies such as quantum communication, quantum sensing, and distributed quantum computation, will rely on networks of shared entanglement between spatially separated nodes. In this work, we provide improved protocols and policies for entanglement distribution along a linear chain of nodes, both homogeneous and inhomogeneous, that take practical limitations into account. For a wide range of parameters, our policies improve upon previously known policies, such as the “swap-as-soon-as-possible” policy, with respect to both the waiting time and the fidelity of the end-to-end entanglement. This improvement is greatest for the most practically relevant cases, namely, for short coherence times, high link losses, and highly asymmetric links. To obtain our results, we model entanglement distribution using a Markov decision process, and then we use the Q-learning reinforcement-learning (RL) algorithm to discover alternative policies. These policies are characterized by dynamic, state-dependent memory cutoffs, and collaboration between the nodes. In particular, we quantify this collaboration between the nodes. Our quantifiers tell us how much “global” knowledge of the network every node has, specifically, how much knowledge two distant nodes have of each other’s states. In addition to the usual figures of merit, these quantifiers add an extra dimension to the performance analysis and practical implementation of quantum repeaters. Finally, our understanding of the performance of large quantum networks is currently limited by the computational inefficiency of simulating them using RL or other optimization methods. The other main contribution of our work is to address this limitation. We present a method for nesting policies in order to obtain policies for large repeater chains. By nesting our RL-based policies for small repeater chains, we obtain policies for large repeater chains that improve upon the swap-as-soon-as-possible policy, and thus we pave the way for a scalable method for obtaining policies for long-distance entanglement distribution under practical constraints.

21 February 2023 in Physical Review A
Verified
Journal Article
Closed access
PDF file
SHStav Haldar
Stav Haldar
IAIvan Agullo
Ivan Agullo
ABAnthony J. Brady
Anthony J. Brady
ALAntía Lamas-Linares
Antía Lamas-Linares
WPW. Cyrus Proctor
W. Cyrus Proctor
JTJames E. Troupe
James E. Troupe
We propose a satellite-based scheme to perform clock synchronization between ground stations spread across the globe using quantum resources. We refer to this as a quantum clock synchronization (QCS) network. Through detailed numerical simulations, we assess the feasibility and capabilities of a near-term implementation of this scheme. We consider a small constellation of satellites equipped only with modest resources. These include quantum devices such as spontaneous parametric down conversion sources, avalanche photodetectors, and moderately stable on-board clocks such as chip-scale atomic clocks. In our simulations, the various performance parameters describing the hardware have been chosen such that they are either already commercially available or require only moderate advances. We conclude that with such a scheme, establishing a global network of ground-based clocks synchronized to subnanosecond level (up to a few picoseconds) of precision would be feasible. Such QCS satellite constellations would form the infrastructure for a future quantum network, able to serve as a globally accessible entanglement resource. At the same time, our clock synchronization protocol provides the subnanosecond level synchronization required for many quantum networking protocols, and thus can be seen as adding an extra layer of utility to quantum technologies in the space domain designed for other purposes.

1 April 2025 in Communications Physics
Verified
Journal Article
Open access
SHStav Haldar
Stav Haldar
PBPratik J. Barge
Pratik J. Barge
XCXiang Cheng
Xiang Cheng
KCKai-Chi Chang
Kai-Chi Chang
BKBrian T. Kirby
Brian T. Kirby
HLHwang Lee
Hwang Lee

19 December 2023 in Physical Review A
Verified
Journal Article
Closed access
PDF file
SHStav Haldar
Stav Haldar
IAIvan Agullo
Ivan Agullo
JTJames E. Troupe
James E. Troupe
A satellite-based scheme to perform clock synchronization between ground stations spread across the globe using quantum resources was proposed in [ Phys. Rev. A 107, 022615 (2023).] based on a quantum clock synchronization (QCS) protocol. Such a scheme could achieve synchronization up to the picosecond level over distances of thousands of kilometers. Nonetheless, the implementation of this QCS protocol has yet to be demonstrated experimentally in situations where the satellite velocities cannot be neglected, as is the case in many realistic scenarios. In this work, we develop analytical and numerical tools to study the effect of the relative velocity between the satellite and ground stations on the success of the QCS protocol. We conclude that the protocol can still run successfully if the data-acquisition window is chosen appropriately. As a demonstration, we simulate the synchronization outcomes for cities across the continental United States using a single satellite in a low earth orbit, low-cost entanglement sources, portable atomic clocks, and avalanche detectors. We conclude that, after including the effect of relative motion, subnanosecond- to picosecond-level precision can still be achieved over distance scales of ≈4000 km. Such high-precision synchronization is currently not achievable over long distances (≳100km) with standard classical techniques including the GPS. The simulation tools developed in this work are in principle applicable to other means of synchronizing clocks using entangled photons, which are expected to form the basis of future quantum networks like the quantum internet, distributed quantum sensing, and the quantum GPS.

13 June 2024 in Research Square
Verified
Preprint
Open access
PDF file
SHStav Haldar
Stav Haldar
PBPratik Barge
Pratik Barge
XCXiang Cheng
Xiang Cheng
KCKai-Chi Chang
Kai-Chi Chang
BKBrian Kirby
Brian Kirby
HLHwang Lee
Hwang Lee
Future quantum networks will have nodes equipped with multiple quantum memories, allowing for multiplexing and entanglement distillation. In this work, we introduce "quasi-local" policies for multiplexed quantum repeater chains. In fully-local policies, nodes make decisions based only on knowledge of their own states. In our quasi-local policies, nodes have increased knowledge of state of the repeater chain, but not necessarily global knowledge. Our policies exploit the observation that for most decisions the nodes have to make, they only need to have information about the connected region of the chain they belong to, and not the entire chain. In this way, we not only obtain improved performance over local policies, but we reduce the classical communication (CC) costs inherent to global-knowledge policies. Our policies also outperform the well-known and widely studied nested purification and doubling swapping policy in practically relevant parameter regimes. Via analytical and numerical results, we also identify the parameter regimes in which distillation makes sense and is useful. We also address the question: "Should we distill before swapping, or vice versa?'' Finally, we propose an experimental implementation of a multiplexing-based repeater chain, and experimentally demonstrate the key element, a high-dimensional biphoton frequency comb, and evaluate its anticipated performance.

23 January 2025 in Physical Review Applied
Verified
Journal Article
Closed access
SDSage Ducoing
Sage Ducoing
IAIvan Agullo
Ivan Agullo
JTJames E. Troupe
James E. Troupe
SHStav Haldar
Stav Haldar