Pages that link to "Item:Q5458579"
From MaRDI portal
The following pages link to Solving NP-Complete Problems with Quantum Search (Q5458579):
Displaying 13 items.
- Quantum cooperative search algorithm for 3-sat (Q859988) (← links)
- Nested quantum search and NP-hard problems (Q1567563) (← links)
- New quantum algorithm solving the NP complete problem (Q1760321) (← links)
- The Sturm-Liouville eigenvalue problem and NP-complete problems in the quantum setting with queries (Q2384174) (← links)
- An \(R||C_{\max}\) quantum scheduling algorithm (Q2384180) (← links)
- Quantum advantage in deciding NP-complete problems (Q2689786) (← links)
- Quantum computation and NP-complete problems (Q2735169) (← links)
- The Road to Quantum Computational Supremacy (Q3298037) (← links)
- (Q4514535) (← links)
- Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
- A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing (Q5207191) (← links)
- Exponential-time quantum algorithms for graph coloring problems (Q5970782) (← links)
- Non-Boolean quantum amplitude amplification and quantum mean estimation (Q6176970) (← links)