{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:00:04Z","timestamp":1780675204916,"version":"3.54.1"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002352","name":"Ain Shams University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002352","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$^\\texttt {TM}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mmultiscripts>\n                            <mml:mrow\/>\n                            <mml:mrow\/>\n                            <mml:mi>TM<\/mml:mi>\n                          <\/mml:mmultiscripts>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    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.\n                  <\/jats:p>","DOI":"10.1007\/s11227-026-08386-9","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T15:21:31Z","timestamp":1779117691000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Early IBM quantum computers: architectural analysis and performance benchmarks"],"prefix":"10.1007","volume":"82","author":[{"given":"Muhammad","family":"AbuGhanem","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"8386_CR1","doi-asserted-by":"crossref","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, pp 124\u2013134","DOI":"10.1109\/SFCS.1994.365700"},{"key":"8386_CR2","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (STOC \u201996. ACM, pp 212\u2013219","DOI":"10.1145\/237814.237866"},{"key":"8386_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"key":"8386_CR4","doi-asserted-by":"publisher","first-page":"102941","DOI":"10.1109\/ACCESS.2024.3432330","volume":"12","author":"M AbuGhanem","year":"2024","unstructured":"AbuGhanem M, Eleuch H (2024) NISQ computers: a path to quantum supremacy. IEEE Access 12:102941\u2013102961","journal-title":"IEEE Access"},{"key":"8386_CR5","doi-asserted-by":"publisher","first-page":"R2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"PW Shor","year":"1995","unstructured":"Shor PW (1995) Scheme for reducing decoherence in quantum computer memory. Phys Rev A 52:R2493","journal-title":"Phys Rev A"},{"key":"8386_CR6","first-page":"1338","volume":"14","author":"D Gottesman","year":"2014","unstructured":"Gottesman D (2014) Fault-tolerant quantum computation with constant overhead. Quantum Inf Comput 14:1338\u20131372","journal-title":"Quantum Inf Comput"},{"key":"8386_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s11227-025-08132-7","volume":"82","author":"M AbuGhanem","year":"2026","unstructured":"AbuGhanem M (2026) Toward scalable fault-tolerant photonic quantum computers. J Supercomput 82:51","journal-title":"J Supercomput"},{"key":"8386_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s12200-024-00133-3","volume":"17","author":"M AbuGhanem","year":"2024","unstructured":"AbuGhanem M (2024) Information processing at the speed of light. Front Optoelectron 17:33","journal-title":"Front Optoelectron"},{"key":"8386_CR9","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute F, Arya K, Babbush R et al (2019) Quantum supremacy using a programmable superconducting processor. Nature 574:505\u2013510","journal-title":"Nature"},{"key":"8386_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11227-025-07047-7","volume":"81","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem M (2025) IBM quantum computers: evolution, performance, and future directions. J Supercomput 81:687","journal-title":"J Supercomput"},{"key":"8386_CR11","doi-asserted-by":"crossref","unstructured":"Montanez-Barrera JA, Michielsen K (2024) Towards a universal QAOA protocol: evidence of quantum advantage in solving combinatorial optimization problems. arXiv:2405.09169","DOI":"10.1038\/s41534-025-01082-1"},{"key":"8386_CR12","unstructured":"AbuGhanem M (2024) Google Quantum AI\u2019s quest for error-corrected quantum computers. arXiv:2410.00917"},{"key":"8386_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s41586-023-05784-4","volume":"616","author":"Z Ni","year":"2023","unstructured":"Ni Z et al (2023) Beating the break-even point with a discrete-variable-encoded logical qubit. Nature 616:56\u201360","journal-title":"Nature"},{"key":"8386_CR14","doi-asserted-by":"publisher","first-page":"1281","DOI":"10.1038\/s41598-024-80188-6","volume":"15","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem M (2025) Characterizing Grover search algorithm on large-scale superconducting quantum computers. Sci Rep 15:1281","journal-title":"Sci Rep"},{"key":"8386_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s11128-025-04777-8","volume":"24","author":"R Zhang","year":"2025","unstructured":"Zhang R, Qi R, Chen T et al (2025) Coherent wave-particle quantum walks. Quantum Inf Process 24:155","journal-title":"Quantum Inf Process"},{"key":"8386_CR16","doi-asserted-by":"publisher","first-page":"18897","DOI":"10.1038\/s41598-025-00494-5","volume":"15","author":"M Noorallahzadeh","year":"2025","unstructured":"Noorallahzadeh M, Mosleh M (2025) Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers. Sci Rep 15:18897","journal-title":"Sci Rep"},{"key":"8386_CR17","doi-asserted-by":"crossref","unstructured":"Butt F, Pogorelov I, Freund R, Steiner A, Meyer M, Monz T, M\u00fcller M (2025) Demonstration of measurement-free universal fault-tolerant quantum computation. arXiv:2506.22600","DOI":"10.21203\/rs.3.rs-7092911\/v1"},{"key":"8386_CR18","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1038\/s43588-024-00709-1","volume":"4","author":"SV Barron","year":"2024","unstructured":"Barron SV, Egger DJ, Pelofske E, B\u00e4rtschi A, Eidenbenz S, Lehmkuehler M, Woerner S (2024) Provable bounds for noise-free expectation values computed from noisy samples. Nat Comput Sci 4:865\u2013875","journal-title":"Nat Comput Sci"},{"key":"8386_CR19","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1038\/s41586-022-05434-1","volume":"614","author":"R Acharya","year":"2023","unstructured":"Acharya R et al (2023) Suppressing quantum errors by scaling a surface code logical qubit. Nature 614:676\u2013681","journal-title":"Nature"},{"key":"8386_CR20","unstructured":"Zhang V, Nation PD (2023) Characterizing quantum processors using discrete time crystals. arXiv:2301.07625"},{"key":"8386_CR21","doi-asserted-by":"crossref","unstructured":"Miessen A, Egger DJ, Tavernelli I, Mazzola G (2024) Benchmarking digital quantum simulations and optimization above hundreds of qubits using quantum critical dynamics. arXiv:2404.08053","DOI":"10.1103\/PRXQuantum.5.040320"},{"key":"8386_CR22","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1038\/s41586-023-06096-3","volume":"618","author":"Y Kim","year":"2023","unstructured":"Kim Y, Eddins A, Anand S et al (2023) Evidence for the utility of quantum computing before fault tolerance. Nature 618:500\u2013505","journal-title":"Nature"},{"key":"8386_CR23","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1038\/s41586-023-05782-6","volume":"616","author":"VV Sivak","year":"2023","unstructured":"Sivak VV et al (2023) Real-time quantum error correction beyond break-even. Nature 616:50\u201355","journal-title":"Nature"},{"key":"8386_CR24","unstructured":"Acharya R (2024) Quantum error correction below the surface code threshold. arXiv:2408.13687"},{"key":"8386_CR25","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1140\/epjqt\/s40507-024-00248-8","volume":"11","author":"M AbuGhanem","year":"2024","unstructured":"AbuGhanem M, Eleuch H (2024) Full quantum tomography study of Google\u2019s Sycamore gate on IBM\u2019s quantum computers. EPJ Quantum Technol 11:36","journal-title":"EPJ Quantum Technol"},{"key":"8386_CR26","first-page":"33","volume":"6","author":"M AbuGhanem","year":"2023","unstructured":"AbuGhanem M (2023) Experimental characterization of Google\u2019s Sycamore quantum AI on IBM\u2019s quantum computers. Artif Intell e J 6:33","journal-title":"Artif Intell e J"},{"key":"8386_CR27","doi-asserted-by":"publisher","first-page":"034","DOI":"10.1103\/PhysRevApplied.15.034080","volume":"15","author":"N Wittler","year":"2021","unstructured":"Wittler N, Roy F, Pack K et al (2021) Integrated tool set for control, calibration, and characterization of quantum devices applied to superconducting qubits. Phys Rev Appl 15:034","journal-title":"Phys Rev Appl"},{"key":"8386_CR28","doi-asserted-by":"crossref","unstructured":"Gupta RS, Sundaresan N, Alexander T et al (2023) Encoding a magic state with beyond break-even fidelity. arXiv:2305.13581","DOI":"10.21203\/rs.3.rs-3025370\/v1"},{"key":"8386_CR29","doi-asserted-by":"crossref","unstructured":"Majumdar R, Rivero P, Metz F, Hasan A, Wang DS (2023) Best practices for quantum error mitigation with digital zero-noise extrapolation. arXiv:2307.05203","DOI":"10.1109\/QCE57702.2023.00102"},{"key":"8386_CR30","doi-asserted-by":"publisher","first-page":"19923","DOI":"10.1007\/s13369-025-10391-8","volume":"50","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem M (2025) Full quantum process tomography of a universal entangling gate on an IBM\u2019s quantum computer. Arab J Sci Eng 50:19923\u201319937","journal-title":"Arab J Sci Eng"},{"key":"8386_CR31","doi-asserted-by":"crossref","unstructured":"Seif A, Liao H, Tripathi V, (2024) Suppressing correlated noise in quantum computers via context-aware compiling. et al (2024) ACM\/IEEE 51st Annual International Symposium on Computer Architecture (ISCA). Buenos Aires, Argentina, pp 310\u2013324","DOI":"10.1109\/ISCA59077.2024.00031"},{"key":"8386_CR32","doi-asserted-by":"crossref","unstructured":"B\u00e4umer E, Tripathi V, Wang DS (2023) Efficient long-range entanglement using dynamic circuits. arXiv:2308.13065","DOI":"10.1103\/PRXQuantum.5.030339"},{"key":"8386_CR33","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.5.020315","volume":"5","author":"RC Farrell","year":"2024","unstructured":"Farrell RC, Illa M, Ciavarella AN, Savage M (2024) Scalable circuits for preparing ground states on digital quantum computers: the Schwinger model vacuum on 100 qubits. PRX Quantum 5:020315","journal-title":"PRX Quantum"},{"key":"8386_CR34","unstructured":"Yasuda T, Suzuki Y, Kubota T (2023) Quantum reservoir computing with repeated measurements on superconducting devices. arXiv:2310.06706"},{"issue":"1","key":"8386_CR35","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.5.013183","volume":"5","author":"H Yu","year":"2023","unstructured":"Yu H, Zhao Y, Wei T-C et al (2023) Simulating large-size quantum spin chains on cloud-based superconducting quantum computers. Phys Rev Research 5(1):013183","journal-title":"Phys Rev Research"},{"key":"8386_CR36","unstructured":"Biswas H (2025) Comparing a few qubit systems for superconducting hardware compatibility and circuit design sensitivity in Qiskit. arXiv:2506.14075"},{"key":"8386_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2025.103431","volume":"165","author":"J Rauch","year":"2025","unstructured":"Rauch J, Rontani D, Vialle S (2025) Data clustering on hybrid classical-quantum NISQ architecture with generative-based variational and parallel algorithms. J Syst Archit 165:103431","journal-title":"J Syst Archit"},{"key":"8386_CR38","doi-asserted-by":"publisher","first-page":"2400661","DOI":"10.1002\/qute.202400661","volume":"8","author":"T Rybotycki","year":"2025","unstructured":"Rybotycki T, Bia\u0142ecki T, Batle J, Bednorz A (2025) Violation of no-signaling on a public quantum computer. Adv Quantum Technol 8:2400661","journal-title":"Adv Quantum Technol"},{"key":"8386_CR39","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1140\/epjqt\/s40507-024-00273-7","volume":"11","author":"J Batle","year":"2024","unstructured":"Batle J, Bia\u0142ecki T, Rybotycki T, Tworzyd\u0142o J, Bednorz A (2024) Quantum null-hypothesis device-independent Schmidt number witness. EPJ Quantum Technol 11:62","journal-title":"EPJ Quantum Technol"},{"key":"8386_CR40","unstructured":"IBM Quantum Computing. https:\/\/www.ibm.com\/quantum Accessed 2025"},{"key":"8386_CR41","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1038\/s41534-018-0095-x","volume":"4","author":"Y Wang","year":"2018","unstructured":"Wang Y, Li Y, Yin Z, Zeng B (2018) 16-qubit IBM universal quantum computer can be fully entangled. Npj Quantum Inf 4:46","journal-title":"Npj Quantum Inf"},{"key":"8386_CR42","unstructured":"AbuGhanem M (2019) Properties of some quantum computing models. Master\u2019s Thesis, Faculty of Science, Ain Shams University"},{"key":"8386_CR43","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1038\/s42254-021-00348-9","volume":"3","author":"M Cerezo","year":"2021","unstructured":"Cerezo M et al (2021) Variational quantum algorithms Nat Rev Phys 3:625\u2013644","journal-title":"Variational quantum algorithms Nat Rev Phys"},{"key":"8386_CR44","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1140\/epjqt\/s40507-025-00405-7","volume":"12","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem M (2025) Superconducting quantum computers: who is leading the future? EPJ Quantum Technol 12:102","journal-title":"EPJ Quantum Technol"},{"key":"8386_CR45","doi-asserted-by":"publisher","DOI":"10.1063\/5.0082975","volume":"132","author":"S Bravyi","year":"2022","unstructured":"Bravyi S, Dial O, Gambetta JM, Gil D, Nazario Z (2022) The future of quantum computing with superconducting qubits. J Appl Phys 132:160902","journal-title":"J Appl Phys"},{"key":"8386_CR46","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1038\/s41586-024-08178-2","volume":"636","author":"A Carrera Vazquez","year":"2024","unstructured":"Carrera Vazquez A, Tornow C, Rist\u00e8 D, Woerner S, Takita M, Egger DJ (2024) Combining quantum processors with real-time classical communication. Nature 636:75\u201379","journal-title":"Nature"},{"key":"8386_CR47","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1038\/s41567-022-01914-3","volume":"19","author":"Y Kim","year":"2023","unstructured":"Kim Y, Wood CJ, Yoder TJ et al (2023) Scalable error mitigation for noisy quantum circuits produces competitive expectation values. Nat Phys 19:752\u2013759","journal-title":"Nat Phys"},{"key":"8386_CR48","doi-asserted-by":"crossref","unstructured":"Herbert S (2020) On the depth overhead incurred when running quantum algorithms on near-term quantum computers with limited qubit connectivity. arXiv:1805.12570v5","DOI":"10.26421\/QIC20.9-10-5"},{"key":"8386_CR49","unstructured":"AbuGhanem M (2025) Practical fidelity limits of Toffoli gates in superconducting quantum processors. arXiv:2509.05395"},{"key":"8386_CR50","doi-asserted-by":"crossref","unstructured":"Zindorf B, Bose S (2024) Efficient implementation of multi-controlled quantum gates. arXiv:2404.02279","DOI":"10.1103\/8blx-nfcr"},{"key":"8386_CR51","doi-asserted-by":"crossref","unstructured":"Kaneda T, Fujii K, Ueda H (2025) Large-scale quantum device benchmarking via LXEB with particle-number-conserving random quantum circuits. arXiv:2505.10820","DOI":"10.1103\/ssrm-kddv"},{"key":"8386_CR52","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.100.032328","volume":"100","author":"AW Cross","year":"2019","unstructured":"Cross AW, Bishop LS, Sheldon S, Nation PD, Gambetta JM (2019) Validating quantum computers using randomized model circuits. Phys Rev A 100:032328","journal-title":"Phys Rev A"},{"key":"8386_CR53","unstructured":"Wack A, Paik H, Javadi-Abhari A (2021) Quality, speed, and scale: three key attributes to measure the performance of near-term quantum computers. arXiv:2110.14108"},{"key":"8386_CR54","doi-asserted-by":"crossref","unstructured":"Shor PW (1996) Fault-tolerant quantum computation. Proceedings of the 37th Annual Symposium on Foundations of Computer Science. IEEE, Burlington, VT, USA, pp 56\u201365","DOI":"10.1109\/SFCS.1996.548464"},{"key":"8386_CR55","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1038\/s41586-024-07107-7","volume":"627","author":"S Bravyi","year":"2024","unstructured":"Bravyi S, Cross AW, Gambetta JM, Maslov D, Rall P, Yoder TJ (2024) High-threshold and low-overhead fault-tolerant quantum memory. Nature 627:778\u2013782","journal-title":"Nature"},{"key":"8386_CR56","doi-asserted-by":"publisher","first-page":"4015","DOI":"10.1038\/ncomms5015","volume":"5","author":"JM Chow","year":"2014","unstructured":"Chow JM, Gambetta JM, Magesan E et al (2014) Implementing a strand of a scalable fault-tolerant quantum computing fabric. Nat Commun 5:4015","journal-title":"Nat Commun"},{"key":"8386_CR57","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.042319","volume":"76","author":"J Koch","year":"2007","unstructured":"Koch J, Yu TM, Gambetta J, Houck AA, Schuster DI, Majer J, Blais A, Devoret MH, Girvin SM, Schoelkopf RJ (2007) Charge-insensitive qubit design derived from the Cooper pair box. Phys Rev A 76:042319","journal-title":"Phys Rev A"},{"key":"8386_CR58","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1140\/epjqt\/s40507-025-00351-4","volume":"12","author":"M De Michielis","year":"2025","unstructured":"De Michielis M, Ferraro E (2025) Energy and power scaling in quantum computers based on rotated surface codes with silicon flip-flop qubits. EPJ Quantum Technol 12:64","journal-title":"EPJ Quantum Technol"},{"key":"8386_CR59","doi-asserted-by":"publisher","first-page":"060302(R)","DOI":"10.1103\/PhysRevA.93.060302","volume":"93","author":"S Sheldon","year":"2016","unstructured":"Sheldon S, Magesan E, Chow JM, Gambetta J (2016) Procedure for systematically tuning up cross-talk in the cross-resonance gate. Phys Rev A 93:060302(R)","journal-title":"Phys Rev A"},{"key":"8386_CR60","doi-asserted-by":"crossref","unstructured":"(2022) Scalable manufacturing processes for quantum computing. Nat Electron 5:201\u2013202","DOI":"10.1038\/s41928-022-00738-6"},{"key":"8386_CR61","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3505636","volume":"3","author":"A Cross","year":"2022","unstructured":"Cross A, Javadi-Abhari A, Alexander N et al (2022) OpenQASM 3: a broader and deeper quantum assembly language. ACM Trans Quantum Comput 3:1\u201350","journal-title":"ACM Trans Quantum Comput"},{"key":"8386_CR62","unstructured":"Javadi-Abhari A, Treinish M, Krsulich K (2024) Quantum computing with Qiskit. arXiv:2405.08810"},{"key":"8386_CR63","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s40509-025-00369-4","volume":"12","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem M (2025) Hardware-aware Toffoli gate decomposition via echoed cross-resonance gates. Quantum Stud Math Found 12:24","journal-title":"Quantum Stud Math Found"},{"key":"8386_CR64","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.180504","volume":"106","author":"E Magesan","year":"2011","unstructured":"Magesan E, Gambetta JM, Emerson J (2011) Scalable and robust randomized benchmarking of quantum processes. Phys Rev Lett 106:180504","journal-title":"Phys Rev Lett"},{"key":"8386_CR65","unstructured":"Wang C, Zhou P, Zhuang X-N (2025) Quantum state preparation by improved MPS method. arXiv:2508.12821"},{"key":"8386_CR66","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.119.180509","volume":"119","author":"K Temme","year":"2017","unstructured":"Temme K, Bravyi S, Gambetta JM (2017) Error mitigation for short-depth quantum circuits. Phys Rev Lett 119:180509","journal-title":"Phys Rev Lett"},{"key":"8386_CR67","volume":"7","author":"Y Li","year":"2017","unstructured":"Li Y, Benjamin SC (2017) Efficient variational quantum simulator incorporating active error minimization. Phys Rev X 7:021050","journal-title":"Phys Rev X"},{"key":"8386_CR68","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1038\/s41586-019-1040-7","volume":"567","author":"A Kandala","year":"2019","unstructured":"Kandala A et al (2019) Error mitigation extends the computational reach of a noisy quantum processor. Nature 567:491\u2013495","journal-title":"Nature"},{"key":"8386_CR69","volume":"8","author":"S Endo","year":"2018","unstructured":"Endo S, Benjamin SC, Li Y (2018) Practical quantum error mitigation for near-future applications. Phys Rev X 8:031027","journal-title":"Phys Rev X"},{"key":"8386_CR70","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1038\/s41567-023-02042-2","volume":"19","author":"E van den Berg","year":"2023","unstructured":"van den Berg E, Minev ZK, Kandala A et al (2023) Probabilistic error cancellation with sparse Pauli-Lindblad models on noisy quantum processors. Nat Phys 19:1116\u20131121","journal-title":"Nat Phys"},{"key":"8386_CR71","volume":"10","author":"C Chamberland","year":"2020","unstructured":"Chamberland C, Zhu G, Yoder TJ, Hertzberg JB, Cross AW (2020) Topological and subsystem codes on low-degree graphs with flag qubits. Phys Rev X 10:011022","journal-title":"Phys Rev X"},{"key":"8386_CR72","unstructured":"Sayapin Z, Rabinovich D, Korolev N, Lakhmanskiy K (2025) Zero-noise extrapolation via cyclic permutations of quantum circuit layouts. arXiv:2511.02901"},{"key":"8386_CR73","unstructured":"Martin JF, Cocco G, Fonollosa J (2026) Quantum error mitigation at the pre-processing stage. arXiv:2602.05916"},{"key":"8386_CR74","doi-asserted-by":"publisher","DOI":"10.1103\/PRXQuantum.2.040101","volume":"2","author":"NP Breuckmann","year":"2021","unstructured":"Breuckmann NP, Eberhardt JN (2021) Quantum low-density parity-check codes. PRX Quantum 2:040101","journal-title":"PRX Quantum"},{"key":"8386_CR75","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1098\/rspa.1996.0136","volume":"452","author":"A Steane","year":"1996","unstructured":"Steane A (1996) Multiple-particle interference and quantum error correction. Proc R Soc London A Math Phys Eng Sci 452:2551\u20132577","journal-title":"Proc R Soc London A Math Phys Eng Sci"},{"key":"8386_CR76","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank AR, Shor PW (1996) Good quantum error-correcting codes exist. Phys Rev A 54:1098","journal-title":"Phys Rev A"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08386-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08386-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08386-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T15:03:00Z","timestamp":1780671780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08386-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":76,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["8386"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08386-9","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]},"assertion":[{"value":"10 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval and consent to participate"}},{"value":"All authors have approved the publication. This research did not involve any human, animal, or other participants.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no Conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"422"}}