Skip to main content
Scientific Reports logoLink to Scientific Reports
. 2026 May 25;16:16132. doi: 10.1038/s41598-026-53082-6

Benchmarking engineered exchange interactions on NISQ hardware

Muhammad AbuGhanem 1,✉
PMCID: PMC13201632  PMID: 42185378

Abstract

Engineered exchange interactions, realized through the iSWAP and Inline graphic gates, play a fundamental role in entangling operations for quantum algorithms, simulation of spin-exchange dynamics, and optimized qubit connectivity. In this work, we present hardware-aware implementations of the iSWAP and Inline graphic gates tailored to superconducting quantum processors, along with comprehensive characterization using both quantum process tomography (QPT) and direct state measurements (DSM). QPT results show process fidelities of 97.32% (iSWAP) and 98.02% (Inline graphic) on quantum simulator, decreasing to 89.72% and 87.65% on quantum hardware, respectively. DSM on the Inline graphic input state reveals that the iSWAP implementation achieves higher state preservation fidelity on hardware (93.53% vs. 92.44% for Inline graphic) but shows higher measured Inline graphic population (2.26% vs. 0.38%). These results establish a benchmark for anisotropic exchange gates on noisy intermediate-scale quantum (NISQ) hardware and provide quantitative performance data to inform gate selection for quantum circuit design in the NISQ era.

Keywords: Entanglement engineering, Engineered exchange interactions, Superconducting quantum computers, Quantum process tomography, NISQ era, iSWAP gate, Inline graphic gate

Subject terms: Engineering, Physics

Introduction

Quantum computers represent a paradigm shift in computing1, leveraging the principles of quantum mechanics—such as superposition and entanglement2,3—to solve problems intractable for classical computers4–6. This potential spans diverse fields7, from drug discovery8 and materials science9 to cryptography10 and financial modeling11. The realization of this promise, however, hinges on the ability to construct and control large-scale, fault-tolerant quantum processors12,13.

The pursuit of practical quantum computation7,14,15 relies on the precise implementation and characterization of high-fidelity entangling gates15–17. While the controlled-NOT (CNOT) and controlled-phase (CZ) gates are canonical choices for universal quantum computation15,16,18,19, alternative entangling interactions offer distinct advantages for specific applications, such as quantum simulation and efficient qubit routing4,20,21. Among these, anisotropic exchange interactions–mathematically realized through the iSWAP and Inline graphic gates16—provide a powerful family of operations that naturally emerge in various physical platforms 22–24, including superconducting circuits25.

The iSWAP gate16, which coherently exchanges excitations between two qubits with a phase factor, and its square-root variant, Inline graphic16, which serves as a perfect entangler, are particularly valuable for simulating quantum magnetic systems26 and optimizing compilation in architectures with limited connectivity27–30. In IBM’s superconducting quantum processors1, these gates are not native but are compiled into the native gate set31–33, making their performance susceptible to the complex noise environment of NISQ (noisy intermediate-scale quantum) devices17. To mitigate these effects, we develop hardware-aware decompositions tailored to the specific native gate set, calibration constraints, and coupling map of the target device.

Quantum process tomography (QPT) is a powerful technique for fully characterizing a quantum operation39–41, providing a complete description of the implemented quantum channel. By reconstructing the Choi matrix, QPT yields not only the process fidelity–a single-number benchmark–but also reveals the underlying error mechanisms, offering valuable diagnostic insights41.

This work presents hardware-aware implementations and comprehensive experimental characterization of the iSWAP and Inline graphic gates on IBM’s superconducting quantum hardware7. Employing a dual-methodology approach combining full QPT with DSM39–41, our analysis reveals a Inline graphic process fidelity reduction attributable to device noise, as well as differences in measured output populations when applying the gates to the Inline graphic input state. These quantitative results provide a benchmark for evaluating gate performance on NISQ hardware. The protocols and implementations presented here are applicable to several near-term quantum applications, including simulating spin-exchange dynamics in magnetic systems26, optimizing qubit routing in connectivity-limited architectures20,30, and compiling efficient entangling operations for variational quantum algorithms42. Furthermore, we provide a detailed analysis of hardware metrics–from relaxation times to readout errors–shedding light on the practical viability of anisotropic exchange gates for quantum algorithms in the NISQ era12,42.

