Pages that link to "Item:Q1567563"
From MaRDI portal
The following pages link to Nested quantum search and NP-hard problems (Q1567563):
Displaying 11 items.
- Quantum partial search for uneven distribution of multiple target items (Q1993754) (← links)
- The variational quantum eigensolver: a review of methods and best practices (Q2092477) (← links)
- HIERARCHICAL QUANTUM SEARCH (Q3504120) (← links)
- (Q4514535) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer (Q4972864) (← links)
- Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games (Q4978040) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- Quantum optimization (Q5946294) (← links)
- Using an \(A^\ast\)-based framework for decomposing combinatorial optimization problems to employ NISQ computers (Q6048724) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)