The Parallel Quantum Algorithm for the Class of Optimization
Abstract
For the given n numbers without any other prior information, how to obtain the minimum norm of them only by assigning their signs before them? Moreover, how to know one number is the multiplication of which ones in the given n numbers? In classical solutions, enumeration is the only way via trying one by one, whose complexity is about and this is a NP problem. In this paper, the parallel quantum algorithm is proposed to solve the two questions shown in above. Through the quantum design of linear expressions of angles in parallel circuits, only time’s quantum operations and about times’ quantum measurements in the average will give the correct answer in the successful probability of 0.97 instead of the traditional times. The example and theoretical analysis demonstrate the efficiency of the proposed method.
References
- 1. , Quantum Mechanics: Non-Relativistic Theory (World Book Publishing Press, 1999). Google Scholar
- 2. , Quantum computation and quantum information, Mathematical Structures in Computer Science 17(6) (2007) 1115–1115. ISI, Google Scholar
- 3. , Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels, Phys. Rev. Lett. 70(13) (1993) 1895–1899. Crossref, ISI, Google Scholar
- 4. , Unconditional security of a three state quantum key distribution protocol, Phys. Rev. Lett. 94(4) (2005) 040503. Crossref, ISI, Google Scholar
- 5. , Versatile microwave-driven trapped ion spin system for quantum information processing, Science Advances 2 (2016) e1600093. Crossref, ISI, Google Scholar
- 6. , Order-encoded quantum image model and parallel histogram specification, Quantum Information Processing 18 (2019) 346. Crossref, ISI, Google Scholar
- 7. , Quantum implementation circuits of quantum signal representation and type conversion, IEEE Trans. Circuits Syst. I: Regul. Pap. 2018 (2018) 1–14. Google Scholar
- 8. , Algorithms for quantum computation: Discrete logarithms and factoring, in Proceedings of the 35th Annual Symposium Foundations of Computer Science, ed. S. Goldwasser (IEEE Computer Society Press, 1994), pp. 124–134. Crossref, Google Scholar
- 9. , Quantum computation and Shor’s factoring algorithm, Rev. Mod. Phys. 68(3) (1996) 733–753. Crossref, ISI, Google Scholar
- 10. , Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett. 79(23) (1997) 325–328. Crossref, Google Scholar
- 11. , Grover’s quantum searching algorithm is optimal, Phys. Rev. A 60(4) (1999) 2746–2751. Crossref, ISI, Google Scholar
- 12. , Tight bounds on quantum searching, Fortsch. Phys.: Prog. Phys. 46(4 & 5) (1998) 493–505. Crossref, ISI, Google Scholar
- 13. Joseph L. Pachuau and Anish Kumar Saha, Generic conversion method for various spatial domain filters in quantum image processing, Quantum Information Processing (preprinted). Google Scholar
- 14. , Introduction to Linear Optimization (Athena Scientific, MA, 1997). Google Scholar
- 15. , Line-wise optimal power flow using successive linear optimization technique, IEEE Transactions on Power Systems PP(3) (2019) 1-1. Google Scholar
- 16. , An integer linear optimization model to the compartmentalized knapsack problem, International Transactions in Operational Research (2019). Crossref, ISI, Google Scholar
- 17. ,
New Integer Linear Programming Models for the Vertex Coloring Problem , LATIN 2018: Theoretical Informatics (2018). Crossref, Google Scholar