Recent progress in pulse-level control–including steep-edge pulse generation34 and adjustable pulse-current techniques35–offers hardware insights relevant to timing-aware gate implementation. Entanglement-sensitive measurement and visualization36 highlight the importance of detailed experimental characterization beyond single-fidelity metrics. More broadly, quantum-inspired optimization strategies37,38 demonstrate the growing intersection of classical optimization and quantum concepts, though their direct application to quantum circuit compilation remains an open direction.

The remainder of this paper is organized as follows. Section Methods describes the experimental setup, including the compilation of target gates into native hardware operations in Sect. Hardware-aware implementation of the iSWAP and Inline graphic gates, DSM Protocol in Sect. Direct state measurement protocol, and the QPT technique in Sect. Quantum process tomography. The core results of our study are presented in Sect.  Results and discussion, where we present DSM results in Sect. Direct state measurements, compare simulated and experimental process fidelities in Sect. Quantum process fidelities, analyze the underlying error mechanisms, and discuss device comparative performance and quantum hardware analysis in Sect. Comparative performance and hardware analysis. Finally, Sect.  Conclusion provides concluding remarks and suggests avenues for future work.

Methods

Hardware-aware implementation of the iSWAP and Inline graphic gates

We developed hardware-aware implementations of the iSWAP and Inline graphic gates compiled into quantum circuits comprising the native gate set, Inline graphic, targeting the specific coupling map and qubit properties of IBM’s superconducting Falcon architecture, specifically the ibm_perth quantum computer. Figure 1a presents the quantum circuit that implements the iSWAP gate using a hardware-native gate set. The corresponding decomposition for the Inline graphic gate is shown in Fig. 1b. Both circuits are engineered for realistic NISQ-era hardware, utilizing a minimal number of two-qubit interactions (only two CNOT gates) interleaved with single-qubit rotations, thereby minimizing latency and error accumulation.

Fig. 1.

Fig. 1

Hardware-aware quantum circuit implementations of engineered exchange interactions (Inline graphic and Inline graphic). (a) Decomposition of the Inline graphic gate into the native gate set Inline graphic using two CNOT gates interleaved with single-qubit Inline graphic and Inline graphic (Inline graphic) rotations. The matrix definitions are Inline graphic and Inline graphic. (b) Decomposition of the Inline graphic gate using the same native gate set, also requiring only two CNOT gates. Both compilations minimize two-qubit interactions to reduce error accumulation on NISQ hardware.

Direct state measurement protocol

To assess the output state distribution and error patterns of each gate when applied to Inline graphic, we performed DSM by preparing the Inline graphic input state, applying either the iSWAP or Inline graphic gate, and measuring in the computational basis. For each gate, we executed 7,168 shots on both the qasm_simulator (for ideal reference) and the ibm_perth quantum computer. The output distribution across the four computational basis states (Inline graphic, Inline graphic, Inline graphic, Inline graphic) was recorded, providing insights into:

  • State preservation fidelity (Inline graphic)

  • Single-qubit excitation errors (Inline graphic, Inline graphic)

  • Two-qubit error events (Inline graphic)

Because both gates act trivially on the Inline graphic state, any measured population in Inline graphic, Inline graphic, or Inline graphic directly reflects gate imperfections, hardware noise, or readout errors. This protocol complements QPT by providing additional characterization of output state distributions under identical initial conditions.

Quantum process tomography

We employed standard full QPT39,40,44 to fully characterize the implemented gates. Each QPT experiment was executed with 4,000, providing sufficient statistical accuracy for the reconstruction. The resulting data was subsequently processed to reconstruct the physical Choi matrix Inline graphic that best describes the experimental quantum process41. The performance of the gate was quantified by calculating the process fidelity (Inline graphic)45,46, which measures the overlap between the experimentally reconstructed process (Inline graphic) and the ideal target process (Inline graphic).

All experiments were conducted on IBM Quantum’s ibm_perth quantum computer, a 7-qubit Falcon r5.11H system with a quantum volume of 3247, using qubits 0 and 1. The device’s key performance metrics, including relaxation times (Inline graphic), dephasing times (Inline graphic), and readout errors (Inline graphic), are detailed in Tables 1 and 2. These metrics were recorded concurrently with the full QPT experiments to provide a snapshot of the device’s performance.

Table 1.

