A framework for structured quantum search.
From MaRDI portal
Publication:1586960
DOI10.1016/S0167-2789(98)00047-5zbMath1033.81504arXivquant-ph/9701013OpenAlexW2042460203MaRDI QIDQ1586960
Publication date: 21 November 2000
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/9701013
Related Items
Tree search and quantum computation, Intricacies of quantum computational paths, Information and computation: Classical and quantum aspects, TOOLS FOR QUANTUM ALGORITHMS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Quantum mechanical Hamiltonian models of Turing machines
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Exploiting the deep structure of constraint problems
- Quantum computational networks
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Quantum Computation
- Quantum Computers, Factoring, and Decoherence
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Realizable Universal Quantum Logic Gates
- Entropy of theK-Satisfiability Problem
- Quantum complexity theory
