As quantum counterpart of classical computer, quantum computer reveals incredible efficiency to execute arithmetic tasks and threatens the security of classical communication. Quantum algorithm is the sole of quantum computation, which shows the amazing power of quantum parallelism and quantum interference. It attracts particular concern to develop new quantum algorithms in recent years. The concept of simulating physics progresses with quantum computers was originated in Richard Feynman’s observation that computers built from quantum mechanical components would be ideally suited to simulating quantum mechanics1. Since then, the first efficient quantum algorithm was proposed by Deutsch in 19852 and generalized by Deutsch and Jozsa in 19873. Lately, an increasing number of practical programs were presented, such as factoring large integer4, Grover’s searching algorithm for database5 and Simon’s exponential acceleration algorithm for the black box problem6. What’s more, Harrow et al. came up with a quantum scheme to decrease the computational complexity of solving linear system of equations from O(n) to log(n) , and this was the first quantum algorithm to work out the most fundamental problems in engineering science7. Some quantum algorithms have been demonstrated in different physical systems, such as ion traps8,9,10,11, superconducting devices12,13,14, optical lattices15,16, quantum dots17,18, and linear optics19,20,21,22,23,24,25. Due to its good scalability, easy-handling and high stability, linear optical system is a good candidate for implementing quantum algorithms.We report an experiment to demonstrate a quantum permutation determining algorithm with linear optical system. By employing photon’s polarization and spatial mode, we realize the quantum ququart states and all the essential permutation transformations. The quantum permutation determining algorithm displays the speedup of quantum algorithm by determining the parity of the permutation in only one step of evaluation compared with two for classical algorithm. This experiment is accomplished in single photon level and the method exhibits universality in high-dimensional quantum computation.Combinatorial learning procedures and graph transformations for the discovery of tumor-like cardiomyocyte derived eletroporated combined hybrids on a Meta-Dynamic Meta-node stemness reconstructing approach for the in silico generation of a anti-(JAM-A) drug-construct.
Demonstration, quantum permutation algorithm, single photon, ququart, Combinatorial learning procedures, graph transformations, discovery tumor-like cardiomyocyte, eletroporated, combined hybrids, Meta-Dynamic, Meta-node, stemness, reconstructing, approach, in silico, generation, anti-(JAM-A), drug-construct.