Qubit-specific performance characteristics recorded during the QPT experiments of the iSWAP gate. Metrics include relaxation time (Inline graphic), dephasing time (Inline graphic), frequency (Inline graphic), anharmonicity (Inline graphic), readout error (Inline graphic), conditional measurement probabilities (P(0|1), P(1|0)), and readout duration (Inline graphic).

Qubit TInline graphic (Inline graphics) TInline graphic (Inline graphics) Inline graphic (GHz) Inline graphic (GHz) Inline graphic P(0|1) P(1|0) Inline graphic (ns)
0 112.217 89.958 5.15756 -0.34152 0.0281 0.0292 0.0270 721.78
1 143.980 54.158 5.03355 -0.34437 0.0304 0.0320 0.0288 721.78
2 214.031 95.996 4.86266 -0.34727 0.0338 0.0272 0.0404 721.78
3 168.649 227.967 5.12510 -0.34044 0.0161 0.0186 0.0136 721.78
4 169.539 132.514 5.15921 -0.33337 0.0293 0.0286 0.0300 721.78
5 148.766 142.089 4.97861 -0.34602 0.0300 0.0344 0.0256 721.78
6 188.841 231.382 5.15664 -0.34045 0.0114 0.0126 0.0102 721.78

Table 2.

Calibration data from the IBM Quantum device during the Inline graphic QPT experiments, providing context for the error sources contributing to the observed experimental fidelity.

Qubit TInline graphic (Inline graphics) TInline graphic (Inline graphics) Inline graphic (GHz) Inline graphic (GHz) Inline graphic P(0|1) P(1|0) Inline graphic (ns)
0 87.651 89.958 5.15756 -0.34152 0.0281 0.0292 0.0270 721.78
1 193.942 54.158 5.03355 -0.34437 0.0304 0.0320 0.0288 721.78
2 96.764 95.996 4.86266 -0.34727 0.0338 0.0272 0.0404 721.78
3 201.576 227.967 5.12510 -0.34044 0.0161 0.0186 0.0136 721.78
4 154.494 132.514 5.15921 -0.33337 0.0293 0.0286 0.0300 721.78
5 128.461 142.089 4.97861 -0.34602 0.0300 0.0344 0.0256 721.78
6 222.168 231.382 5.15664 -0.34045 0.0114 0.0126 0.0102 721.78

As shown in Fig. 2, the local oscillator frequencies for qubit drive and measurement are well separated into two distinct frequency bands, minimizing the risk of control-readout interference48,49. The qubit LOs operate in the Inline graphic GHz range (approximately 4.36–5.66 GHz), corresponding to the transition frequencies of the transmon qubits25. While the measurement LOs are systematically up-converted to the Inline graphic GHz range (approximately 6.62–7.85 GHz), aligning with the frequencies of the readout resonators and leveraging the dispersive shift for state-selective measurement. This frequency separation is a critical hardware design feature that ensures operational fidelity32.

Fig. 2.

Fig. 2

Distribution of local oscillator frequencies for qubit control and readout. Box plot comparing the operational frequency ranges (in GHz) of the local oscillators (LOs) used for qubit drive (Qubit LO) and measurement readout (Measurement LO) across the seven-qubit processor.

Results and discussion

Direct state measurements

Experimental characterization of the iSWAP-family gates reveals distinct output state distributions when applied to the Inline graphic input state. The results are summarized in Table 3.

Table 3.

Measured output state distributions for iSWAP and Inline graphic gates applied to Inline graphic input (7,168 shots).

Gate Platform Inline graphic (%) Inline graphic (%) Inline graphic (%) Inline graphic (%)
iSWAP Simulator 100.00 0.00 0.00 0.00
iSWAP Hardware 93.53 1.76 2.46 2.26
Inline graphic Simulator 100.00 0.00 0.00 0.00
Inline graphic Hardware 92.44 3.10 4.09 0.38

For the iSWAP gate, execution on the noiseless simulator yielded ideal performance with all 7,168 shots returning the Inline graphic state (Inline graphic). On quantum hardware, the gate achieved Inline graphic, with the 6.47% infidelity distributed across erroneous states. The measured Inline graphic population was 2.26%. The Inline graphic gate showed a different population distribution. While simulation maintained perfect results (Inline graphic), hardware execution achieved Inline graphic. The measured Inline graphic population was substantially lower at 0.38%, while single-excitation populations in Inline graphic (3.10%) and Inline graphic (4.09%) were higher than for the iSWAP gate.

