Abstract
AbstractThe 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.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Zhejiang Province
Publisher
Springer Science and Business Media LLC
Reference11 articles.
1. Deutsch, D. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London A 400, 97 (1985).
2. Feynman, R. P. Simulating physics with computers. Int. J. Theor. Phys. 21, 467–488 (1982).
3. Deutsch, D. & Josza, R. Rapid solutions of problems by quantum computation. Proc. Roy. Soc. London A 439, 553 (1992).
4. 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).
5. Shor, P. W. Polynomial time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Statist. Comput. 26, 1484 (1997).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献