Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise and error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inter-chip fidelity, limited research addresses efficient circuit cutting and qubit mapping in distributed systems. This project introduces InterPlace, a self-adaptive, hardware-aware framework for chip-to-chip distributed quantum systems. InterPlace analyzes qubit noise and error rates to construct a virtual system topology, guiding circuit partitioning and distributed qubit mapping to minimize SWAP overhead and enhance fidelity. Implemented with IBM Qiskit and compared with the state-of-the-art, InterPlace achieves up to a 53.0\% improvement in fidelity and reduces the combination of on-chip SWAPs and inter-chip operations by as much as 33.3\%, demonstrating scalability and effectiveness in extensive evaluations on real quantum hardware topologies.
Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise and error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inter-chip fidelity, limited research addresses efficient circuit cutting and qubit mapping in distributed systems. This project introduces InterPlace, a self-adaptive, hardware-aware framework for chip-to-chip distributed quantum systems. InterPlace analyzes qubit noise and error rates to construct a virtual system topology, guiding circuit partitioning and distributed qubit mapping to minimize SWAP overhead and enhance fidelity. Implemented with IBM Qiskit and compared with the state-of-the-art, InterPlace achieves up to a 53.0% improvement in fidelity and reduces the combination of on-chip SWAPs and inter-chip operations by as much as 33.3%, demonstrating scalability and effectiveness in extensive evaluations on real quantum hardware topologies.
Quantum computing offers unparalleled computational capabilities but faces significant challenges, including limited qubit counts, diverse hardware topologies, and dynamic noise/error rates, which hinder scalability and reliability. Distributed quantum computing, particularly chip-to-chip connections, has emerged as a solution by interconnecting multiple processors to collaboratively execute large circuits. While hardware advancements, such as IBM's Quantum Flamingo, focus on improving inter-chip fidelity, limited research addresses efficient circuit cutting and qubit mapping in distributed systems. This project introduces DisMap, a self-adaptive, hardware-aware framework for chip-to-chip distributed quantum systems. DisMap analyzes qubit noise and error rates to construct a virtual system topology, guiding circuit partitioning, and distributed qubit mapping to minimize SWAP overhead and enhance fidelity. Implemented with IBM Qiskit and compared with the state-of-the-art, DisMap achieves up to a 20.8\% improvement in fidelity and reduces SWAP overhead by as much as 80.2\%, demonstrating scalability and effectiveness in extensive evaluations on real quantum hardware topologies.
As quantum computing advances toward fault-tolerance through quantum error correction, modular chiplet architectures have emerged to provide the massive qubit counts required while overcoming fabrication limits of monolithic chips. However, this transition introduces a critical compilation gap: existing frameworks cannot handle the scale of fault-tolerant quantum circuits while managing the noisy, sparse interconnects of chiplet backends.
We present Chipmunq, the first hardware-aware compiler for mapping and routing fault-tolerant circuits onto modular architectures. Chipmunq employs a quantum-error-correction-aware partitioning strategy that preserves the integrity of logical qubit patches, preventing prohibitive gate overheads common in general-purpose compilers. Our evaluation demonstrates that Chipmunq achieves a 13.5x speedup in compilation time compared to state-of-the-art tools. By incorporating chiplet constraints and defective qubits, it reduces circuit depth by 86.4% and SWAP gate counts by 91.4% across varying code distances. Crucially, Chipmunq overcomes heterogeneous inter-chiplet links, improving logical error rates by up to two orders of magnitude.
Distributed quantum computing (DQC) offers a practical path to scaling beyond the qubit and wiring limits of monolithic processors, but current compilation flows provide limited support for heterogeneous inter-chip communication. In multi-chip systems, remote operations are often slower, noisier, and less reliable than local gates, and their cost depends strongly on link quality, latency, and device calibration. As a result, compilation decisions such as circuit partitioning, link selection, and qubit mapping become tightly coupled, yet are often handled separately or with simplified communication models in existing solutions. We present DisMap, a calibration-aware distributed compiler that integrates the heterogeneous costs of both interand intra-chip operations into a unified hierarchical cost model. Given per-chip topology, noise calibration data, and inter-chip link specifications, DisMap constructs a global system topology, applies adaptive circuit partitioning to minimize expensive crosschip interactions, and performs iterative distributed qubit mapping to place logical operations on low-error qubits and route cross-chip communication over high-quality links. Evaluated on realistic multi-chip topologies inspired by IBM superconducting hardware, DisMap achieves up to 21.9% higher circuit fidelity and up to 92.6% lower execution cost compared to state-ofthe-art partitioning and mapping baselines, while maintaining practical compilation times across a wide range of circuit benchmarks.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.
Near-term hardware is constrained by high error rates, small qubit counts, and relatively low output fidelity, making the execution of large, high performance quantum circuits difficult. Circuit partitioning (or circuit cutting) has emerged as a promising approach to circumvent these limitations by decomposing circuits into smaller subcircuits at two-qubit interaction points. However, it remains unclear which classes of circuits benefit the most from partitioning and under what hardware conditions it is most effective. In this work, we evaluate the suitability of quantum circuits for partitioning from three perspectives: improving fidelity, enabling distributed execution, and scaling to larger circuit sizes. Specifically, we compare uncut circuit execution against two circuit partitioning approaches: Qiskit's automatic cut finding technique and a custom performance optimized circuit cutting method. We also measure these across GHZ, QFT, brickwork, and random quantum circuits ranging from 4 to 14 qubits, using mean absolute error of expectation values and overall output fidelity. Our results show that partitioning benefits larger, highly interconnected circuits, with our custom method reducing error by up to 55\% and improve fidelity for GHZ circuits, but degrading performance for brickwork circuits at larger scales.
Quantum circuit simulation enables the execution of large-scale quantum algorithms by partitioning qubits across multiple computational nodes. However, an inefficient qubit placement leads to excessive inter-node communication, limiting performance and scalability. This work introduces a framework that computes a communication-aware qubit placement offline, minimizing data exchange among nodes, and selects, before circuit execution, the largest node count whose performance degradation stays below a user-defined threshold. The framework is integrated with the QuEST simulator. Evaluations on synthetic benchmarks and real-world QASMBench circuits show that optimized placements reduce communication and achieve runtime speedups of up to 2.3x over the identity placement, particularly in circuits with sparse, structured interactions. Our results show that qubit placement strongly affects the efficiency of distributed simulation and provide a practical, resource-scalable solution for quantum workload