{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T02:36:29Z","timestamp":1775615789833,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T00:00:00Z","timestamp":1651363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11128-022-03523-8","type":"journal-article","created":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T04:02:51Z","timestamp":1652760171000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["A novel fault-tolerant quantum divider and its simulation"],"prefix":"10.1007","volume":"21","author":[{"given":"Suzhen","family":"Yuan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengwei","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuchan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,17]]},"reference":[{"issue":"2","key":"3523_CR1","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"WS Peter","year":"1999","unstructured":"Peter, W.S.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"issue":"2","key":"3523_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"KG Lov","year":"1997","unstructured":"Lov, K.G.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"3523_CR3","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"B Paul","year":"1980","unstructured":"Paul, B.: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J. Stat. Phys. 22(5), 563\u2013591 (1980)","journal-title":"J. Stat. Phys."},{"issue":"1818","key":"3523_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D David","year":"1985","unstructured":"David, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A Math. Phys. Sci. 400(1818), 97\u2013117 (1985)","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"key":"3523_CR5","unstructured":"Sean, H.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. In: Proc. Thiry Fourth Annual ACM Sympos. Theory Comput., pp. 653\u2013658 (2002)"},{"key":"3523_CR6","unstructured":"Wim, V.D., Sean, H.: Efficient quantum algorithms for shifted quadratic character problems, arXiv preprint arXiv:quant-ph\/0011067 (2000)"},{"issue":"3","key":"3523_CR7","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"VD Wim","year":"2006","unstructured":"Wim, V.D., Sean, H., Lawrence, I.: Quantum algorithms for some hidden shift problems. SIAM J. Comput. 36(3), 763\u2013778 (2006)","journal-title":"SIAM J. Comput."},{"key":"3523_CR8","doi-asserted-by":"crossref","unstructured":"Guodong, S., Shenghui, S., Maozhi, S.: Quantum algorithm for polynomial root finding problem. In: 2014 Tenth International Conference on Computational Intelligence and Security, pp. 469\u2013473 (2014)","DOI":"10.1109\/CIS.2014.40"},{"issue":"15","key":"3523_CR9","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"W Aram","year":"2009","unstructured":"Aram, W., Avinatan, H., Seth, L.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3523_CR10","unstructured":"Glenn, B., Chris, L., Charles, C.: Quantum image processing (quip). In: 32nd Applied Imagery Pattern Recognition Workshop, 2003. Proceedings, pp. 39\u201344 (2003)"},{"key":"3523_CR11","doi-asserted-by":"crossref","unstructured":"Wim, V.D., Igor, E.S.: Classical and quantum algorithms for exponential congruences. In: Workshop on Quantum Computation, Communication, and Cryptography, pp. 1\u201310 (2008)","DOI":"10.1007\/978-3-540-89304-2_1"},{"key":"3523_CR12","doi-asserted-by":"crossref","unstructured":"Mathias, S., Martin, R., Nathan, W., Giovanni, D.M.: Design automation and design space exploration for quantum computers. In: Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 470\u2013475 (2017)","DOI":"10.23919\/DATE.2017.7927035"},{"key":"3523_CR13","unstructured":"Mihir, K.B., Stuart, H., Anargyros, P., Iasonas, P.: Quantum algorithms and circuits for scientific computing. arXiv preprint arXiv:1511.08253 (2015)"},{"issue":"5","key":"3523_CR14","doi-asserted-by":"publisher","first-page":"052316","DOI":"10.1103\/PhysRevA.62.052316","volume":"62","author":"Z Xinlan","year":"2000","unstructured":"Xinlan, Z., Debbie, W.L., Isaac, L.C.: Methodology for quantum logic gate construction. Phys. Rev. A 62(5), 052316 (2000)","journal-title":"Phys. Rev. A"},{"issue":"10","key":"3523_CR15","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"A Matthew","year":"2014","unstructured":"Matthew, A., Dmitri, M., Michele, M.: Polynomial-time $$T$$-depth optimization of Clifford+ $$T$$ circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"2","key":"3523_CR16","doi-asserted-by":"publisher","first-page":"025003","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"P Alexandru","year":"2017","unstructured":"Alexandru, P., Ilia, P., Kae, N., Simon, J.D.: Fault-tolerant, high-level quantum circuits: form, compilation and description. Quant. Sci. Technol. 2(2), 025003 (2017)","journal-title":"Quant. Sci. Technol."},{"key":"3523_CR17","doi-asserted-by":"crossref","unstructured":"Harry, B., Richard, C., Monique, L., Noah, L., Alexander, S., Falk, U.: New limits on fault-tolerant quantum computation. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u201906), pp. 411\u2013419 (2016)","DOI":"10.1109\/FOCS.2006.50"},{"key":"3523_CR18","unstructured":"David, G., Vadym, K., Michele, M., Vincent, R.: An algorithm for the $$T$$-count. arXiv preprint arXiv:1308.4134 (2013)"},{"issue":"3","key":"3523_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00084-3","volume":"75","author":"PB Oscar","year":"2000","unstructured":"Oscar, P.B., Tal, N., Matthew, P., Vwani, R., Farrokh, V.: A new universal and fault-tolerant quantum basis. Inf. Process. Lett. 75(3), 101\u2013107 (2000)","journal-title":"Inf. Process. Lett."},{"key":"3523_CR20","doi-asserted-by":"crossref","unstructured":"Ismail, G., Lamjed, T., Bouraoui, O.: Division circuit using reversible logic gates. In: 2018 International Conference on Advanced Systems and Electric Technologies (IC_ASET), pp. 60\u201365 (2018)","DOI":"10.1109\/ASET.2018.8379835"},{"key":"3523_CR21","doi-asserted-by":"crossref","unstructured":"Noor, M.N., Adnan, H., Mutasimul, H., Lafifa, J., Hafiz, M.H.B.: Novel reversible division hardware. In: 2009 52nd IEEE International Midwest Symposium on Circuits and Systems, pp. 1134\u20131138 (2009)","DOI":"10.1109\/MWSCAS.2009.5235968"},{"issue":"24","key":"3523_CR22","first-page":"5671","volume":"6","author":"D Faraz","year":"2011","unstructured":"Faraz, D., Majid, H.: A novel nanometric fault tolerant reversible divider. Int. J. Phys. Sci. 6(24), 5671\u20135681 (2011)","journal-title":"Int. J. Phys. Sci."},{"key":"3523_CR23","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.mejo.2016.01.003","volume":"51","author":"MHB Hafiz","year":"2016","unstructured":"Hafiz, M.H.B., Solaiman, M.M.: Design of a compact reversible fault tolerant division circui. Microelectron. J. 51, 15\u201329 (2016)","journal-title":"Microelectron. J."},{"issue":"1","key":"3523_CR24","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1504\/IJICA.2016.075465","volume":"7","author":"B Ali","year":"2016","unstructured":"Ali, B., Majid, H.: Optimised reversible divider circuit. Int. J. Innovative Comput. Appl. 7(1), 13\u201333 (2016)","journal-title":"Int. J. Innovative Comput. Appl."},{"key":"3523_CR25","doi-asserted-by":"crossref","unstructured":"Lafifa, J., Hafiz, M.H.B.: Efficient approaches to design a reversible floating point divider. In: 2013 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 3004\u20133007 (2013)","DOI":"10.1109\/ISCAS.2013.6572511"},{"key":"3523_CR26","doi-asserted-by":"crossref","unstructured":"Sayanton, V.D., Hafiz, M.H.B., Lafifa, J.: An efficient design technique of a quantum divider circuit. In: 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2102\u20132105 (2016)","DOI":"10.1109\/ISCAS.2016.7538994"},{"key":"3523_CR27","unstructured":"Himanshu, T., Edgard, M.C., TSS, V., Travis, H.: Quantum circuit designs of integer division optimizing $$T$$-count and $$T$$-depth. In: IEEE Transactions on Emerging Topics in Computing (2019)"},{"key":"3523_CR28","unstructured":"Michael, A.N., Isaac, C.: Quantum computation and quantum information. American Association of Physics Teachers (2002)"},{"issue":"20","key":"3523_CR29","doi-asserted-by":"publisher","first-page":"4087","DOI":"10.1103\/PhysRevLett.74.4087","volume":"74","author":"S Tycho","year":"1995","unstructured":"Tycho, S., Harald, W.: Realizable universal quantum logic gates. Phys. Rev. Lett. 74(20), 4087 (1995)","journal-title":"Phys. Rev. Lett."},{"issue":"12","key":"3523_CR30","first-page":"1","volume":"19","author":"Y Suzhen","year":"2020","unstructured":"Suzhen, Y., Chao, W., Bo, H., Yu, G.: The dual-threshold quantum image segmentation algorithm and its simulation. Quantum Inf. Process. 19(12), 1\u201321 (2020)","journal-title":"Quantum Inf. Process."},{"issue":"7","key":"3523_CR31","first-page":"1","volume":"18","author":"X Haiying","year":"2019","unstructured":"Haiying, X., Haisheng, L., Han, Z., Yan, L., Jing, Z.: Novel multi-bit quantum comparators and their application in image binarization. Quantum Inf. Process. 18(7), 1\u201317 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"3523_CR32","first-page":"1","volume":"9","author":"T Himanshu","year":"2013","unstructured":"Himanshu, T., Nagarajan, R.: Design of efficient reversible logic-based binary and BCD adder circuits. ACM J. Emerg. Technol. Comput. Syst. (JETC) 9(3), 1\u201331 (2013)","journal-title":"ACM J. Emerg. Technol. Comput. Syst. (JETC)"},{"issue":"5","key":"3523_CR33","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.sysarc.2005.05.005","volume":"52","author":"MHB Hafiz","year":"2006","unstructured":"Hafiz, M.H.B., Ahsan, R.C.: Design of a compact reversible binary coded decimal adder circuit. J. Syst. Architect. 52(5), 272\u2013282 (2006)","journal-title":"J. Syst. Architect."},{"issue":"12","key":"3523_CR34","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1016\/j.mejo.2008.04.003","volume":"39","author":"KW Ashis","year":"2008","unstructured":"Ashis, K.W., Mahmudul, M.H., Ahsan, R.C., Hafiz, M.H.B.: Efficient approaches for designing reversible binary coded decimal adders. Microelectron. J. 39(12), 1693\u20131703 (2008)","journal-title":"Microelectron. J."},{"issue":"7","key":"3523_CR35","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.sysarc.2007.12.006","volume":"54","author":"KT Michael","year":"2008","unstructured":"Michael, K.T., Robert, G.: Optimized reversible binary-coded decimal adders. J. Syst. Architect. 54(7), 697\u2013706 (2008)","journal-title":"J. Syst. Architect."},{"issue":"6","key":"3523_CR36","first-page":"787","volume":"4","author":"M Majid","year":"2008","unstructured":"Majid, M., Mohammad, E., Majid, H., Abbas, B.: Design and optimization of reversible bcd adder\/subtractor circuit for quantum and nanotechnology based systems. World Appl. Sci. J. 4(6), 787\u2013792 (2008)","journal-title":"World Appl. Sci. J."},{"issue":"05","key":"3523_CR37","doi-asserted-by":"publisher","first-page":"969","DOI":"10.1142\/S0219749909005523","volume":"7","author":"M Majid","year":"2009","unstructured":"Majid, M., Majid, H., Mohammad, E., Keiva, N.: Minimization and optimization of reversible BCD-Full adder\/subtractor using genetic algorithm and Don\u2019t Care concept. Int. J. Quantum Inf. 7(05), 969\u2013989 (2009)","journal-title":"Int. J. Quantum Inf."},{"key":"3523_CR38","unstructured":"Gadi, A., Thomas, A., Panagiotis, B., Luciano, B., Yael, B.H., David, B.: Qiskit: An open-source framework for quantum computing. Accessed on Mar 16 (2019)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03523-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03523-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03523-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,25]],"date-time":"2024-09-25T04:30:44Z","timestamp":1727238644000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03523-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5]]},"references-count":38,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3523"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03523-8","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5]]},"assertion":[{"value":"26 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"182"}}