Fast and Robust Remote Two-Qubit Gates on Distributed Qubits

• URL: http://arxiv.org/abs/2511.01418v1
• Date: Mon, 03 Nov 2025 10:12:16 GMT
• Title: Fast and Robust Remote Two-Qubit Gates on Distributed Qubits
• Authors: Yunan Li, Xi Zhang, Weixin Zhang, Ruonan Guo, Yu Zhang, Xinsheng Tan, Yang Yu,
• Abstract summary: This article proposes and demonstrates a remote quantum geometric gate scheme via parametric modulation.<n>We experimentally realize the rapid remote SWAP and $sqrttextSWAP$ gates with high fidelity, completing operation in about 30 ns.
• Score: 13.099136824902303
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distributed quantum computing offers a potential solution to the complexity of superconducting chip hardware layouts and error correction algorithms. High-quality gates between distributed chips enable the simplification of existing error correction algorithms. This article proposes and demonstrates a remote quantum geometric gate scheme via parametric modulation. Our scheme inherits the intrinsic robustness of geometric phases. Meanwhile, by employing gradient-based optimization algorithms(Adaptive Moment Estimation) from deep learning, we design control waveforms that significantly suppress population leakage. We experimentally realize the rapid remote SWAP and $\sqrt{\text{SWAP}}$ gates with high fidelity, completing operation in about 30 ns. The gate error of SWAP ($\sqrt{\text{SWAP}}$) is 1.16\% (0.91\%) after excluding the effect of energy relaxation. The simulation demonstrate that this scheme can be implemented in the distributed chips connected by cables extending several meters. Our results highlight the effectiveness of the proposed protocol in enabling modular quantum processors, offering a promising path toward the realization of fault-tolerant quantum computation.

Related papers

• Evolutionary-Based Circuit Optimization for Distributed Quantum Computing [3.5852827516109564]
  We evaluate an evolutionary algorithm (EA) to optimize a given circuit in such a way that it reduces the required communication.<n>We show that it is able to reduce the required global gates by more than 89% while still achieving high fidelity.
  arXiv  Detail & Related papers  (2025-09-09T18:23:26Z)
• Time-frequency Entangled Photon Mediated CCZ Gate [3.1094846943185677]
  We show a hardware-efficient scalable scheme for direct CCZ gate implementation based on two-photon absorption phenomenon.<n>We achieve a simulated fidelity over 99% within 194ns, surpassing the decomposed methods with single-qubit and two-qubit gates.
  arXiv  Detail & Related papers  (2025-09-08T09:59:26Z)
• Joint Transmit and Pinching Beamforming for Pinching Antenna Systems (PASS): Optimization-Based or Learning-Based? [89.05848771674773]
  A novel antenna system ()-enabled downlink multi-user multiple-input single-output (MISO) framework is proposed.<n>It consists of multiple waveguides, which equip numerous low-cost antennas, named (PAs)<n>The positions of PAs can be reconfigured to both spanning large-scale path and space.
  arXiv  Detail & Related papers  (2025-02-12T18:54:10Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• SWAP-less Implementation of Quantum Algorithms [0.0]
  We present a formalism based on tracking the flow of parity quantum information to implement algorithms on devices with limited connectivity. We leverage the fact that entangling gates not only manipulate quantum states but can also be exploited to transport quantum information.
  arXiv  Detail & Related papers  (2024-08-20T14:51:00Z)
• A Fast and Adaptable Algorithm for Optimal Multi-Qubit Pathfinding in Quantum Circuit Compilation [0.0]
  This work focuses on multi-qubit pathfinding as a critical subroutine within the quantum circuit compilation mapping problem. We introduce an algorithm, modelled using binary integer linear programming, that navigates qubits on quantum hardware optimally with respect to circuit SWAP-gate depth. We have benchmarked the algorithm across a variety of quantum hardware layouts, assessing properties such as computational runtimes, solution SWAP depths, and accumulated SWAP-gate error rates.
  arXiv  Detail & Related papers  (2024-05-29T05:59:15Z)
• Efficient and Scalable Architectures for Multi-Level Superconducting Qubit Readout [0.8999666725996978]
  Many processor modalities are inherently multi-level systems. This leads to occasional leakage into energy levels outside the computational subspace.<n>We propose a scalable, high-fidelity three-level readout that reduces FPGA resource usage by $60times$ compared to the baseline.<n>Our design supports efficient, real-time implementation on off-the-shelf FPGAs, delivering a 6.6% improvement in readout accuracy over the baseline.
  arXiv  Detail & Related papers  (2024-05-14T22:32:51Z)
• Fast Flux-Activated Leakage Reduction for Superconducting Quantum Circuits [84.60542868688235]
  leakage out of the computational subspace arising from the multi-level structure of qubit implementations. We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation. We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
  arXiv  Detail & Related papers  (2023-09-13T16:21:32Z)
• 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)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA [2.3362993651992863]
  We optimize the execution of fermionic SWAP networks for Quantum Approximate Optimization Algorithm (QAOA) We introduce Equivalent Circuit Averaging, which randomizes over degrees of freedom in the quantum circuit compilation. We observe a 60% average reduction in error (total variation distance) for QAOA of depth p = 1 on four transmon qubits on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-11-08T15:32:05Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.