Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2601.05286

Investigation of Hardware Architecture Effects on Quantum Algorithm Performance: A Comparative Hardware Study

Askar Oralkhan, Temirlan Zhaxalykov

quant-phcs.ARcs.ETSubmitted Jan 7, 2026• Announced Jan 8, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

Comments
Submitted to the Journal of Supercomputing. Benchmarking results for IonQ Forte-1, Rigetti Ankaa-3, and IQM Garnet

Related papers

Experimental Evaluation of Multipartite Entanglement Across Trapped-Ion and Superconducting NISQ Architectures

Askar Oralkhan, Temirlan Zhaxalykov

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.

IEEE International Conference on Smart Information Systems and Technologies (SIST)•May 13, 2026•0 citations

Per-gate noise vulnerability of quantum algorithms: A systematic benchmarking study across multiple error channels

Tanvir Hassan

The performance of quantum algorithms on near-term devices is heavily constrained by hardware noise, yet systematic comparisons of algorithmic vulnerability across diverse noise types remain limited. In this study, we benchmark three representative algorithms: quantum teleportation, Grover’s search, and the Quantum Approximate Optimization Algorithm (QAOA), under depolarizing, amplitude damping, phase damping, and thermal relaxation channels. Using exact density-matrix simulations, we characterize algorithmic performance by evaluating state fidelity decay as a function of noise strength. To enable fair, structure-aware comparisons across circuits of varying depths, we introduce a novel metric, the per-gate decay rate. Our analysis reveals that teleportation exhibits the lowest per-gate vulnerability, whereas Grover’s algorithm demonstrates substantially larger, super-linear decay driven by its repeated oracle–diffuser architecture. QAOA displays intermediate and stable noise resilience across system sizes. Finally, we validate our simulation framework through hardware experiments on an IBM Heron processor, demonstrating strong agreement with theoretical predictions (Pearson’s correlation coefficient r = 0.981). This work establishes a quantitative, structure-aware framework for assessing circuit-level noise sensitivity and offers actionable insights for algorithm selection in the noisy intermediate-scale quantum era.

APL Quantum•Aug 6, 2026•0 citations

Cross-Platform Benchmarking of GHZ-State Generation in Quantum Processors via Cloud Services

Sergio Hernández, Unai Aseguinolaza, David Aguirre +10 more

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.

arXiv:2611.14114•Nov 10, 2026•0 citations

Quantum Approximate Optimization Algorithm on Different Qubit Systems

Seongmin Kim, In‐Saeng Suh, E. A. Coello Pérez +6 more

Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Architectural Paradigms Shaping the Future of Quantum Computing

Jyoti Gavhane, Gayatri Shirke, Ayush Nakod

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.

International Conference on Trends in Quantum Computing and Emerging Business Technologies (TQCEBT)•Apr 1, 2026•0 citations

Early IBM quantum computers: architectural analysis and performance benchmarks

M. AbuGhanem

Abstract The emergence of noisy intermediate-scale quantum processors marked a pivotal stage in quantum computing, enabling the first demonstrations of quantum computational advantage despite limitations in qubit count, connectivity, and gate fidelity. Among the earliest and most accessible NISQ platforms were the IBM Quantum $$^\texttt {TM}$$ TM computers, which provided an open testbed for algorithm development, benchmarking, and error mitigation. Crucially, many of these pioneering quantum computers have since been retired, rendering their performance records fragmented and at risk of permanent loss. This work presents a comprehensive benchmarking study of these early IBM quantum computers, documenting their architectural layouts, qubit connectivity, native gate sets, coherence properties, effective Hamiltonians, control mechanisms, error rates, and operational performance. We reconstruct the operational profiles of these quantum computers and highlight the trends, trade-offs, and limitations that characterized superconducting quantum hardware in the NISQ era. This study establishes a historical baseline for assessing progress in quantum hardware development, offering essential guidance on error scaling, coherence limitations, and architectural trade-offs for designing next-generation quantum hardware. These insights directly inform superconducting quantum architecture design, compilation strategies, and error-resilient algorithms on the path toward fault-tolerant quantum computation.

The Journal of Supercomputing•May 18, 2026•1 citation
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.
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 performance of quantum algorithms on near-term devices is heavily constrained by hardware noise, yet systematic comparisons of algorithmic vulnerability across diverse noise types remain limited. In this study, we benchmark three representative algorithms: quantum teleportation, Grover’s search, and the Quantum Approximate Optimization Algorithm (QAOA), under depolarizing, amplitude damping, phase damping, and thermal relaxation channels. Using exact density-matrix simulations, we characterize algorithmic performance by evaluating state fidelity decay as a function of noise strength. To enable fair, structure-aware comparisons across circuits of varying depths, we introduce a novel metric, the per-gate decay rate. Our analysis reveals that teleportation exhibits the lowest per-gate vulnerability, whereas Grover’s algorithm demonstrates substantially larger, super-linear decay driven by its repeated oracle–diffuser architecture. QAOA displays intermediate and stable noise resilience across system sizes. Finally, we validate our simulation framework through hardware experiments on an IBM Heron processor, demonstrating strong agreement with theoretical predictions (Pearson’s correlation coefficient r = 0.981). This work establishes a quantitative, structure-aware framework for assessing circuit-level noise sensitivity and offers actionable insights for algorithm selection in the noisy intermediate-scale quantum 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/2F=1/2F=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∗=27N^*=27N∗=27 and N∗=24N^*=24N∗=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.
Solving optimization problems is critical across many research domains, but the high dimensionality of parameter spaces often poses significant challenges. The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising approach for accelerating optimization in the Noisy Intermediate-Scale Quantum (NISQ) era by leveraging both classical and quantum computational resources. However, its performance can vary depending on the underlying quantum hardware architecture. In this work, we evaluate the performance of QAOA on different quantum hardware platforms, specifically, superconducting transmon qubits and trapped-ion qubits, targetting real-world optimization problems formulated as fully connected Quadratic Unconstrained Binary Optimization (QUBO) instances. We evaluate both the solution quality and time-to-solution using dense QUBO matrices. Furthermore, we show that large-scale problems, such as a 100-bit QUBO instance, can be effectively tackled by integrating quantum computing with high-performance computing (HPC) resources. This study provides practical insights into the strengths and limitations of different qubit technologies and advances the application of quantum computing in solving real-world optimization problems.
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 emergence of noisy intermediate-scale quantum processors marked a pivotal stage in quantum computing, enabling the first demonstrations of quantum computational advantage despite limitations in qubit count, connectivity, and gate fidelity. Among the earliest and most accessible NISQ platforms were the IBM Quantum TM^\texttt {TM}TM TM computers, which provided an open testbed for algorithm development, benchmarking, and error mitigation. Crucially, many of these pioneering quantum computers have since been retired, rendering their performance records fragmented and at risk of permanent loss. This work presents a comprehensive benchmarking study of these early IBM quantum computers, documenting their architectural layouts, qubit connectivity, native gate sets, coherence properties, effective Hamiltonians, control mechanisms, error rates, and operational performance. We reconstruct the operational profiles of these quantum computers and highlight the trends, trade-offs, and limitations that characterized superconducting quantum hardware in the NISQ era. This study establishes a historical baseline for assessing progress in quantum hardware development, offering essential guidance on error scaling, coherence limitations, and architectural trade-offs for designing next-generation quantum hardware. These insights directly inform superconducting quantum architecture design, compilation strategies, and error-resilient algorithms on the path toward fault-tolerant quantum computation.