{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,15]],"date-time":"2026-09-15T03:12:00Z","timestamp":1789441920817,"version":"build-2803163510"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006168"],"award-info":[{"award-number":["62006168"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004731","name":"Natural Science Foundation of Zhejiang Province","doi-asserted-by":"publisher","award":["LQ21A010001"],"award-info":[{"award-number":["LQ21A010001"]}],"id":[{"id":"10.13039\/501100004731","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The process of inference reflects the structure of propositions with assigned truth values, either true or false. Modus ponens is a fundamental form of inference that involves affirming the antecedent to affirm the consequent. Inspired by the quantum computer, the superposition of true and false is used for the parallel processing. In this work, we propose a quantum version of modus ponens. Additionally, we introduce two generations of quantum modus ponens: quantum modus ponens inference chain and multidimensional quantum modus ponens. Finally, a simple implementation of quantum modus ponens on the OriginQ quantum computing cloud platform is demonstrated.<\/jats:p>","DOI":"10.1038\/s41598-024-65224-9","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T14:03:01Z","timestamp":1718892181000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the quantum circuit implementation of modus ponens"],"prefix":"10.1038","volume":"14","author":[{"given":"Songsong","family":"Dai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"65224_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London A 400, 97 (1985).","journal-title":"Proc. Roy. Soc. London A"},{"key":"65224_CR2","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\u2013488 (1982).","journal-title":"Int. J. Theor. Phys."},{"key":"65224_CR3","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D. & Josza, R. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London A 439, 553 (1992).","journal-title":"Proc. Roy. Soc. London A"},{"key":"65224_CR4","doi-asserted-by":"crossref","unstructured":"Grover, L. K. A fast quantum mechanical algorithm for database search. In Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC) 212 (1996).","DOI":"10.1145\/237814.237866"},{"key":"65224_CR5","first-page":"1484","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P. W. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput. 26, 1484 (1997).","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"65224_CR6","unstructured":"Bennett, C. H. Brassard, G. Quantum cryptography: Public key distribution and coin tossing. In Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, vol. 175, p 8 (New York, 1984)."},{"key":"65224_CR7","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1103\/PhysRevA.48.1687","volume":"48","author":"Y Aharonov","year":"1993","unstructured":"Aharonov, Y., Davidovich, L. & Zagury, N. Quantum random walks. Phys. Rev. A 48, 1687 (1993).","journal-title":"Phys. Rev. A"},{"key":"65224_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J. et al. Quantum machine learning. Nature 549, 195 (2017).","journal-title":"Nature"},{"key":"65224_CR9","doi-asserted-by":"crossref","unstructured":"Thapliyal, H., Ranganathan, N. Design of reversible latches optimized for quantum cost, delay and garbage outputs. In 2010 23rd international conference on VLSI design, 235\u2013240 (2010).","DOI":"10.1109\/VLSI.Design.2010.74"},{"issue":"25","key":"65224_CR10","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov, D. & Dueck, G. W. Improved quantum cost for n-bit Toffoli gates. Electron. Lett. 39(25), 1790\u20131791 (2003).","journal-title":"Electron. Lett."},{"key":"65224_CR11","unstructured":"Origin Quantum. https:\/\/originqc.com.cn\/en\/index.html. visited in Jan 2024."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-65224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-65224-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-65224-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T14:09:08Z","timestamp":1718892548000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-65224-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":11,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["65224"],"URL":"https:\/\/doi.org\/10.1038\/s41598-024-65224-9","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"1 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The author declares no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"14245"}}