Abstract
Quantum algorithms have the potential to demonstrate that for some problems quantum computation is more efficient than classical computation. A goal of quantum computing is to determine for which problems quantum computers are faster than classical computers. In our survey we present recent quantum algorithms for basic problems from graph and algebra theory. The quantum algorithms for these problems use a combination of Grovers search algorithms, quantum amplitude amplification and quantum random walks. These quantum algorithms are faster than the best known classical algorithms for the corresponding problems.
Keywords: Quantum computing, quantum algorithms, graph theory, algebra, quantum query complexity
Related Books
Challenges and Opportunities for Deep Learning Applications in Industry 4.0
Recent Advances in IoT and Blockchain Technology
Augmented Intelligence: Deep Learning, Machine Learning, Cognitive Computing, Educational Data Mining
Human-Computer Interaction and Beyond: Advances Towards Smart and Interconnected Environments Part II
Machine Learning and Its Application: A Quick Guide for Beginners
Computational Intelligence For Data Analysis
Applied Machine Learning and Multi-Criteria Decision-Making in Healthcare
Advanced Computing Techniques: Implementation, Informatics and Emerging Technologies
How to Design Optimization Algorithms by Applying Natural Behavioral Patterns
Human-Computer Interaction and Beyond: Advances Towards Smart and Interconnected Environments (Part I)
4