Tree search and quantum computation

DOI10.1007/S11128-010-0212-ZzbMath1225.81041arXiv1502.01951OpenAlexW3121836827WikidataQ57696207 ScholiaQ57696207MaRDI QIDQ638594

Andreas Wichert, Luís Tarrataca

Publication date: 13 September 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.01951

zbMATH Keywords

quantum computationheuristictree search

Mathematics Subject Classification ID

Trees (05C05) Searching and sorting (68P10) Quantum computation (81P68)

Related Items (2)

Intricacies of quantum computational paths ⋮ Quantum Mathematics in Artificial Intelligence

Uses Software

• Algorithm 447

Cites Work

• Linear-space best-first search
• Depth-first iterative-deepening: An optimal admissible tree search
• From quantum cellular automata to quantum lattice gases
• A framework for structured quantum search.
• Simple algorithm for partial quantum search
• An example of the difference between quantum and classical random walks
• HIERARCHICAL QUANTUM SEARCH
• Exponential algorithmic speedup by a quantum walk
• Strengths and Weaknesses of Quantum Computing
• Regression models for data with a non-zero probability of a zero response
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Fixed-Point Quantum Search
• One-dimensional quantum walks
• Quantum walks on graphs
• Paths, Trees, and Flowers
• Quantum Walk Algorithm for Element Distinctness
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
• Formal Reductions of the General Combinatorial Decision Problem
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
• Deep Blue
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Tree search and quantum computation