Because both gates act trivially on Inline graphic, any population in Inline graphic, Inline graphic, or Inline graphic arises from hardware noise, gate imperfections, or readout errors. The observed differences in output distributions reflect the distinct error sensitivities of the two compiled implementations under the same device noise environment. Figure 3 shows the output state distributions for both gates. While the DSM protocol presented here probes only the Inline graphic state, the complete process characterization is provided by QPT (Sect. Quantum process fidelities).

Fig. 3.

Fig. 3

Output state populations for (a) iSWAP and (b) Inline graphic gates applied to the Inline graphic input state.

Quantum process fidelities

The experimental quantum process fidelities from our full QPT experiments are summarized in Table 4 (including a comparison with the native CNOT gate) and visually presented in Figs. 4 and 5. The observed fidelities reflect the effectiveness of our hardware-aware implementations.

Table 4.

Characterization of iSWAP, Inline graphic, and CNOT gates showing QPT fidelities (Inline graphic) and output state populations (Inline graphic) for the Inline graphic input. The Inline graphic gate shows the largest hardware fidelity drop (Inline graphic), while the CNOT gate exhibits the smallest (Inline graphic). All three gates show comparable Inline graphic degradation on hardware (Inline graphic).

Gate Process fidelity Inline graphic Inline graphic State preparation Inline graphic Inline graphic
Simulator (%) Hardware (%) (HW Drop) (%) Simulator (%) Hardware (%) (HW Drop) (%)
iSWAP (This study) 97.32 89.72 7.60 100.00 93.53 6.47
Inline graphic (This study) 98.02 87.65 10.37 100.00 92.44 7.56
CNOT 55 97.89 93.02 4.87 100.00 92.40 7.60

Fig. 4.

Fig. 4

Experimental characterization of the Inline graphic gate via QPT. (a) The ideal process matrix. (b) The noise-free simulation result (Inline graphic). (c) The process reconstructed from data acquired on the ibm_perth quantum computer (Inline graphic).

Fig. 5.

Fig. 5

Quantum process tomography of the iSWAP gate. (a) The ideal Choi matrix representing the target unitary. (b) The reconstructed process from a noiseless simulation, achieving a fidelity of Inline graphic. (c) The experimental implementation on the ibm_perth, yielding a fidelity of Inline graphic. The real (ReInline graphic) and imaginary (ImInline graphic) components of the Choi matrix Inline graphic are shown for each case.

Execution on IBM Quantum’s qasm_simulator established a theoretical performance upper bound50, yielding high fidelities of 97.32% for the iSWAP gate and 98.02% for the Inline graphic gate. While the simulator is noiseless (no decoherence or gate errors), the finite number of shots introduces statistical fluctuations in the measurement outcomes. As a result, the reconstructed process fidelity deviates from unity even for ideal gates, following the fundamental scaling law for sampling noise51. The statistical uncertainty scales as Inline graphic; with 4,000 shots, the reconstructed fidelity is below unity and converges to unity as Inline graphic increases. Thus, the residual infidelity of Inline graphic arises from finite-sampling shot noise and is distinct from hardware noise51,52.

Experimental execution on the quantum hardware revealed a significant fidelity reduction due to device noise. The iSWAP gate achieved a process fidelity45,46 of 89.72%, while the Inline graphic gate achieved 87.65%. This Inline graphic drop is a direct consequence of decoherence, imperfect gate calibration, and state preparation and measurement (SPAM) errors endemic to NISQ-era devices53,54. Visual inspection of the reconstructed Choi matrices in Figs. 4 and 5 provide a qualitative assessment. The experimental matrices (subfigures (c)) show clear deviations from the ideal ones (a), particularly in the off-diagonal elements which correspond to coherent errors and energy loss53.

Comparative performance and hardware analysis

A comprehensive analysis of the hardware performance during these experiments is provided in Fig. 6. The plots compare key qubit metrics–Inline graphic, Inline graphic, frequency, anharmonicity, and readout errors–for both gates. Our benchmarking experiments used qubits 0 and 1 (see Tables 1 and 2). Considering first these two qubits, we observe that qubit 1 exhibits a substantially shorter Inline graphic (54.2 Inline graphics) than qubit 0 (90.0 Inline graphics), indicating higher dephasing sensitivity in qubit 1. More broadly, the full 7-qubit data in Fig. 6 reveals considerable qubit-to-qubit variability, a hallmark of current superconducting processors.

Fig. 6.

