A framework for structured quantum search.
From MaRDI portal
Publication:1586960
DOI10.1016/S0167-2789(98)00047-5zbMATH Open1033.81504arXivquant-ph/9701013OpenAlexW2042460203MaRDI QIDQ1586960FDOQ1586960
Authors: Tad Hogg 
Publication date: 21 November 2000
Published in: Physica D (Search for Journal in Brave)
Abstract: A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to the underlying structure of abstract search spaces, and is analytically simpler than previous structured search methods. The algorithm is evaluated empirically with a variety of search problems, and shown to be particularly effective for searches with many constraints. Furthermore, the algorithm provides a simple framework for utilizing search heuristics. It also exhibits the same phase transition in search difficulty as found for sophisticated classical search methods, indicating it is effectively using the problem structure.
Full work available at URL: https://arxiv.org/abs/quant-ph/9701013
Recommendations
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Quantum computation
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Title not available (Why is that?)
- Quantum computational networks
- Quantum computers, factoring, and decoherence
- Title not available (Why is that?)
- Quantum complexity theory
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Realizable Universal Quantum Logic Gates
- Quantum mechanical Hamiltonian models of Turing machines
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Entropy of theK-Satisfiability Problem
- Exploiting the deep structure of constraint problems
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Experimental realization of a highly structured search algorithm
- APPLYING QUANTUM SEARCH TO AUTOMATED TEST PATTERN GENERATION FOR VLSI CIRCUITS
- HIERARCHICAL QUANTUM SEARCH
- Title not available (Why is that?)
- TOOLS FOR QUANTUM ALGORITHMS
- Title not available (Why is that?)
- Tree search and quantum computation
- Information and computation: Classical and quantum aspects
- Intricacies of quantum computational paths
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
This page was built for publication: A framework for structured quantum search.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1586960)
