Abstract We present the first experimental demonstration of quantum circuit teleportation between heterogeneous quantum processors using Bell state topology as a hardware-agnostic encoding framework. A complete quantum circuit---comprising 4 gate instructions (H, CNOT, Z measurements)---was teleported from Rigetti Computing's Ankaa-3 superconducting QPU to IQM Quantum Computers' Garnet system, with successful reconstruction and execution. The protocol encodes circuit instructions as Bell state manifolds using a 3-qubit error correction code with majority voting, achieving complete circuit fidelity despite architectural differences in native gate sets and connectivity topologies. By treating quantum gates as equivalence classes under entanglement structure---mapping $H \to |\Phi^+\rangle$, $\mathrm{CNOT} \to |\Psi^+\rangle$, $Z \to |\Phi^-\rangle$, and $M \to |\Psi^-\rangle$---we establish a foundational equivalence between gate operations and Bell basis projections. Implementation utilizes the hyperelliptic lattice infrastructure developed previously, enabling topologically-aware routing of quantum programs. This work demonstrates that heterogeneous quantum networks can execute distributed quantum algorithms without dedicated quantum channels or pre-shared high-fidelity entanglement, using only classical database coordination. The 100\% circuit execution success rate combined with error-corrected Bell state decoding provides strong evidence that topology-mediated programming offers a practical pathway toward distributed quantum computing infrastructure. We present comprehensive experimental data, theoretical analysis connecting Bell topology to quantum circuit semantics, and a scalable framework for cross-architecture quantum software distribution.
Abstract We present the first experimental demonstration of quantum circuit teleportation between heterogeneous quantum processors using Bell state topology as a hardware-agnostic encoding framework. A complete quantum circuit---comprising 4 gate instructions (H, CNOT, Z measurements)---was teleported from Rigetti Computing's Ankaa-3 superconducting QPU to IQM Quantum Computers' Garnet system, with successful reconstruction and execution. The protocol encodes circuit instructions as Bell state manifolds using a 3-qubit error correction code with majority voting, achieving complete circuit fidelity despite architectural differences in native gate sets and connectivity topologies. By treating quantum gates as equivalence classes under entanglement structure---mapping H→∣Φ+⟩, CNOT→∣Ψ+⟩, Z→∣Φ−⟩, and M→∣Ψ−⟩---we establish a foundational equivalence between gate operations and Bell basis projections. Implementation utilizes the hyperelliptic lattice infrastructure developed previously, enabling topologically-aware routing of quantum programs. This work demonstrates that heterogeneous quantum networks can execute distributed quantum algorithms without dedicated quantum channels or pre-shared high-fidelity entanglement, using only classical database coordination. The 100% circuit execution success rate combined with error-corrected Bell state decoding provides strong evidence that topology-mediated programming offers a practical pathway toward distributed quantum computing infrastructure. We present comprehensive experimental data, theoretical analysis connecting Bell topology to quantum circuit semantics, and a scalable framework for cross-architecture quantum software distribution.
Abstract We report the first successful quantum teleportation protocol between heterogeneous quantum processing units (QPUs) using algebraic-geometric structure as the entanglement modulation framework. A 5-qubit quantum state was teleported from Rigetti Computing's Ankaa-3 superconducting QPU to IQM Quantum Computers' Emerald superconducting QPU, achieving 80\% bit-level fidelity using only classical communication channels. The protocol employs eigenphases extracted from the period matrix of genus-2 hyperelliptic curves to encode quantum correlation structure in a hardware-agnostic manner. Our implementation utilizes a novel database-coordinated classical channel for Bell measurement transmission, demonstrating that standard distributed systems infrastructure can support quantum networking protocols. The observed fidelity without quantum error correction, combined with the protocol's architecture-independence, provides strong evidence that topological encoding offers robustness advantages for distributed quantum computing. We present comprehensive experimental data, theoretical analysis, and a scalable framework for heterogeneous quantum network construction. Our results establish proof-of-concept for topology-mediated quantum communication and suggest pathways toward practical quantum internet implementation.
Distributed quantum computing (DQC) seeks to scale beyond the limits of monolithic processors by interconnecting multiple quantum processing units (QPUs) through entanglement-based links. Realizing this vision requires the co-design of hardware and software across the domains of quantum networking, compilation, and scheduling, yet existing tools remain fragmented between monolithic circuit compilers and long-distance quantum network simulators. We present an open-source, topology-informed framework for the compilation and scheduling of distributed quantum programs. Given an input circuit and a description of the target network, the framework partitions and reconstructs the circuit into a distributed program that respects the specified inter- and intra-QPU topology, covers cross-QPU operations through gate and state teleportation, and schedules the result under either deterministic or stochastic entanglement-generation models. By accepting and emitting standard OpenQASM, the framework interoperates with existing monolithic toolchains, and its standardized module interfaces allow partitioning and scheduling strategies to be interchanged and benchmarked. Using this framework, we show that the best-performing compilation strategy varies across the tested circuits and network configurations, and that both network topology and intra-QPU connectivity substantially affect the entanglement cost of execution. These findings underscore the need for a co-design approach to distributed quantum computing, which our framework is designed to support.
Scalable quantum computing requires execution models that go beyond the capacity of a single quantum processing unit (QPU). Although current hardware platforms continue to increase in qubit count, large fault-tolerant applications require substantially more physical qubits, stronger connectivity, and lower effective error rates than a monolithic near-term device can provide. Multi-QPU and multi-core architectures therefore form an important route towards larger quantum systems. However, distributing a quantum computation introduces compiler and architecture constraints that do not arise in conventional classical distribution. A partitioned quantum circuit separates gates and qubits that may still be logically entangled or mutually dependent. The system must therefore provide quantum resources that support entanglement between the distributed circuit fragments, while each local subcircuit must remain executable on the hardware topology of its assigned QPU. In this thesis, graph states serve as the explicit interconnection resources for these nonlocal dependences: they encode the entanglement structure required to support teleportation-based operations across QPUs. This thesis studies scalable quantum execution as an architecture-driven compilation problem. It develops a staged framework in which distribution, graph-state-based interconnection, and interconnection robustness are treated as dependent compiler decisions. The framework addresses three connected questions: 1) how a large quantum circuit should be divided when the resulting subcircuits must match real QPU topologies; 2) how the graph states required to entangle and operate across the distributed circuit boundaries can be prepared efficiently on constrained hardware; and 3) how those graph-state resources can remain useful under the loss and fusion failures that arise during preparation and use. These questions define an execution path from a large logical circuit to distributed local workloads connected by explicit entanglement resources. The thesis makes three main technical contributions that instantiate this framework. 1) It introduces hardware-aware circuit cutting, which incorporates the relationship between subcircuit interaction graphs and target QPU topology into the partitioning objective. This stage produces distributed workloads and explicit cut boundaries where quantum entanglement must be supplied across QPUs. 2) It formulates graph-state preparation as the resource-generation stage for those boundaries and develops methods that reduce preparation depth and emitter usage by exploiting graph-state equivalence and divide-and-conquer construction. 3) It develops a robust graph-state interconnection scheme that uses tree-encoded fusion and spin-memory-assisted compilation to tolerate photon loss and probabilistic fusion failures, so that the graph state can serve as a reliable connection between distributed quantum program fragments.
With the advent of more quantum computing applications, it is imperative to provide developers with a set of metrics to determine how much trust they can place in the execution of their programs. In this study, we propose a novel protocol based on quantum teleportation to systematically evaluate the performance of quantum circuits and quantify their execution reliability. Our protocol consists of three parts: the payload, composed of entangled qubits with random gates applied to each wire; the bridge, which corresponds to the teleportation-inspired protocol; and an inverse payload operation, designed to return the circuit to its initial state. We validated the algorithm by elaborating its mathematical framework, followed by a comparative analysis with simulation results using Qiskit AerSimulator and ultimately through an execution on the IBM quantum and Rigetti services. A key aspect of our methodology was to set the circuit transpilation to its lowest optimization level (level 0). We recognize that even without aggressive optimization, randomly generated gates can form self-canceling sequences. As a result, our analysis correlates the pre-runtime metrics of the final, minimally-transpiled circuit (such as its actual depth and gate count) with post-runtime results (such as success rate). This approach reveals significant correlations and offers developers quantitative metrics to assess both the reliability of quantum circuit execution and scalability limitations in their applications.
Distributed Quantum Computing (DQC) enables scalable quantum execution by interconnecting multiple quantum processing units (QPUs) through quantum networks. In DQC, end-to-end performance is jointly affected by circuit partitioning, entanglement routing, scheduling, and heterogeneous hardware characteristics. However, existing studies often optimize these components independently, providing limited understanding of their cross-layer interactions. In this paper, we present a cross-layer joint-optimization study for DQC using the previously developed SimDisQ-Net simulator. Through simulations, we find that circuit orchestration is one of the dominant factors affecting distributed execution quality, while network-layer mechanisms provide secondary but still meaningful improvements. We further demonstrate that traditional communication metrics, such as hop count or remote-gate count alone, are insufficient predictors of execution quality due to the strong interaction among path fidelity, hardware characteristics, and circuit structure. Motivated by these findings, we propose a topology-aware fidelity proxy (TAFP) evaluation approach that approximates distributed execution fidelity, enabling efficient evaluation of candidate circuit optimizations without time-consuming simulation. Our results highlight the importance of integrated circuit-network orchestration for scalable DQC.
This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors. As quantum circuits grow in complexity, efficiently managing the entanglement resources required for communication between quantum processing units (QPUs) becomes increasingly critical. We propose novel methods to optimize entanglement consumption while accounting for network constraints. Our approach leverages graph partitioning techniques to optimize both qubit teleportation and gate teleportation, minimizing the number of Einstein-Podolsky-Rosen (EPR) pairs required to execute general quantum circuits. Additionally, we formulate an integer linear program (ILP) to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the underlying quantum network. Finally, we analyze the entanglement cost for implementing the Quantum Fourier Transform (QFT) across multiple QPUs, employing an approach that exploits the circuit's structure to minimize total entanglement consumption. These contributions provide a pathway to scalable and resource-efficient distributed quantum computing.