KSKaushik P. Seshadreesan

Kaushik P. Seshadreesan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Kaushik P. Seshadreesan has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Network Operations Scheduling for Distributed Quantum Computing

    by Nitish Kumar Chandra, Eneet Kaur, Kaushik P. Seshadreesan

    Realizing distributed architectures for quantum computing is crucial to scaling up computational power. A key component of such architectures is a scheduler that coordinates operations over a short-range quantum network required to enable the necessary non-local entangling gates between quantum processing units (QPUs). It is desirable to determine schedules of minimum make span, which in the case of networks with constrained resources hinges on their efficient usage. Here we compare and contrast two approaches to solving the make span minimization problem, an approach based on the resource constrained project scheduling (RCPSP) framework, and another based on a greedy heuristic algorithm. The workflow considered is as follows. Firstly, the computational circuit is partitioned and assigned to different QPUs such that the number of nonlocal entangling gates acting across partitions is minimized while the qubit load is nearly uniform on the individual QPUs, which can be accomplished using, e.g., the METIS solver. Secondly, the nonlocal entangling gate requirements with respect to the partitions are identified, and mapped to network operation sequences that deliver the necessary entanglement between the QPUs. Finally, the network operations are scheduled such that the make span is minimized. As illustrative examples, we analyze the implementation of a small instance of the Quantum Fourier Transform algorithm over instances of a simple hub and spoke (star) network architecture comprised of a quantum switch as the hub and QPUs as spokes, each with a finite qubit resource budget. In one instance, our results show the RCPSP approach outperforming the greedy heuristic. In another instance, we find the two performing equally well. Our results thus illustrate the effectiveness of the RCPSP framework, while also underlining the relevance and usefulness of greedy heuristics.

  • Open Access

    Architectural Approaches to Fault-Tolerant Distributed Quantum Computing and Their Entanglement Overheads

    by Nitish Kumar Chandra, Eneet Kaur, Kaushik P. Seshadreesan

    Fault tolerant quantum computation over distributed quantum computing (DQC) platforms requires careful evaluation of resource requirements and noise thresholds. As quantum hardware advances toward modular and networked architectures, various fault tolerant DQC schemes have been proposed, which can be broadly categorized into three architectural types. Type 1 architectures consist of small quantum nodes connected via Greenberger-Horne-Zeilinger (GHZ) states, enabling nonlocal stabilizer measurements. Type 2 architectures distribute a large error correcting code block across multiple modules, with most stabilizer measurements remaining local, except for a small subset at patch boundaries that are performed using nonlocal CNOT gates. Type 3 architectures assign code blocks to distinct modules and can perform fault tolerant operations such as transversal gates, lattice surgery, and teleportation to implement logical operations between code blocks. Using the planar surface code and toric code as representative examples, we analyze how the resource requirements, particularly the number of Bell pairs and the average number of generation attempts, scale with increasing code distance across different architectural designs. This analysis provides valuable insights for identifying architectures well suited to fault tolerant distributed quantum computation under near term hardware and resource constraints.

  • Open Access

    Comparing GHZ-Based Strategies for Multipartite Entanglement Distribution in 2D Repeater Networks

    by Mohadeseh Azari, Amy Babay, Prashant Krishnamurthy, Kaushik Seshadreesan

    We conduct a comparative study to determine the initial quality necessary to extend the distance range of an $N$-qubit GHZ state (the parent state) using two-dimensional repeaters. We analyzed two strategies for distributing initial GHZ states using a centralized quantum switch to determine if any of the strategies show benefits: i) A strategy that employs quantum memories at the switch to retain quantum states entangled with each client node, where memory usage at the switch scales linearly with the number of clients, and ii) A strategy predicated on GHZ measurements at the switch node without reliance on memory assistance. In the former scenario, the switches generate GHZ states and teleport them to the clients by utilizing remote Bell pairs that are asynchronously generated and stored in memory. Conversely, in the latter scenario, the switches perform GHZ projective measurements on freshly generated remote Bell pairs without requiring local storage at the switch. To enhance the distance range of GHZ-type entanglement distribution, we analyze the two approaches as foundational elements for a self-repeating, two-dimensional quantum repeater architecture. Here, the clients of the switch nodes become the 2D repeater nodes that store elementary GHZ states in quantum memories, that can then be fused together to generate long-distance GHZ-type entanglement between end users of the network. By examining the two strategies' entanglement distribution rates and fidelities, we identify the conditions under which the 2D repeater architecture enhances overall performance, and we determine whether either method is a superior building block for such a repeater structure. Our findings illuminate the identification of effective modalities for the long-distance multipartite entanglement distribution within quantum networks.

  • Open Access

    Distributed Realization of Color Codes for Quantum Error Correction

    by Nitish Kumar Chandra, David Tipper, Reza Nejabati, Eneet Kaur, Kaushik P. Seshadreesan

    Color codes are a leading class of topological quantum error-correcting codes with modest error thresholds and structural compatibility with two-dimensional architectures, which make them well-suited for fault-tolerant quantum computing (FTQC). Here, we propose and analyze a distributed architecture for realizing the (6.6.6) color code. The architecture involves interconnecting patches of the color code housed in different quantum processing units (QPUs) via entangled pairs. To account for noisy interconnects, we model the qubits in the color code as being subject to a bit-flip noise channel, where the qubits on the boundary (seam) between patches experience elevated noise compared to those in the bulk. We investigate the error threshold of the distributed color code under such asymmetric noise conditions by employing two decoders: a tensor-network-based decoder and a recently introduced concatenated Minimum Weight Perfect Matching (MWPM) algorithm. Our simulations demonstrate that elevated noise on seam qubits leads to a slight reduction in threshold for the tensor-network decoder, whereas the concatenated MWPM decoder shows no significant change in the error threshold, underscoring its effectiveness under asymmetric noise conditions. Our findings thus highlight the robustness of color codes in distributed architectures and provide valuable insights into the practical realization of FTQC involving noisy interconnects between QPUs.

  • Open Access

    Quantum repeaters enhanced by vacuum beam guides

    by Yu Gan, Mohadeseh Azari, Nitish Kumar Chandra, Xin Jin, Jinglei Cheng, Kaushik P. Seshadreesan, Junyu Liu

    The development of large-scale quantum communication networks faces critical challenges due to photon loss and decoherence in optical fiber channels. These fundamentally limit transmission distances and demand dense networks of repeater stations. This work investigates using vacuum beam guides (VBGs)-a promising ultra-low-loss transmission platform-as an alternative to traditional fiber links. By incorporating VBGs into repeater-based architectures, we demonstrate that the inter-repeater spacing can be substantially extended, resulting in fewer required nodes and significantly reducing hardware and operational complexity. We perform a cost-function analysis to quantify performance trade-offs across first, second, and third-generation repeaters. Our results show that first-generation repeaters reduce costs dramatically by eliminating entanglement purification. Third-generation repeaters benefit from improved link transmission success, which is crucial for quantum error correction. In contrast, second-generation repeaters exhibit a more nuanced response; although transmission loss is reduced, their performance remains primarily limited by logical gate errors rather than channel loss. These findings highlight that while all repeater generations benefit from reduced photon loss, the magnitude of improvement depends critically on the underlying error mechanisms. Vacuum beam guides thus emerge as a powerful enabler for scalable, high-performance quantum networks, particularly in conjunction with near-term quantum hardware capabilities.

  • Open Access

    Multiplexed bi-layered realization of fault-tolerant quantum computation over optically networked trapped-ion modules

    by Nitish K. Chandra, Saikat Guha, 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 bi-layered 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 the 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.

  • Supporting multiple entanglement flows through a continuous-variable quantum repeater

    by Ian J. Tillman, Allison Rubenok, Saikat Guha, Kaushik P. Seshadreesan

    Quantum repeaters are critical to the development of quantum networks, enabling rates of entanglement distribution beyond those attainable by direct transmission. We consider multiple continuous-variable, squeezed light-based entanglement flows through a repeater involving noiseless linear amplification and dual homodyne detection. By analyzing a single-repeater-enhanced channel model with asymmetric half-channel losses across the repeater, we determine placements of the central repeater hub in a four-user hub-and-spoke network that enhance the rate of each entanglement flow.


  • Open Access

    Supporting multiple entanglement flows through a continuous-variable quantum repeater

    by Ian J. Tillman, Allison Rubenok, Saikat Guha, Kaushik P. Seshadreesan

    Quantum repeaters are critical to the development of quantum networks, enabling rates of entanglement distribution beyond those attainable by direct transmission. We consider multiple continuous-variable, squeezed light-based entanglement flows through a repeater involving noiseless linear amplification and dual homodyne detection. By analyzing a single-repeater-enhanced channel model with asymmetric losses across the repeater, we determine optimal placements of the central repeater hub in a 4-user hub-and-spoke network such that the rate of each entanglement flow through the hub is enhanced.

  • Demonstration of a quantum advantage by a joint detection receiver for optical communication using quantum belief propagation on a trapped-ion device

    by Conor Delaney, Kaushik P. Seshadreesan, Ian MacCormack, Alexey Galda, Saikat Guha, Prineha Narang

    Demonstrations of quantum advantage have largely focused on computational speedups and on quantum simulation of many-body physics, limited by fidelity and the capability of current devices. Discriminating laser-pulse-modulated classical-communication code words at the minimum allowable probability of error using universal-quantum processing presents a promising parallel direction, one that is of both fundamental importance in quantum state discrimination and technological relevance in deep-space laser communications. Here we present an experimental realization of a quantum joint detection receiver for binary phase shift keying modulated code words of a 3-bit linear tree code using a recently proposed quantum algorithm: belief propagation with quantum messages. The receiver, translated to a quantum circuit, was experimentally implemented on a trapped-ion device—the recently released Honeywell LT-1.0 system using Yb+171 ions, which possesses all-to-all connectivity and midcircuit measurement capabilities that are essential to this demonstration. We conclusively realize a previously postulated but hitherto not demonstrated joint quantum detection scheme and provide an experimental framework that surpasses the quantum limit on the minimum average decoding error probability associated with pulse-by-pulse detection in the low-mean-photon-number limit. The full joint detection scheme bridges across photonic and trapped-ion-based quantum information science, mapping the photonic coherent states of the modulation alphabet onto inner product-preserving states of single-ion qubits. Looking ahead, our work opens new avenues in hybrid realizations of quantum-enhanced receivers with applications in astronomy and emerging space-based platforms.


  • Open Access

    Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits

    by Kaushik P. Seshadreesan, Prajit Dhara, Ashlesha Patil, Liang Jiang, Saikat Guha

    Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. We determine the transformation rules for the covariance matrix and the mean displacement vector of the Gaussian distribution of the ensemble under tools such as GKP-Steane error correction and fusion operations that can be used to grow large, high-fidelity GKP-qubit graph states. The former captures the noise in the graph state due to the finite-energy approximation of GKP qubits, while the latter relates to the possible absolute displacement errors on the individual qubits due to the homodyne measurements that are a part of these tools. The rules thus help in pinning down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error correction properties.