Gate Teleportation vs Circuit Cutting in Distributed Quantum Computing

• URL: http://arxiv.org/abs/2510.08894v1
• Date: Fri, 10 Oct 2025 01:14:22 GMT
• Title: Gate Teleportation vs Circuit Cutting in Distributed Quantum Computing
• Authors: Shobhit Gupta, Nikolay Sheshko, Daniel J. Dilley, Alvin Gonzales, Manish K. Singh, Zain H. Saleem,
• Abstract summary: Distributed quantum computation incurs an exponential growth of sub-circuit sampling and classical post-processing overhead.<n>Recent advances in photonic entanglement of qubits have motivated discussion on optical link metrics required to achieve remote gate performance.<n>Our work informs near-term quantum interconnect hardware metrics and motivates a network-aware hybrid quantum-classical distributed computation approach.
• Score: 0.685375349666996
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Distributing circuits across quantum processor modules will enable the execution of circuits larger than the qubit count limitations of monolithic processors. While distributed quantum computation has primarily utilized circuit cutting, it incurs an exponential growth of sub-circuit sampling and classical post-processing overhead with an increasing number of cuts. The entanglement-based gate teleportation approach does not inherently incur exponential sampling overhead, provided that quantum interconnects of requisite performance are available for generating high-fidelity Bell pairs. Recent advances in photonic entanglement of qubits have motivated discussion on optical link metrics required to achieve remote gate performance approaching circuit-cutting techniques. We model noisy remote (teleported) gates between superconducting qubits entangled via noisy microwave-to-optical (M2O) transducers over optical links. We incorporate the effect of the transducer noise added ($N_{add}$) on the Bell pair fidelity and inject noisy Bell pairs into remote CNOT gates. We perform a comparative simulation of Greenberger-Horne-Zeilinger (GHZ) states generated between processor modules using remote gates and gate cuts by studying the dependence of the Hellinger fidelity on the primary source of error for the two approaches. We identify break-even points where noisy remote gates achieve parity with gate-cuts. Our work suggests that a 10-fold reduction in the present M2O transducer noise added figures would favor generating multipartite entangled states with remote gates over circuit cutting due to an exponential sampling overhead for the latter. Our work informs near-term quantum interconnect hardware metrics and motivates a network-aware hybrid quantum-classical distributed computation approach, where both quantum links and circuit cuts are employed to minimize quantum runtime.

Related papers

• Parallel Quantum Gates via Scalable Subsystem-Optimized Robust Control [9.72599396930123]
  Crosstalk between qubits impedes the achievement of high gate fidelities and renders full Hilbert-space control optimization prohibitively difficult.<n>Here, we overcome this challenge by reducing the full-system optimization to crosstalk-robust control over constant-sized subsystems.<n>Within this framework, we construct analytical pulse solutions for parallel single-qubit gates and numerical pulses for parallel multi-qubit operations.
  arXiv  Detail & Related papers  (2026-01-05T10:50:40Z)
• Suppressing crosstalk for Rydberg quantum gates [0.09999629695552195]
  We present a method to suppress crosstalk from implementing controlled-Z gates via local addressing in neutral atom quantum computers.<n>Our results pave the way for using local addressing for high-fidelity quantum gates on Rydberg-based quantum computers.
  arXiv  Detail & Related papers  (2025-07-14T14:57:50Z)
• Realization of high-fidelity perfect entangler between remote superconducting quantum processors [10.082111942756052]
  Superconducting qubits are a promising candidate for universal quantum computing. Here, we demonstrate high-fidelity perfect entanglers between two remote superconducting quantum devices over 30 cm distance. This advancement significantly enhances the feasibility of universal distributed quantum information processing.
  arXiv  Detail & Related papers  (2024-07-29T18:00:12Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Quantum information processing with superconducting circuits: realizing and characterizing quantum gates and algorithms in open quantum systems [0.0]
  This thesis focuses on quantum information processing using the superconducting device. For the realization of quantum gates and algorithms, a one-step approach is used. We suggest faster and more efficient schemes for realizing $X$-rotation and entangling gates for two and three qubits.
  arXiv  Detail & Related papers  (2024-01-14T14:31:17Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Fast ZZ-Free Entangling Gates for Superconducting Qubits Assisted by a Driven Resonator [42.152052307404]
  We propose a simple scheme to cancel stray interactions between qubits. We numerically show that such a scheme can enable short and high-fidelity entangling gates. Our architecture is not only ZZ free but also contains no extra noisy components.
  arXiv  Detail & Related papers  (2023-11-02T15:42:02Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• Hybrid Gate-Pulse Model for Variational Quantum Algorithms [33.73469431747376]
  Current quantum programs are mostly compiled on the gate-level, where quantum circuits are composed of quantum gates. pulse-level optimization has gained more attention from researchers due to their advantages in terms of circuit duration. We present a hybrid gate-pulse model that can mitigate these problems.
  arXiv  Detail & Related papers  (2022-12-01T17:06:35Z)
• Circuit connectivity boosts by quantum-classical-quantum interfaces [0.4194295877935867]
  High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. We numerically show the efficacy of our method for a Bell-state circuit for two increasingly distant qubits.
  arXiv  Detail & Related papers  (2022-03-09T19:00:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.