Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
SOAR: an architecture for general intelligence
Artificial Intelligence
Principles of artificial intelligence
Principles of artificial intelligence
Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
Artificial intelligence (2nd ed.): structures and strategies for complex problem-solving
Linear-space best-first search
Artificial Intelligence
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A framework for structured quantum search
PhysComp96 Proceedings of the fourth workshop on Physics and computation
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
The Architecture of Cognition
Quantum computation and quantum information
Quantum computation and quantum information
Logic and Computer Design Fundamentals with Cdrom
Logic and Computer Design Fundamentals with Cdrom
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
An Example of the Difference Between Quantum and Classical Random Walks
Quantum Information Processing
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
Behind Deep Blue: Building the Computer that Defeated the World Chess Champion
IBM's Deep Blue Chess Grandmaster Chips
IEEE Micro
Chunking in Soar: The Anatomy of a General Learning Mechanism
Machine Learning
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Exponential algorithmic speedup by a quantum walk
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Walk on the Line
Quantum Computing (Natural Computing Series)
Quantum Computing (Natural Computing Series)
ACM SIGACT News
Coins make quantum walks faster
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Is partial quantum search of a database any easier?
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Simple Algorithm for Partial Quantum Search
Quantum Information Processing
An Introduction to Quantum Computing
An Introduction to Quantum Computing
Quantum Walk Algorithm for Element Distinctness
SIAM Journal on Computing
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
QI'11 Proceedings of the 5th international conference on Quantum interaction
Quantum Information Processing
Intricacies of quantum computational paths
Quantum Information Processing
| Hi-index | 0.00 |
Traditional tree search algorithms supply a blueprint for modeling problem solving behaviour. A diverse spectrum of problems can be formulated in terms of tree search. Quantum computation, namely Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. In this work we consider the impact of incorporating classical search concepts alongside Grover's algorithm into a hybrid quantum search system. Some of the crucial points examined include: (1) the reverberations of contemplating the use of non-constant branching factors; (2) determining the consequences of incorporating an heuristic perspective into a quantum tree search model.