Fig. 6

Device performance metrics during QPT execution for the iSWAP and Inline graphic gates. Key parameters—including relaxation time (Inline graphic), dephasing time (Inline graphic), qubit frequency (Inline graphic), anharmonicity (Inline graphic), readout error (Inline graphic), state-assignment error (P(0|1), P(1|0)), and readout length—are compared across the seven qubits.

Several observations can be made from these plots. For the Inline graphic metric, significant variation is evident across qubits and between experimental runs (e.g., qubit 0 Inline graphic decreased from 112.2 Inline graphics to 87.7 Inline graphics), highlighting the stochastic nature of decoherence and device drift in NISQ processors17. In contrast, Inline graphic values remained stable across both experiments (see Tables 1 and 2). The qubit frequency remains stable across both experimental runs, as expected for fixed-frequency transmon qubits25.

Conclusion

In this work, we have provided hardware-aware implementations and comprehensive experimental characterization of engineered exchange interactions, realized through the iSWAP and Inline graphic gates, on a superconducting quantum processor. By employing a dual-methodology approach combining full quantum process tomography with direct state measurements, we have quantified their performance and established a multi-faceted benchmark of direct relevance for NISQ-era computation. The hardware-aware decompositions developed for this work minimize circuit depth by utilizing only two CNOT gates, demonstrating the effectiveness of targeted compilation for NISQ-era devices.

Our results reveal a nuanced performance landscape on current hardware. While quantum simulations yield high process fidelities exceeding 97%, execution on a superconducting quantum processor reveals a significant fidelity reduction to approximately 90% for iSWAP and Inline graphic. For context, the native CNOT gate achieves a fidelity of 93%, indicating that our implementations are competitive despite the additional circuit complexity. Direct state measurements provide complementary insights: when applied to the Inline graphic input state, the iSWAP implementation shows higher measured Inline graphic (93.53% vs. 92.44%) but also a higher measured Inline graphic population (2.26% vs. 0.38% for Inline graphic). The Inline graphic percentage point process fidelity gap reflects the cumulative impact of device noise, while the observed differences in output state distributions highlight the distinct error sensitivities of the two compiled implementations under the same noise environment.

Looking forward, this comprehensive benchmarking establishes a foundation for several future directions—optimizing gate selection based on specific error tolerance requirements, developing error mitigation strategies tailored to dominant error channels, and guiding the design of exchange-based quantum simulations. Extensions to other hardware platforms and integration of these gates into full quantum algorithms represent important next steps. As superconducting hardware continues to evolve, the rigorous multi-metric characterization demonstrated here remains essential for mapping progress toward fault-tolerant quantum computation.

Acknowledgements

We acknowledge the use of IBM Quantum resources in the course of this research. The views and conclusions presented herein are solely those of the author and do not represent the official policies or positions of IBM Quantum or its affiliates.

Author contributions

Muhammad AbuGhanem: Conceptualization, methodology, formal analysis, experimentation, visualization, investigation, validation, writing, reviewing, and editing. The author approved the final manuscript.

Funding

Open access funding provided by The Science, Technology & Innovation Funding Authority (STDF) in cooperation with The Egyptian Knowledge Bank (EKB).

Data availability

The datasets generated during and/or analyzed during this study are included within this article.

Declarations

Competing interests

The authors declare no competing interests.

Consent for publication

All authors have approved the publication. This research did not involve any human, animal, or other participants.

