A Hardware-Efficient Mølmer-Sørensen Gate for Superconducting Quantum Computers

• URL: http://arxiv.org/abs/2510.07352v1
• Date: Wed, 08 Oct 2025 12:33:40 GMT
• Title: A Hardware-Efficient Mølmer-Sørensen Gate for Superconducting Quantum Computers
• Abstract summary: Molmer-Sorensen gate is a cornerstone entangling operation in trapped-ion systems.<n>We present a hardware-efficient implementation of the Molmer-Sorensen gate on IBM Quantum's superconducting processors.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The M{\o}lmer-S{\o}rensen gate, a cornerstone entangling operation in trapped-ion systems, represents a promising alternative to standard entangling gates in superconducting quantum architectures. However, its performance on superconducting hardware has remained unverified. In this work, we present a hardware-efficient implementation of the M{\o}lmer-S{\o}rensen gate and characterize its performance using quantum process tomography (QPT) on IBM Quantum's superconducting processors. Our implementation achieves a process fidelity of 92.47\% on the real quantum hardware, a performance competitive with the 93.02\% fidelity of the device's native controlled-NOT (CX) gate. Furthermore, for the $|00\rangle$ input state, the gate prepares the target Bell state with $94.2\%$ success probability, confirming its correct logical operation. These results demonstrate that non-native entangling gates can be optimized to perform on par with hardware-native operations. This work expands the effective gate set for algorithm design on fixed-architecture processors and provides a critical benchmark for cross-platform gate evaluation, underscoring the role of hardware-aware compilation in advancing noisy intermediate-scale quantum (NISQ) computing.

Related papers

• Hardware-Aware Quantum Support Vector Machines [0.0]
  We present a hardware-aware Neural Architecture Search (NAS) approach for designing quantum feature maps.<n>We show that hardware-aware NAS makes quantum kernel methods practically deployable on current noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2026-04-09T06:12:48Z)
• Investigation of Hardware Architecture Effects on Quantum Algorithm Performance: A Comparative Hardware Study [0.0]
  Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms.<n>We benchmark five representative quantum algorithms across trapped-ion, superconducting, and simulator backends using Amazon Braket.
  arXiv  Detail & Related papers  (2026-01-07T15:29:52Z)
• Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors [0.0]
  High-fidelity multi-qubit gates are a critical resource for near-term quantum computing.<n>We present a hardware-aware characterization of the Toffoli gate on IBM's 127-qubit superconducting quantum processors.
  arXiv  Detail & Related papers  (2025-09-05T12:58:13Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• 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)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Architectures for Multinode Superconducting Quantum Computers [17.518262577853033]
  One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. In this paper, we quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. We show how to navigate this tradeoff, lay out how compilers should optimize between local and internode gates, and discuss when noisy quantum links have an advantage over purely classical links.
  arXiv  Detail & Related papers  (2022-12-12T19:00:03Z)
• Hardware-Conscious Optimization of the Quantum Toffoli Gate [11.897854272643634]
  This manuscript expands the analytical and numerical approaches for optimizing quantum circuits at this abstraction level. We present a procedure for combining the strengths of analytical native gate-level optimization with numerical optimization. Our optimized Toffoli gate implementation demonstrates an $18%$ reduction in infidelity compared with the canonical implementation.
  arXiv  Detail & Related papers  (2022-09-06T17:29:22Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Scalable algorithm simplification using quantum AND logic [18.750481652943005]
  We implement a quantum version of AND logic that can reduce the cost, enabling the execution of key quantum circuits. On a high-scalability superconducting quantum processor, we demonstrate low-depth synthesis of high-fidelity generalized Toffoli gates with up to 8 qubits and Grover's search algorithm in a search space of up to 64 entries.
  arXiv  Detail & Related papers  (2021-12-30T04:25:39Z)
• Analytical and experimental study of center line miscalibrations in M\o lmer-S\o rensen gates [51.93099889384597]
  We study a systematic perturbative expansion in miscalibrated parameters of the Molmer-Sorensen entangling gate. We compute the gate evolution operator which allows us to obtain relevant key properties. We verify the predictions from our model by benchmarking them against measurements in a trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2021-12-10T10:56:16Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

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.