{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:01:30Z","timestamp":1780704090582,"version":"3.54.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:00:00Z","timestamp":1780704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:00:00Z","timestamp":1780704000000},"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":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    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\u2019s correct logical action, producing the target partially entangled state with a subspace confinement probability of\n                    <jats:inline-formula>\n                      <jats:tex-math>$$P_{\\text {succ}}^{\\text {hardware}} \\approx 95.96\\%$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    on real quantum hardware compared to 100% in quantum simulation. Results from QPT experiments show a simulated process fidelity of\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {F}_{\\text {process}}^{\\text {sim}} = 98.23\\%$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    , while the experimental process fidelity on hardware is\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathcal {F}_{\\text {process}}^{\\text {hardware}} = 91.76\\%$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    . 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.\n                  <\/jats:p>","DOI":"10.1038\/s41598-026-56236-8","type":"journal-article","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T22:54:48Z","timestamp":1780700088000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A hardware-efficient Berkeley gate for superconducting quantum processors"],"prefix":"10.1038","volume":"16","author":[{"given":"Muhammad","family":"AbuGhanem","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"56236_CR1","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. Superconducting quantum computers: who is leading the future?. EPJ Quantum Technology 12, 102 (2025).","journal-title":"EPJ Quantum Technology"},{"key":"56236_CR2","doi-asserted-by":"crossref","unstructured":"Nielsen, M. A. & Chuang, I. L. Quantum computation and quantum information (Cambridge University Press, 2011).","DOI":"10.1017\/CBO9780511976667"},{"issue":"9\u201311","key":"56236_CR3","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1002\/1521-3978(200009)48:9\/11<771::AID-PROP771>3.0.CO;2-E","volume":"48","author":"DP DiVincenzo","year":"2000","unstructured":"DiVincenzo, D. P. The physical implementation of quantum computation. Fortschritte der Physik 48(9\u201311), 771\u2013783 (2000).","journal-title":"Fortschritte der Physik"},{"key":"56236_CR4","doi-asserted-by":"publisher","first-page":"433","DOI":"10.22331\/q-2021-04-15-433","volume":"5","author":"Craig Gidney","year":"2021","unstructured":"Gidney, C. & Eker\u00e5, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021).","journal-title":"Quantum"},{"issue":"3","key":"56236_CR5","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/00107514.2019.1667078","volume":"60","author":"Joschka Roffe","year":"2019","unstructured":"Roffe, J. Quantum error correction: an introductory guide. Contemporary Physics 60(3), 226\u2013245 (2019).","journal-title":"Contemporary Physics"},{"key":"56236_CR6","unstructured":"AbuGhanem, M. Google Quantum AI\u2019s quest for error-corrected quantum computers. arXiv 2410.00917 (2024)."},{"key":"56236_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.020502","volume":"93","author":"Jun Zhang","year":"2004","unstructured":"Zhang, J., Vala, J., Sastry, S. & Birgitta Whaley, K. Minimum construction of two-qubit quantum operations. Phys. Rev. Lett. 93, 020502 (2004).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR8","doi-asserted-by":"crossref","unstructured":"Khaneja, N. & Glaser, S. J. Cartan decomposition of $${\\sf SU}(2^n)$$ and control of spin systems. Chem. Phys. 267, 11\u201323 (2001).","DOI":"10.1016\/S0301-0104(01)00318-4"},{"key":"56236_CR9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.67.042313","volume":"67","author":"Jun Zhang","year":"2003","unstructured":"Zhang, Jun, Vala, Jiri, Sastry, Shankar & Birgitta Whaley, K. Geometric theory of nonlocal two-qubit operations. Phys. Rev. A 67, 042313 (2003).","journal-title":"Phys. Rev. A"},{"key":"56236_CR10","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. Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018).","journal-title":"Quantum"},{"key":"56236_CR11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.042319","volume":"76","author":"J Koch","year":"2007","unstructured":"Koch, J. et al.\u00a0 Charge-insensitive qubit design derived from the Cooper pair box. Physical Review A 76, 042319 (2007).","journal-title":"Physical Review A"},{"key":"56236_CR12","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F. et al. Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510 (2019).","journal-title":"Nature"},{"key":"56236_CR13","doi-asserted-by":"crossref","unstructured":"Kim, Y. et al. Evidence for the utility of quantum computing before fault tolerance. Nature 618, 500\u2013505 (2023).","DOI":"10.1038\/s41586-023-06096-3"},{"key":"56236_CR14","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11227-025-07047-7","volume":"81","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem, M. IBM quantum computers: evolution, performance, and future directions. Journal of Supercomputing 81, 687 (2025).","journal-title":"Journal of Supercomputing"},{"issue":"8","key":"56236_CR15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.107.080502","volume":"107","author":"Jerry M Chow","year":"2011","unstructured":"Chow, Jerry M. et al. Simple all-microwave entangling gate for fixed-frequency superconducting qubits. Phys. Rev. Lett. 107(8), 080502 (2011).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR16","doi-asserted-by":"crossref","unstructured":"AbuGhanem, M. A hardware-efficient M\u00f8lmer-S\u00f8rensen gate for superconducting quantum computers. Quantum. Inf. Process.  25, 149 (2026).","DOI":"10.1007\/s11128-026-05167-4"},{"key":"56236_CR17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.106.180504","volume":"106","author":"E Magesan","year":"2011","unstructured":"Magesan, E., Gambetta, J. M. & Emerson, J. Scalable and robust randomized benchmarking of quantum processes. Phys. Rev. Lett. 106, 180504 (2011).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR18","doi-asserted-by":"publisher","DOI":"10.1080\/09500349708231894","volume":"44","author":"IL Chuang","year":"1997","unstructured":"Chuang, I. L. & Nielsen, M. A. Prescription for experimental determination of the dynamics of a quantum black box. J. Mod. Opt. 44, 2455 (1997).","journal-title":"J. Mod. Opt."},{"key":"56236_CR19","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1103\/PhysRevLett.78.390","volume":"78","author":"JF Poyatos","year":"1997","unstructured":"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).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR20","doi-asserted-by":"crossref","unstructured":"Knee, George C., Bolduc, E., Leach, J. & Gauger, Erik M. Quantum process tomography via completely positive and trace-preserving projection. Phys. Rev. A98, 062336 (2018).","DOI":"10.1103\/PhysRevA.98.062336"},{"key":"56236_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.94.015004","volume":"94","author":"Kishor Bharti","year":"2022","unstructured":"Bharti, K. et al. Noisy intermediate-scale quantum algorithms. Reviews of Modern Physics 94, 015004 (2022).","journal-title":"Reviews of Modern Physics"},{"key":"56236_CR22","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.101.052308","volume":"101","author":"Easwar Magesan","year":"2020","unstructured":"Magesan, E. & Gambetta, Jay M. Effective Hamiltonian models of the cross-resonance gate. Phys. Rev. A 101, 052308 (2020).","journal-title":"Phys. Rev. A"},{"key":"56236_CR23","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s40509-025-00369-4","volume":"12","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem, M. Hardware-aware Toffoli gate decomposition via echoed cross-resonance gates. Quantum Stud.: Math. Found. 12, 24 (2025).","journal-title":"Quantum Stud.: Math. Found."},{"key":"56236_CR24","doi-asserted-by":"publisher","first-page":"eaao3603","DOI":"10.1126\/sciadv.aao3603","volume":"4","author":"M Reagor","year":"2018","unstructured":"Reagor, M. et al. Demonstration of universal parametric entangling gates on a multi-qubit lattice. Science Advances 4, eaao3603 (2018).","journal-title":"Science Advances"},{"key":"56236_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.125.120504","volume":"125","author":"B Foxen","year":"2020","unstructured":"Foxen, B. et al. Demonstrating a continuous set of two-qubit gates for near-term quantum algorithms. Phys. Rev. Lett. 125, 120504 (2020).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.95.035004","volume":"95","author":"A Szilva","year":"2023","unstructured":"Szilva, A. et al. Quantitative theory of magnetic interactions in solids. Rev. Mod. Phys. 95, 035004 (2023).","journal-title":"Rev. Mod. Phys."},{"issue":"12","key":"56236_CR27","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.104.126401","volume":"104","author":"F Baruffa","year":"2010","unstructured":"Baruffa, F., Stano, P. & Fabian, J. Theory of anisotropic exchange in laterally coupled quantum dots.\u00a0Phys. Rev. Lett.  104(12), 126401 (2010).","journal-title":"Physical Review Letters"},{"key":"56236_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.63.062309","volume":"63","author":"B Kraus","year":"2001","unstructured":"Kraus, B. & Cirac, J. I. Optimal creation of entanglement using a two-qubit gate. Phys. Rev. A 63, 062309 (2001).","journal-title":"Phys. Rev. A"},{"key":"56236_CR29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.69.010301","volume":"69","author":"G Vidal","year":"2004","unstructured":"Vidal, G. & Dawson, C. M. Universal quantum circuit for two-qubit transformations with three CNOT gates. Phys. Rev. A 69, 010301(R) (2004).","journal-title":"Phys. Rev. A"},{"issue":"1","key":"56236_CR30","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. Full quantum tomography study of Google\u2019s Sycamore gate on IBM\u2019s quantum computers. EPJ Quantum Technology 11(1), 36 (2024).","journal-title":"EPJ Quantum Technology"},{"key":"56236_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/s13369-025-10391-8","author":"M AbuGhanem","year":"2025","unstructured":"AbuGhanem, M. Full quantum process tomography of a universal entangling gate on an IBM\u2019s quantum computer. Arab. J. Sci. Eng.\u00a0 50, 19923\u201319937 (2025).","journal-title":"Arab. J. Sci. Eng."},{"key":"56236_CR32","doi-asserted-by":"publisher","first-page":"1888","DOI":"10.1103\/PhysRevA.60.1888","volume":"60","author":"M Horodecki","year":"1999","unstructured":"Horodecki, M., Horodecki, P. & Horodecki, R. General teleportation channel, singlet fraction, and quasidistillation. Phys. Rev. A 60, 1888 (1999).","journal-title":"Phys. Rev. A"},{"key":"56236_CR33","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0375-9601(02)01272-0","volume":"303","author":"MA Nielsen","year":"2002","unstructured":"Nielsen, M. A. A simple formula for the average gate fidelity of a quantum dynamical operation. Physics Letters A 303, 249 (2002).","journal-title":"Physics Letters A"},{"key":"56236_CR34","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.109.080505","volume":"109","author":"E Magesan","year":"2012","unstructured":"Magesan, E. et al. Efficient measurement of quantum gate error by interleaved randomized benchmarking. Phys. Rev. Lett. 109, 080505 (2012).","journal-title":"Phys. Rev. Lett."},{"key":"56236_CR35","doi-asserted-by":"publisher","first-page":"5347","DOI":"10.1038\/s41467-019-13068-7","volume":"10","author":"A Erhard","year":"2019","unstructured":"Erhard, A. et al. Characterizing large-scale quantum computers via cycle benchmarking. Nat Commun 10, 5347 (2019).","journal-title":"Nat Commun"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-56236-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-56236-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-56236-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:12:51Z","timestamp":1780701171000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-026-56236-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,6]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["56236"],"URL":"https:\/\/doi.org\/10.1038\/s41598-026-56236-8","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,6]]},"assertion":[{"value":"11 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 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":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"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"}}],"article-number":"17530"}}