Footnotes

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.AbuGhanem, M. Superconducting quantum computers: Who is leading the future?. EPJ Quantum Technol.12, 102 (2025). [Google Scholar]
  • 2.Dirac, P. The Principles of Quantum Mechanics (Clarendon Press) (1930).
  • 3.AbuGhanem, M. Properties of Some Quantum Computing Models. Master’s thesis, Ain Shams University (2019).
  • 4.Kim, Y. et al. Evidence for the utility of quantum computing before fault tolerance. Nature618, 500–505 (2023). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 5.Wu, Y. et al. Strong quantum computational advantage using a superconducting quantum processor. Phys. Rev. Lett.127, 180501 (2021). [DOI] [PubMed] [Google Scholar]
  • 6.Acharya, R. et al. Quantum error correction below the surface code threshold. Nature638, 920–926 (2025). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 7.AbuGhanem, M. IBM quantum computers: Evolution, performance, and future directions. J. Supercomput.81, 687 (2025). [Google Scholar]
  • 8.Santagati, R. et al. Drug design on quantum computers. Nat. Phys.20, 549–557 (2024). [Google Scholar]
  • 9.Motta, M. et al. Quantum chemistry simulation of ground- and excited-state properties of the sulfonium cation on a superconducting quantum processor. Chem. Sci.14, 2915–2927 (2023). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 10.Gidney, C. & Ekerå, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum5, 433 (2021). [Google Scholar]
  • 11.Phillipson, F. Quantum computing in logistics and supply chain management: An Overview. Preprint at arXiv:2402.17520 (2024).
  • 12.AbuGhanem, M. & Eleuch, H. NISQ computers: A path to quantum supremacy. IEEE Access12, 102941–102961 (2024). [Google Scholar]
  • 13.Beverland, M. E. Assessing requirements to scale to practical quantum advantage. Preprint at arXiv:2211.07629 (2022).
  • 14.AbuGhanem, M. Google Quantum AI’s quest for error-corrected quantum computers. Preprint at arXiv:2410.00917 (2024).
  • 15.DiVincenzo, D. P. The physical implementation of quantum computation. Fortschr. Phys.48, 771–783 (2000). [Google Scholar]
  • 16.Nielsen, M. A. & Chuang, I. L. Quantum Computation and Quantum Information, 10th anniversary edn. (Cambridge University Press) (2011).
  • 17.Preskill, J. Quantum computing in the NISQ era and beyond. Quantum2, 79 (2018). [Google Scholar]
  • 18.Chang, K.-C. et al. Recent advances in high-dimensional quantum frequency combs. Newton1, 100024 (2025). [Google Scholar]
  • 19.Chang, K.-C. et al. Quantum teleportation of a silicon nanophotonic CNOT gate. Optica Quantum3, 381–388 (2025). [Google Scholar]
  • 20.Siraichi, M. Y. Qubit allocation. In Proceedings of the 2018 International Symposium on Code Generation and Optimization (Association for Computing Machinery) 113–125 (2018).
  • 21.Georgescu, I. M., Ashhab, S. & Nori, F. Quantum simulation. Rev. Mod. Phys.86, 153 (2014). [Google Scholar]
  • 22.Wintersperger, K. et al. Neutral atom quantum computing hardware: Performance and end-user perspective. EPJ Quantum Technol.10, 32 (2023). [Google Scholar]
  • 23.Chen, J.-S. et al. Benchmarking a trapped-ion quantum computer with 30 qubits. Quantum8, 1516 (2024). [Google Scholar]
  • 24.AbuGhanem, M. Toward scalable fault-tolerant photonic quantum computers. J. Supercomput.82, 51 (2026). [Google Scholar]
  • 25.Koch, J. et al. Charge-insensitive qubit design derived from the Cooper pair box. Phys. Rev. A76, 042319 (2007). [Google Scholar]
  • 26.Arute, F. Observation of separated dynamics of charge and spin in the Fermi-Hubbard model. Preprint at arXiv:2010.07965 (2020).
  • 27.Holmes, A., Johri, S., Guerreschi, G. G., Clarke, J. S. & Matsuura, A. Y. Impact of qubit connectivity on quantum algorithm performance. Quantum Sci. Technol.5, 025009 (2020). [Google Scholar]
  • 28.Hu, Y. et al. Suppressing quantum errors by noise-aware circuit design. Quantum Sci. Technol.10, 045040 (2025). [Google Scholar]
  • 29.Gago-Encinas, F. & Koch, C. P. Scalable modular architecture for universal quantum computation. Preprint at arXiv:2507.14691 (2025).
  • 30.Guo, Y. & Yang, S. Efficient quantum circuit compilation for near-term quantum advantage. EPJ Quantum Technol.12, 69 (2025). [Google Scholar]
  • 31.Chow, J. M. et al. Simple all-microwave entangling gate for fixed-frequency superconducting qubits. Phys. Rev. Lett.107, 080502 (2011). [DOI] [PubMed] [Google Scholar]
  • 32.Magesan, E. & Gambetta, J. M. Effective Hamiltonian models of the cross-resonance gate. Phys. Rev. A101, 052308 (2020). [Google Scholar]
  • 33.AbuGhanem, M. Hardware-aware Toffoli gate decomposition via echoed cross-resonance gates. Quantum Stud. Math. Found.12, 24 (2025). [Google Scholar]
  • 34.Dong, S. et al. A bipolar pulse rising edge steepening circuit based on diode reverse recovery. IEEE Trans. Instrum. Meas.74, 1–10 (2025).42146727 [Google Scholar]
  • 35.Zhao, L. et al. A fast-edge square-wave adjustable pulse current generator based on coupling inductor. IEEE Trans. Ind. Electron.71, 12086–12099 (2024). [Google Scholar]
  • 36.Yu, W.-K. et al. Experimental first-photon visualization of quantum erasure with hybrid entanglement. Laser Photonics Rev.20, e01816 (2026). [Google Scholar]
  • 37.Wang, Z. & Wang, X. Quantum-classical hybrid genetic evolutionary algorithm for topology optimization of continuum structures. Int. J. Numer. Methods Eng.126, e70073 (2025). [Google Scholar]
  • 38.Xu, Y., Wang, X. & Wang, Z. Quantum mapping algorithm for structural non-probabilistic reliability optimization. Struct. Multidiscip. Optim.68, 85 (2025). [Google Scholar]
  • 39.Chuang, I. L. & Nielsen, M. A. Prescription for experimental determination of the dynamics of a quantum black box. J. Mod. Opt.44, 2455 (1997). [Google Scholar]
  • 40.Poyatos, J. F., Cirac, J. I. & Zoller, P. Complete characterization of a quantum process: The two-bit quantum gate. Phys. Rev. Lett.78, 390 (1997). [Google Scholar]
  • 41.Knee, G. C., Bolduc, E., Leach, J. & Gauger, E. M. Quantum process tomography via completely positive and trace-preserving projection. Phys. Rev. A98, 062336 (2018). [Google Scholar]
  • 42.Bharti, K. et al. Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys.94, 015004 (2022). [Google Scholar]
  • 43.Reagor, M. et al. Demonstration of universal parametric entangling gates on a multi-qubit lattice. Sci. Adv.4, eaao3603 (2018). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 44.AbuGhanem, M. Full quantum process tomography of a universal entangling gate on an IBM’s quantum computer. Arab. J. Sci. Eng.50, 19923–19937 (2025).
  • 45.Horodecki, M., Horodecki, P. & Horodecki, R. General teleportation channel, singlet fraction, and quasidistillation. Phys. Rev. A60, 1888 (1999). [Google Scholar]
  • 46.Nielsen, M. A. A simple formula for the average gate fidelity of a quantum dynamical operation. Phys. Lett. A303, 249 (2002). [Google Scholar]
  • 47.Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D. & Gambetta, J. M. Validating quantum computers using randomized model circuits. Phys. Rev. A100, 032328 (2019). [Google Scholar]
  • 48.Zhou, Z., Sitler, R., Oda, Y., Schultz, K. & Quiroz, G. Quantum crosstalk robust quantum control. Phys. Rev. Lett.131, 210802 (2023). [DOI] [PubMed] [Google Scholar]
  • 49.Liu, R., Guan, Z., Cheng, X., Zhu, P. & Feng, S. Suppression of crosstalk in quantum computers based on instruction exchange rules and duration. J. Phys. Conf. Ser.2524, 012026 (2023). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 50.Aleksandrowicz, G. et al. Qiskit: An Open-source Framework for Quantum Computing. Zenodo. (2019). 10.5281/zenodo.2562111.
  • 51.Kreplin, D. A. & Roth, M. Reduction of finite sampling noise in quantum neural networks. Quantum8, 1385 (2024). [Google Scholar]
  • 52.Sun, W., Jin, Y., Lu, G. & Liu, Y. Stabilizer testing and central limit theorem. Phys. Rev. A111, 032421 (2025). [Google Scholar]
  • 53.Magesan, E., Gambetta, J. M. & Emerson, J. Scalable and robust randomized benchmarking of quantum processes. Phys. Rev. Lett.106, 180504 (2011). [DOI] [PubMed] [Google Scholar]
  • 54.Wang, C. Quantum state preparation by improved MPS method. Preprint at arXiv:2508.12821 (2025).
  • 55.AbuGhanem, M. Characterizing conditional quantum dynamics on superconducting quantum processors. Eur. Phys. J. Plus141, 124 (2026). [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

The datasets generated during and/or analyzed during this study are included within this article.


Articles from Scientific Reports are provided here courtesy of Nature Publishing Group

RESOURCES