The practical performance of Noisy Intermediate-Scale Quantum (NISQ) processors is strongly influenced by hardware architecture, connectivity, and noise characteristics. In this work, we present an experimental benchmarking study of multipartite entanglement across cloud-accessible trapped-ion and superconducting quantum processors. Using Bell-state CHSH violation and GHZ-state fidelity as quantitative metrics, we evaluate entanglement generation on IonQ (trapped-ion) and IQM and Rigetti (superconducting) platforms under consistent compilation and execution settings via Amazon Braket. Experimental results demonstrate that trapped-ion processors sustain high-fidelity multipartite entanglement for up to 10 qubits, while superconducting architectures exhibit rapid fidelity degradation as circuit depth and routing overhead increase. These findings highlight the critical role of qubit connectivity and two-qubit gate performance in near-term entanglement scalability and provide an empirical comparison of architectural trade-offs in current NISQ hardware.
The practical performance of Noisy Intermediate-Scale Quantum (NISQ) processors is strongly influenced by hardware architecture, connectivity, and noise characteristics. In this work, we present an experimental benchmarking study of multipartite entanglement across cloud-accessible trapped-ion and superconducting quantum processors. Using Bell-state CHSH violation and GHZ-state fidelity as quantitative metrics, we evaluate entanglement generation on IonQ (trapped-ion) and IQM and Rigetti (superconducting) platforms under consistent compilation and execution settings via Amazon Braket. Experimental results demonstrate that trapped-ion processors sustain high-fidelity multipartite entanglement for up to 10 qubits, while superconducting architectures exhibit rapid fidelity degradation as circuit depth and routing overhead increase. These findings highlight the critical role of qubit connectivity and two-qubit gate performance in near-term entanglement scalability and provide an empirical comparison of architectural trade-offs in current NISQ hardware.
Cloud-accessible quantum processors enable direct execution of quantum algorithms on heterogeneous hardware platforms. Unlike classical systems, however, identical quantum circuits may exhibit substantially different behavior across devices due to architectural variations in qubit connectivity, gate fidelity, and coherence times.
In this work, we systematically benchmark five representative quantum algorithms - Bell state preparation, GHZ state generation, Quantum Fourier Transform (QFT), Grover's Search, and the Quantum Approximate Optimization Algorithm (QAOA) - across trapped-ion, superconducting, and simulator backends using Amazon Braket. Performance metrics including fidelity, CHSH violation, success probability, circuit depth, and gate counts are evaluated.
Our results demonstrate a strong dependence of algorithmic performance on hardware topology and noise characteristics. For example, 10-qubit GHZ states achieved fidelities above 0.8 on trapped-ion hardware, while superconducting platforms dropped below 0.15 due to routing overhead and accumulated two-qubit gate errors. These findings highlight the importance of hardware-aware algorithm selection and provide practical guidance for benchmarking in the NISQ era.
Quantum computing has rapidly evolved into a diverse ecosystem of hardware platforms that differ in their underlying technologies and operational characteristics. Consequently, benchmarking has become essential for identifying the strengths of quantum processors, comparing their performance, and enabling informed decisions when selecting the most appropriate quantum computing platform for specific applications. In this work, we benchmark nine commercially accessible quantum processors from five vendors, spanning superconducting and trapped-ion technologies, using the multipartite entanglement benchmark from the QuSquare suite. All experiments were performed through remote cloud-access services, with the default compilation of each provider and without error mitigation, reflecting the performance experienced by end users. The benchmark estimates the fidelity of Greenberger--Horne--Zeilinger (GHZ) states by direct fidelity estimation and searches for the largest GHZ state whose fidelity is compatible, within the statistical error, with the genuine multipartite entanglement (GME) threshold F=1/2. Our results reveal a substantial gap between the total number of physical qubits available on a processor and the size of the largest GHZ state passing the benchmark: the best superconducting processors reach N∗=27 and N∗=24 qubits, less than a quarter of their registers, whereas the 12-qubit trapped-ion processor passes with its full register. We further show that median calibration data are poor predictors of the benchmark outcome, and that the reported sizes depend strongly on the statistical decision rule: requiring certified GME reduces the number of devices that succeed at any tested size from nine to four. These results provide a baseline for future cross-platform benchmarking of quantum processors.
Quantum computing is at the cusp of showing relevance for real-world problems. However, currently available devices are small in scale, and hardware demonstrations have shown limited applicability to scientific and commercial problems of interest. In this work, we investigate a set of application-specific noisy intermediate-scale quantum (NISQ) algorithms varying in size from 4-80 qubits, and use these benchmarks to evaluate trade-offs in the design of trapped ion quantum computing architectures. We have developed a tool-chain consisting of architecture specific compilation and simulation tools and used these tools to target five different candidate trapped ion quantum computing architectures. Using our tool-chain, we can estimate metrics such as application run-times and overhead. Additionally, we use our tools to determine the critical operations of an architecture and to study the sensitivity to architectural constraints in particular implementations. Our tools are designed to be flexible, allowing us to study a broad range of benchmarks, hardware architectures, physical constraints, and operation timing.
The Berkeley gate is a high-performance, two-qubit entangling operation with particular potential for quantum error correction and fault-tolerant protocols. However, harnessing this potential on current noisy intermediate-scale quantum (NISQ) processors, requires efficient compilation and robust performance under realistic noise conditions. In this work, we demonstrate a hardware-efficient implementation of the Berkeley gate on a superconducting quantum processor. Using quantum process tomography (QPT), we experimentally characterize its performance and benchmark it against a noiseless quantum simulator to evaluate its practical reliability in the NISQ era. Experimental measurements confirm the gate's correct logical action, producing the target partially entangled state with a subspace confinement probability of [Formula: see text] on real quantum hardware compared to 100% in quantum simulation. Results from QPT experiments show a simulated process fidelity of [Formula: see text], while the experimental process fidelity on hardware is [Formula: see text]. The observed discrepancy is analyzed in the context of device-specific noise sources, including qubit relaxation, dephasing, and state preparation and measurement (SPAM) errors. Our work provides a concrete fidelity benchmark for the Berkeley gate on superconducting hardware and quantify the impact of realistic noise on a non-trivial two-qubit operation, supporting its use in near-term algorithmic and error-correction applications.
Today, the bottleneck in moving from theoretical quantum algorithms to practical implementations lies in a hard problem: architecture and structure, given hardware limitations. This highlights separations in the landscape of qubit realization, which are discussed in terms of trade-offs among gate speed, coherence time, and scalability across the four leading architectures. Superconducting circuits dominate industrial applications like rapid gate operations, yet they remain sensitive to decoherence. Trapped-ion systems perform exceptionally well in qubit fidelity but face many obstacles when scaling up the qubit count. Emerging alternatives, such as photonic systems that do not require extreme cooling and topological qubits, have been observed and analyzed. These are designed to be error-free in principle but are still in early experimental stages. By combining the strengths and weaknesses of these designs, this paper outlines the hardware evolution required to transition from Noisy Intermediate-Scale Quantum (NISQ) devices to fully faulttolerant systems. The work incorporates rigorous quantitative comparative analyses, performance modeling, and simulationbased evaluations to enhance the study's originality and technical depth.
Abstract The Mølmer–Sø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ølmer–Sø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⟩ | 00 ⟩ input state, the gate prepares the target Bell state with 94.2% 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.