{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T09:47:23Z","timestamp":1790761643354,"version":"4.1.0"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T00:00:00Z","timestamp":1716768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and\/or are limited to very small sizes of the problem and thus have no practical usage. In this regard, our previous work (Robson in 2022 IEEE International Conference on Quantum Computing and Engineering (QCE), 2022) showed a proof-of-concept demonstration in advancing quantum Poisson solver algorithm and validated preliminary results for a simple case of <jats:inline-formula><jats:alternatives><jats:tex-math>$$3\\times 3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>3<\/mml:mn>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> problem. In this work, we delve into comprehensive research details, presenting the results on up to <jats:inline-formula><jats:alternatives><jats:tex-math>$$15\\times 15$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mn>15<\/mml:mn>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:mn>15<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> problems that include step-by-step improvements in Poisson equation solutions, scaling performance, and experimental exploration. In particular, we demonstrate the implementation of eigenvalue amplification by a factor of up to <jats:inline-formula><jats:alternatives><jats:tex-math>$$2^8$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mn>8<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, achieving a significant improvement in the accuracy of our quantum Poisson solver and comparing that to the exact solution. Additionally, we present success probability results, highlighting the reliability of our quantum Poisson solver. Moreover, we explore the scaling performance of our algorithm against the circuit depth and width, demonstrating how our approach scales with larger problem sizes and thus further solidifies the practicality of easy adaptation of this algorithm in real-world applications. We also discuss a multilevel strategy for how this algorithm might be further improved to explore much larger problems with greater performance. Finally, through our experiments on the IBM quantum hardware, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the <jats:italic>CNOT<\/jats:italic> gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.\n<\/jats:p>","DOI":"10.1007\/s11128-024-04420-y","type":"journal-article","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T06:01:47Z","timestamp":1716789707000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing scalability and accuracy of quantum poisson solver"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5328-3513","authenticated-orcid":false,"given":"Kamal K.","family":"Saha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Robson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Connor","family":"Howington","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6923-6455","authenticated-orcid":false,"given":"In-Saeng","family":"Suh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhimin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jaroslaw","family":"Nabrzyski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,5,27]]},"reference":[{"key":"4420_CR1","doi-asserted-by":"publisher","unstructured":"Robson, W., Saha, K.K., Howington, C., Suh, I.-S., Nabrzyski, J.: Advanced quantum Poisson solver in the NISQ era. In: 2022 IEEE International Conference on Quantum Computing and Engineering (QCE) , 741 (2022), https:\/\/doi.org\/10.1109\/QCE53715.2022.00103","DOI":"10.1109\/QCE53715.2022.00103"},{"key":"4420_CR2","unstructured":"Poisson equation, numerical methods; encyclopedia of mathematics.,https:\/\/encyclopediaofmath.org\/index.php?title=Poisson_equation,_numerical_methods &oldid=48217"},{"key":"4420_CR3","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Int. J. Theor. Phys. 21, 467 (1982). https:\/\/doi.org\/10.1007\/BF02650179","journal-title":"Int. J. Theor. Phys."},{"key":"4420_CR4","unstructured":"Leyton, S.K., Osborne, T.J.: A quantum algorithm to solve nonlinear differential equations (2008) arXiv:0812.4423"},{"key":"4420_CR5","doi-asserted-by":"publisher","first-page":"105301","DOI":"10.1088\/1751-8113\/47\/10\/105301","volume":"47","author":"DW Berry","year":"2014","unstructured":"Berry, D.W.: High-order quantum algorithm for solving linear differential equations. J. Phys. A: Math. Theor. 47, 105301 (2014). https:\/\/doi.org\/10.1088\/1751-8113\/47\/10\/105301","journal-title":"J. Phys. A: Math. Theor."},{"key":"4420_CR6","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.1007\/s00220-017-3002-y","volume":"356","author":"DW Berry","year":"2017","unstructured":"Berry, D.W., Childs, A.M., Ostrander, A., Wang, G.: Quantum algorithm for linear differential equations with exponentially improved dependence on precision. Commun. Math. Phys. 356, 1057 (2017). https:\/\/doi.org\/10.1007\/s00220-017-3002-y","journal-title":"Commun. Math. Phys."},{"key":"4420_CR7","doi-asserted-by":"publisher","first-page":"1427","DOI":"10.1007\/s00220-020-03699-z","volume":"375","author":"AM Childs","year":"2020","unstructured":"Childs, A.M., Liu, J.-P.: Quantum spectral methods for differential equations. Commun. Math. Phys. 375, 1427 (2020). https:\/\/doi.org\/10.1007\/s00220-020-03699-z","journal-title":"Commun. Math. Phys."},{"key":"4420_CR8","doi-asserted-by":"publisher","first-page":"574","DOI":"10.22331\/q-2021-11-10-574","volume":"5","author":"AM Childs","year":"2021","unstructured":"Childs, A.M., Liu, J.-P., Ostrander, A.: High-precision quantum algorithms for partial differential equations. Quantum 5, 574 (2021). https:\/\/doi.org\/10.22331\/q-2021-11-10-574","journal-title":"Quantum"},{"key":"4420_CR9","doi-asserted-by":"publisher","first-page":"012323","DOI":"10.1103\/PhysRevA.99.012323","volume":"99","author":"PCS Costa","year":"2019","unstructured":"Costa, P.C.S., Jordan, S., Ostrander, A.: Quantum algorithm for simulating the wave equation. Phys. Rev. A 99, 012323 (2019). https:\/\/doi.org\/10.1103\/PhysRevA.99.012323","journal-title":"Phys. Rev. A"},{"key":"4420_CR10","doi-asserted-by":"publisher","first-page":"032306","DOI":"10.1103\/PhysRevA.100.032306","volume":"100","author":"JM Arrazola","year":"2019","unstructured":"Arrazola, J.M., Kalajdzievski, T., Weedbrook, C., Lloyd, S.: Quantum algorithm for nonhomogeneous linear partial differential equations. Phys. Rev. A 100, 032306 (2019). https:\/\/doi.org\/10.1103\/PhysRevA.100.032306","journal-title":"Phys. Rev. A"},{"key":"4420_CR11","unstructured":"Dervovic, D., Herbster, M., Mountney, P., Severini, S., Usher,N., Wossnig, L.: Quantum linear systems algorithms: a primer (2018) arXiv:1802.08227"},{"key":"4420_CR12","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009). https:\/\/doi.org\/10.1103\/PhysRevLett.103.150502","journal-title":"Phys. Rev. Lett."},{"key":"4420_CR13","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1080\/00268976.2012.668289","volume":"110","author":"Y Cao","year":"2012","unstructured":"Cao, Y., Daskin, A., Frankel, S., Kais, S.: Quantum circuit design for solving linear systems of equations. Mol. Phys. 110, 1675 (2012). https:\/\/doi.org\/10.1080\/00268976.2012.668289","journal-title":"Mol. Phys."},{"key":"4420_CR14","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1137\/16M1087072","volume":"46","author":"AM Childs","year":"2017","unstructured":"Childs, A.M., Kothari, R., Somma, R.D.: Quantum algorithm for systems of linear equations with exponentially improved dependence on precision. SIAM J. Comput. 46, 920 (2017). https:\/\/doi.org\/10.1137\/16M1087072","journal-title":"SIAM J. Comput."},{"key":"4420_CR15","doi-asserted-by":"publisher","unstructured":"Berry, D.W., Childs, A.M., Kothari, R.: Hamiltonian simulation with nearly optimal dependence on all parameters. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (2015) pp. 792\u2013809, https:\/\/doi.org\/10.1109\/FOCS.2015.54","DOI":"10.1109\/FOCS.2015.54"},{"key":"4420_CR16","doi-asserted-by":"publisher","first-page":"022341","DOI":"10.1103\/PhysRevA.99.022341","volume":"99","author":"T Kalajdzievski","year":"2019","unstructured":"Kalajdzievski, T., Arrazola, J.M.: Exact gate decompositions for photonic quantum computing. Phys. Rev. A 99, 022341 (2019). https:\/\/doi.org\/10.1103\/PhysRevA.99.022341","journal-title":"Phys. Rev. A"},{"key":"4420_CR17","doi-asserted-by":"publisher","first-page":"113021","DOI":"10.1088\/1367-2630\/ac325f","volume":"23","author":"H-Y Huang","year":"2021","unstructured":"Huang, H.-Y., Bharti, K., Rebentrost, P.: Near-term quantum algorithms for linear systems of equations with regression loss functions. New J. Phys. 23, 113021 (2021). https:\/\/doi.org\/10.1088\/1367-2630\/ac325f","journal-title":"New J. Phys."},{"key":"4420_CR18","doi-asserted-by":"publisher","first-page":"060504","DOI":"10.1103\/PhysRevLett.122.060504","volume":"122","author":"Y Suba\u015f\u0131","year":"2019","unstructured":"Suba\u015f\u0131, Y., Somma, R.D., Orsucci, D.: Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing. Phys. Rev. Lett. 122, 060504 (2019). https:\/\/doi.org\/10.1103\/PhysRevLett.122.060504","journal-title":"Phys. Rev. Lett."},{"key":"4420_CR19","doi-asserted-by":"publisher","first-page":"022418","DOI":"10.1103\/PhysRevA.104.022418","volume":"104","author":"H-L Liu","year":"2021","unstructured":"Liu, H.-L., Wu, Y.-S., Wan, L.-C., Pan, S.-J., Qin, S.-J., Gao, F., Wen, Q.-Y.: Variational quantum algorithm for the poisson equation. Phys. Rev. A 104, 022418 (2021). https:\/\/doi.org\/10.1103\/PhysRevA.104.022418","journal-title":"Phys. Rev. A"},{"key":"4420_CR20","doi-asserted-by":"publisher","first-page":"052409","DOI":"10.1103\/PhysRevA.104.052409","volume":"104","author":"Y Sato","year":"2021","unstructured":"Sato, Y., Kondo, R., Koide, S., Takamatsu, H., Imoto, N.: Variational quantum algorithm based on the minimum potential energy for solving the Poisson equation. Phys. Rev. A 104, 052409 (2021). https:\/\/doi.org\/10.1103\/PhysRevA.104.052409","journal-title":"Phys. Rev. A"},{"key":"4420_CR21","unstructured":"Saito, Y., Lee, X., Cai, D., Asai, N.: An iterative improvement method for HHL algorithm for solving linear system of equations (2021) arXiv:2108.07744"},{"key":"4420_CR22","doi-asserted-by":"publisher","first-page":"013021","DOI":"10.1088\/1367-2630\/15\/1\/013021","volume":"15","author":"Y Cao","year":"2013","unstructured":"Cao, Y., Papageorgiou, A., Petras, I., Traub, J., Kais, S.: Quantum algorithm and circuit design solving the Poisson equation. New J. Phys. 15, 013021 (2013). https:\/\/doi.org\/10.1088\/1367-2630\/15\/1\/013021","journal-title":"New J. Phys."},{"key":"4420_CR23","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/s11128-020-02669-7","volume":"19","author":"S Wang","year":"2020","unstructured":"Wang, S., Wang, Z., Li, W., Fan, L., Wei, Z., Gu, Y.: Quantum fast Poisson solver: the algorithm and complete and modular circuit design. Quantum Inf. Process. 19, 170 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02669-7","journal-title":"Quantum Inf. Process."},{"key":"4420_CR24","doi-asserted-by":"publisher","first-page":"023023","DOI":"10.1088\/1367-2630\/18\/2\/023023","volume":"18","author":"JR McClean","year":"2016","unstructured":"McClean, J.R., Romero, J., Babbush, R., Aspuru-Guzik, A.: The theory of variational hybrid quantum-classical algorithms. New J. Phys. 18, 023023 (2016)","journal-title":"New J. Phys."},{"key":"4420_CR25","doi-asserted-by":"crossref","unstructured":"Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S.C., Endo, S., Fujii, K., McClean, J.R., Mitarai, K., Yuan, X., Cincio, L., Coles, P.J.: Variational quantum algorithms (2021) arXiv:2012.09265","DOI":"10.1038\/s42254-021-00348-9"},{"key":"4420_CR26","doi-asserted-by":"publisher","first-page":"021067","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys. Rev. X"},{"key":"4420_CR27","unstructured":"Barron, G.S., Wood, C.J.: Measurement error mitigation for variational quantum algorithms (2020) arXiv:2010.08520"},{"key":"4420_CR28","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). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"key":"4420_CR29","unstructured":"Anis, M.S. et al.: Qiskit: An open-source framework for quantum computing (2021), https:\/\/qiskit.org"},{"key":"4420_CR30","unstructured":"IBM Quantum, https:\/\/quantum-computing.ibm.com, 2021"},{"key":"4420_CR31","unstructured":"QRUNES, https:\/\/github.com\/OriginQ\/QRunes"},{"key":"4420_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied Numerical Linear Algebra. Society for Industrial and Applied Mathematics, Philadelphia (1997). https:\/\/doi.org\/10.1137\/1.9781611971446"},{"key":"4420_CR33","unstructured":"Shewchuk, J.R.: An Introduction to the Conjugate Gradient Method Without the Agonizing Pain, Tech. Rep. (USA, 1994), https:\/\/dl.acm.org\/doi\/10.5555\/865018"},{"key":"4420_CR34","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1038\/nphys3272","volume":"11","author":"S Aaronson","year":"2015","unstructured":"Aaronson, S.: New quantum algorithms promise an exponential speed-up for machine learning, clustering and finding patterns in big data, but to achieve a real speed-up, we need to delve into the details. Nat. Phys. 11, 291 (2015). https:\/\/doi.org\/10.1038\/nphys3272","journal-title":"Nat. Phys."},{"key":"4420_CR35","doi-asserted-by":"publisher","first-page":"4564","DOI":"10.1103\/PhysRevA.54.4564","volume":"54","author":"A Luis","year":"1996","unstructured":"Luis, A., Pe\u0159ina, J.: Optimum phase-shift estimation and the quantum description of the phase difference. Phys. Rev. A 54, 4564 (1996). https:\/\/doi.org\/10.1103\/PhysRevA.54.4564","journal-title":"Phys. Rev. A"},{"key":"4420_CR36","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.1126\/science.273.5278.1073","volume":"273","author":"L Lloyd","year":"1996","unstructured":"Lloyd, L.: Universal quantum simulators. Science 273, 1073 (1996)","journal-title":"Science"},{"key":"4420_CR37","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s00220-006-0150-x","volume":"270","author":"DW Berry","year":"2007","unstructured":"Berry, D.W., Ahokas, G., Cleve, R., Sanders, B.C.: Efficient quantum algorithms for simulating sparse hamiltonians. Commun. Math. Phys. 270, 359 (2007). https:\/\/doi.org\/10.1007\/s00220-006-0150-x","journal-title":"Commun. Math. Phys."},{"key":"4420_CR38","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1098\/rspa.1998.0164","volume":"454","author":"R Cleve","year":"1998","unstructured":"Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. A 454, 339 (1998). https:\/\/doi.org\/10.1098\/rspa.1998.0164","journal-title":"Proc. R. Soc. Lond. A"},{"key":"4420_CR39","unstructured":"Wang, S., Wang, Z., Li, W., Fan, L., Cui, G., Wei, Z., Gu, Y.: A quantum Poisson solver implementable on NISQ devices (2020) arXiv:2005.00256"},{"key":"4420_CR40","unstructured":"How to Measure Errors, https:\/\/netlib.org\/lapack\/lug\/node75.html"},{"key":"4420_CR41","unstructured":"Qi, F., Smith, K.N., LeCompte, T., Tzeng, N., Yuan, X., Chong, F.T., Peng, L.: Quantum vulnerability analysis to accurate estimate the quantum algorithm success rate (2022) arXiv:2207.14446"},{"key":"4420_CR42","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1016\/j.laa.2009.10.020","volume":"432","author":"VY Pana","year":"2010","unstructured":"Pana, V.Y., Ivolgin, D., Murphy, B., Rosholt, R.E., Tang, Y., Yan, X.: Additive preconditioning for matrix computations. Linear Algebra Appl. 432, 1070 (2010). https:\/\/doi.org\/10.1016\/j.laa.2009.10.020","journal-title":"Linear Algebra Appl."},{"key":"4420_CR43","doi-asserted-by":"crossref","unstructured":"Li, G., Ding, Y., Xie, Y.: Tackling the qubit mapping problem for NISQ-era quantum devices (2019) arXiv:1809.02573","DOI":"10.1145\/3297858.3304023"},{"key":"4420_CR44","doi-asserted-by":"publisher","first-page":"010309","DOI":"10.1103\/PRXQuantum.3.010309","volume":"3","author":"A Eddins","year":"2022","unstructured":"Eddins, A., Motta, M., Gujarati, T.P., Bravyi, S., Mezzacapo, A., Hadfield, C., Sheldon, S.: Doubling the size of quantum simulators by entanglement forging. PRX Quantum 3, 010309 (2022). https:\/\/doi.org\/10.1103\/PRXQuantum.3.010309","journal-title":"PRX Quantum"},{"key":"4420_CR45","doi-asserted-by":"publisher","first-page":"021043","DOI":"10.1103\/PhysRevX.6.021043","volume":"6","author":"S Bravyi","year":"2016","unstructured":"Bravyi, S., Smith, G., Smolin, J.A.: Trading classical and quantum computational resources. Phys. Rev. X 6, 021043 (2016). https:\/\/doi.org\/10.1103\/PhysRevX.6.021043","journal-title":"Phys. Rev. X"},{"key":"4420_CR46","doi-asserted-by":"publisher","first-page":"150504","DOI":"10.1103\/PhysRevLett.125.150504","volume":"125","author":"T Peng","year":"2020","unstructured":"Peng, T., Harrow, A.W., Ozols, M., Wu, X.: Simulating large quantum circuits on a small quantum computer. Phys. Rev. Lett. 125, 150504 (2020). https:\/\/doi.org\/10.1103\/PhysRevLett.125.150504","journal-title":"Phys. Rev. Lett."},{"key":"4420_CR47","doi-asserted-by":"publisher","unstructured":"Tang, A.W., Tomesh, T., Suchara, M., Larson, J., Martonosi, M.: Cutqc: using small quantum computers for large quantum circuit evaluations. In: Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems , 473 (2021), https:\/\/doi.org\/10.1145\/3445814.3446758","DOI":"10.1145\/3445814.3446758"},{"key":"4420_CR48","doi-asserted-by":"crossref","unstructured":"Bravyi, S., Dial, O., Gambetta, J.\u00a0M., Gil, D., Nazario, Z.: The future of quantum computing with superconducting qubits (2022) arXiv:2209.06841","DOI":"10.1063\/5.0082975"},{"key":"4420_CR49","doi-asserted-by":"crossref","unstructured":"Tham, E., Khait, I., Brodutch, A.: Quantum circuit optimization for multiple QPUS using local structure (2022) arXiv:2206.09938","DOI":"10.1109\/QCE53715.2022.00069"},{"key":"4420_CR50","unstructured":"Piveteau, C., Sutter, D.: Circuit knitting with classical communication (2023) arXiv:2205.00016"},{"key":"4420_CR51","doi-asserted-by":"crossref","unstructured":"Younis, E., Iancu, C.: Quantum circuit optimization and transpilation via parameterized circuit instantiation (2022) arXiv:2206.07885","DOI":"10.1109\/QCE53715.2022.00068"},{"key":"4420_CR52","doi-asserted-by":"publisher","first-page":"1226","DOI":"10.1109\/TCAD.2018.2846658","volume":"38","author":"A Zulehner","year":"2019","unstructured":"Zulehner, A., Paler, A., Wille, R.: An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst. 38, 1226 (2019). https:\/\/doi.org\/10.1109\/TCAD.2018.2846658","journal-title":"IEEE Trans. Comput. Aid. Des. Integr. Circuits Syst."},{"key":"4420_CR53","doi-asserted-by":"crossref","unstructured":"Wille, R., Burgholzer, L., Zulehner, A.: Mapping quantum circuits to ibm qx architectures using the minimal number of swap and h operations (2019) arXiv:1907.02026","DOI":"10.1145\/3316781.3317859"},{"key":"4420_CR54","doi-asserted-by":"crossref","unstructured":"Murali, P., Baker, J.M., Abhari, A.J., Chong, F.T., Martonosi, M.: Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers (2019) arXiv:1901.11054","DOI":"10.1145\/3297858.3304075"},{"key":"4420_CR55","doi-asserted-by":"crossref","unstructured":"Burgholzer, L., Schneider, S., Wille, R.: Limiting the search space in optimal quantum circuit mapping (2022) arXiv:2112.00045","DOI":"10.1109\/ASP-DAC52403.2022.9712555"},{"key":"4420_CR56","doi-asserted-by":"crossref","unstructured":"Corcoles, A.D., Kandala, A., Javadi-Abhari, A., McClure, D.T., Cross, A.W., Temme, K., Nation, P.D., Steffen, M., Gambetta, J.M.: Challenges and opportunities of near-term quantum computing systems (2019) arXiv:1910.02894","DOI":"10.1109\/JPROC.2019.2954005"},{"key":"4420_CR57","unstructured":"Ferris, K.J., Rasmusson, A.J., Bronn, N.T., Lanes, O.: Quantum simulation on noisy superconducting quantum computers (2022) arXiv:2209.02795"},{"key":"4420_CR58","doi-asserted-by":"publisher","first-page":"062404","DOI":"10.1103\/PhysRevA.105.062404","volume":"105","author":"L Funcke","year":"2022","unstructured":"Funcke, L., Hartung, T., Jansen, K., K\u00fchn, S., Stornati, P., Wang, X.: Measurement error mitigation in quantum computers through classical bit-flip correction. Phys. Rev. A 105, 062404 (2022). https:\/\/doi.org\/10.1103\/PhysRevA.105.062404","journal-title":"Phys. Rev. A"},{"key":"4420_CR59","unstructured":"Alexandrou, C., Funcke, L., Hartung, T., Jansen, K., K\u00fchn, S., Polykratis, G., Stornati, P., Wang, X., Weber, T.: Investigating the variance increase of readout error mitigation through classical bit-flip correction on ibm and rigetti quantum computers (2021) arXiv:2111.05026"},{"key":"4420_CR60","doi-asserted-by":"publisher","unstructured":"Acampora, G., Grossi, M., Vitiello, A.: Genetic algorithms for error mitigation in quantum measurement, in 2021 IEEE Congress on Evolutionary Computation (CEC) (2021) pp. 1826\u20131832, https:\/\/doi.org\/10.1109\/CEC45853.2021.9504796","DOI":"10.1109\/CEC45853.2021.9504796"},{"key":"4420_CR61","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.118.150502","volume":"118","author":"FA Calderon-Vargas","year":"2017","unstructured":"Calderon-Vargas, F.A., Kestner, J.P.: Dynamically correcting a $$\\rm CNOT $$ gate for any systematic logical error. Phys. Rev. Lett. 118, 150502 (2017). https:\/\/doi.org\/10.1103\/PhysRevLett.118.150502","journal-title":"Phys. Rev. Lett."},{"key":"4420_CR62","doi-asserted-by":"publisher","first-page":"060501","DOI":"10.1103\/PhysRevLett.109.060501","volume":"109","author":"JM Chow","year":"2012","unstructured":"Chow, J.M., Gambetta, J.M., C\u00f3rcoles, A.D., Merkel, S.T., Smolin, J.A., Rigetti, C., Poletto, S., Keefe, G.A., Rothwell, M.B., Rozen, J.R., Ketchen, M.B., Steffen, M.: Universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits. Phys. Rev. Lett. 109, 060501 (2012). https:\/\/doi.org\/10.1103\/PhysRevLett.109.060501","journal-title":"Phys. Rev. Lett."},{"key":"4420_CR63","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1119\/10.0006204","volume":"89","author":"S Johnstun","year":"2021","unstructured":"Johnstun, S., Huele, J.-F.V.: Understanding and compensating for noise on IBM quantum computers. Am. J. Phys. 89, 935 (2021). https:\/\/doi.org\/10.1119\/10.0006204","journal-title":"Am. J. Phys."},{"key":"4420_CR64","doi-asserted-by":"publisher","first-page":"040324","DOI":"10.1103\/PRXQuantum.2.040324","volume":"2","author":"Y Baum","year":"2021","unstructured":"Baum, Y., Amico, M., Howell, S., Hush, M., Liuzzi, M., Mundada, P., Merkh, T., Carvalho, A.R., Biercuk, M.J.: Experimental deep reinforcement learning for error-robust gate-set design on a superconducting quantum computer. PRX Quantum 2, 040324 (2021). https:\/\/doi.org\/10.1103\/PRXQuantum.2.040324","journal-title":"PRX Quantum"},{"key":"4420_CR65","doi-asserted-by":"publisher","first-page":"262","DOI":"10.4153\/CJM-1995-013-4","volume":"47","author":"JM Borwein","year":"1995","unstructured":"Borwein, J.M., Girgensohn, R.: Addition theorems and binary expansions. Can J. Math. 47, 262 (1995). https:\/\/doi.org\/10.4153\/CJM-1995-013-4","journal-title":"Can J. Math."},{"key":"4420_CR66","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11128-020-02855-7","volume":"19","author":"S Wang","year":"2020","unstructured":"Wang, S., Wang, Z., Li, W., Fan, L., Cui, G., Wei, Z., Gu, Y.: Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method. Quantum Inf. Process. 19, 347 (2020). https:\/\/doi.org\/10.1007\/s11128-020-02855-7","journal-title":"Quantum Inf. Process."},{"key":"4420_CR67","doi-asserted-by":"publisher","first-page":"46","DOI":"10.7763\/IJCTE.2011.V3.281","volume":"3","author":"T Sutikno","year":"2011","unstructured":"Sutikno, T.: An efficient implementation of the non restoring square root algorithm in gate level. Int. J. Comput. Theory Eng. 3, 46 (2011). https:\/\/doi.org\/10.7763\/IJCTE.2011.V3.281","journal-title":"Int. J. Comput. Theory Eng."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-024-04420-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-024-04420-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T11:20:03Z","timestamp":1720005603000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-024-04420-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,27]]},"references-count":67,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2024,6]]}},"alternative-id":["4420"],"URL":"https:\/\/doi.org\/10.1007\/s11128-024-04420-y","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,27]]},"assertion":[{"value":"25 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 May 2024","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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"209"}}