Affiliation:
1. Dong Hua University, Shanghai 201620, China
Abstract
On the basis of classical computer, quantum computer has been developed. In dealing with some large-scale parallel problems, quantum computer is simpler and faster than traditional computer. Nowadays, physical qubit computers have many limitations. Classical computers have many ways to simulate quantum computing, the most effective of which are quantum superiority and quantum algorithm. Ensuring computational efficiency, accuracy, and precision is of great significance to the study of large-scale quantum computing. Compared with other algorithms, genetic algorithm has more advantages, so it can be more widely used. For example, strong adaptability and global optimization ability are the advantages of genetic algorithm. Through the research in Chapter 4, we can conclude that the variance of A2C is obviously smaller than that of PPO. Furthermore, it can be concluded that A2C has better robustness.
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Information Systems
Reference15 articles.
1. Quantum computation and quantum information;M. A. Nielsen;International Journal of Parallel, Emergent and Distributed Systems,2010
2. Quantum Computation
3. Quantum computation and quantum information;M. A. Nielsen;Mathematical Structures in Computer Science,2002
4. Algorithms for quantum computation: discrete logarithms and factoring
5. Non-Abelian anyons and topological quantum computation
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献