Kaushik P. Seshadreesan

Kaushik P. Seshadreesan

Auto-generated profile, based on publicly available information

Kaushik P. Seshadreesan

Department of Informatics and Networked Systems, School of Computing and Information, University of Pittsburgh, Pittsburgh, PA, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
17 August 2020 in Physical Review Applied
Verified
Journal Article
Open access
PDF file
ZPZiwen Pan
Ziwen Pan
KSKaushik P. Seshadreesan
Kaushik P. Seshadreesan
WCWilliam Clark
William Clark
MAMark R. Adcock
Mark R. Adcock
Ivan B. DjordjevicIvan B. Djordjevic
Ivan B. Djordjevic
SGSaikat Guha
Saikat Guha
The theory of quantum cryptography aims to guarantee unconditional information-theoretic security against an omnipotent eavesdropper. In many practical scenarios, however, the assumption of an all-powerful adversary is excessive and can be relaxed considerably. In this paper we study secret-key distillation across a lossy and noisy quantum wiretap channel between Alice and Bob, with a separately parameterized realistically lossy quantum channel to the eavesdropper Eve. We show that under such restricted eavesdropping, the key rates achievable can exceed the secret-key-distillation capacity against an unrestricted eavesdropper in the quantum wiretap channel. Furthermore, we show upper bounds on the key rates based on the relative entropy of entanglement. This simple restricted eavesdropping model is widely applicable, for example, to free-space quantum optical communication, where realistic collection of light by Eve is limited by the finite size of her optical aperture. Future work will include calculating bounds on the amount of light Eve can collect under various realistic scenarios.

14 May 2020 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
CCChaohan Cui
Chaohan Cui
KSKaushik P. Seshadreesan
Kaushik P. Seshadreesan
SGSaikat Guha
Saikat Guha
LFLinran Fan
Linran Fan
In this Letter, we propose a new approach to process high-dimensional quantum information encoded in a photon frequency domain. In contrast to previous approaches based on nonlinear optical processes, no active control of photon energy is required. Arbitrary unitary transformation and projection measurement can be realized with passive photonic circuits and time-resolving detection. A systematic circuit design for a quantum frequency comb with arbitrary size has been given. The criteria to verify quantum frequency correlation has been derived. By considering the practical condition of the detector’s finite response time, we show that high-fidelity operation can be readily realized with current device performance. This work will pave the way towards scalable and high-fidelity quantum information processing based on high-dimensional frequency encoding.

16 October 2024 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
MAMohadeseh Azari
Mohadeseh Azari
PPPaul Polakos
Paul Polakos
KSKaushik P. Seshadreesan
Kaushik P. Seshadreesan
The Gottesman-Kitaev-Preskill (GKP) code, being information theoretically near optimal for quantum communication over Gaussian thermal-loss optical channels, is likely to be the encoding of choice for advanced quantum networks of the future. Quantum repeaters based on GKP-encoded light have been shown to support high end-to-end entanglement rates across large distances despite realistic finite squeezing in GKP code preparation and homodyne detection inefficiencies. Here, we introduce a quantum switch for GKP qubit-based quantum networks. Its architecture involves multiplexed GKP qubit-based entanglement link generation with clients and their all-photonic storage, enabled by GKP qubit graph state resources. The switch uses a multi-client generalization of a recently introduced entanglement-ranking-based link matching heuristic for bipartite entanglement distribution between clients via entanglement swapping. Since generating the GKP qubit graph state resource is hardware intensive, given a total resource budget and an arbitrary layout of clients, we address the question of their optimal allocation to the different client-pair connections served by the switch such that the switch's sum throughput is maximized while also being fair in terms of the individual entanglement rates. We illustrate our results for an exemplary data center network, where the data center is a client of a switch, and all of its other clients aim to connect to the data center alone—a scenario that also captures the general case of a gateway router connecting a local area network to a global network. Together with compatible quantum repeaters, our quantum switch provides a way to realize quantum networks of arbitrary topology.

12 January 2026 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
NCNitish Kumar Chandra
Nitish Kumar Chandra
SGSaikat Guha
Saikat Guha
KSKaushik P. Seshadreesan
Kaushik P. Seshadreesan
We study an architecture for fault-tolerant measurement-based quantum computation (FT-MBQC) over optically-networked trapped-ion modules. The architecture is implemented with a finite number of modules and ions per module, and leverages photonic interactions for generating remote entanglement between modules and local Coulomb interactions for intra-modular entangling gates. We focus on generating the topologically protected Raussendorf–Harrington–Goyal (RHG) lattice cluster state, which is known to be robust against lattice bond failures and qubit noise, with the modules acting as lattice sites. To ensure that the remote entanglement generation rates surpass the bond-failure tolerance threshold of the RHG lattice, we employ spatial and temporal multiplexing. For realistic system timing parameters, we estimate the code cycle time of the RHG lattice and the ion resources required in a bilayered implementation, where the number of modules matches the number of sites in two lattice layers, and qubits are reinitialized after measurement. For large distances between modules, we incorporate quantum repeaters between sites and analyze the benefits in terms of cumulative resource requirements. Finally, we derive and analyze a qubit noise-tolerance threshold inequality for the RHG lattice generation in the proposed architecture that accounts for noise from various sources. This includes the depolarizing noise arising from the photonically-mediated remote entanglement generation between modules due to finite optical detection efficiency, limited visibility, and presence of dark clicks, in addition to the noise from imperfect gates and measurements, and memory decoherence with time. Our work thus underscores the hardware and channel threshold requirements to realize distributed FT-MBQC in a leading qubit platform today—trapped ions.

2 November 2026
Verified
Conference Paper
Open access
PSPriyam Srivastava
Priyam Srivastava
ASAkshat R. Sabavat
Akshat R. Sabavat
SJSiddharth Jain
Siddharth Jain
ASAlan Scheller-Wolf
Alan Scheller-Wolf
STSridhar Tayur
Sridhar Tayur
KSKaushik Seshadreesan
Kaushik Seshadreesan
Quantum repeater chains build long-distance entanglement for quantum key distribution (QKD) by creating pairs on short links and joining them through entanglement swapping. Because stored pairs lose fidelity while they wait, swap timing can affect the secret-key rate. We study how network-layer swap scheduling affects six-state QKD on a simulated four-hop chain under an idealized Werner-state noise model. We compare a sequential (swap-and-wait) discipline, which builds and stores partial chains, with a synchronized (wait-and-swap) discipline, which waits until all links are ready before swapping. Both use the same reinforcement-learned link controllers, isolating the effect of the swapping discipline. When stored pairs cannot retain sufficient fidelity for one network time step, our sequential implementation produces no key, while synchronized retains a small key rate from simultaneous link deliveries. Once sequential becomes viable, it outperforms synchronized by up to 19.1% in the homogeneous chains studied, with the advantage decreasing as memory lifetime increases. We predict the synchronized short-memory pair-delivery rate from link-delivery statistics and derive a closed-form condition for when sequential can preserve progress across time steps. We also examine chains with one slower link, where partial chains can wait and decay at the bottleneck. In this setting, synchronized slightly outperforms sequential at longer memory lifetimes. Moving the slow link has little effect on key rate away from the transition region but strongly affects sequential link-buffer occupancy. Choosing a swapping discipline therefore depends not only on whether memories can preserve partial progress, but also on how the link configuration determines where that progress must wait and decay.