A Quantum Algorithm for Finding a Hamilton Circuit
From MaRDI portal
(Redirected from Publication:3536601)
Recommendations
- An alternative adiabatic quantum algorithm for the Hamiltonian cycle problem
- Solving NP-Complete Problems with Quantum Search
- New quantum algorithm solving the NP complete problem
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- scientific article; zbMATH DE number 5899272
Cited in
(15)- New quantum algorithm for studying NP-complete problems
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- Quantum branch-and-bound algorithm and its application to the travelling salesman problem
- An alternative adiabatic quantum algorithm for the Hamiltonian cycle problem
- A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles
- Experimental NMR realization of a generalized quantum search algorithm
- New quantum algorithm solving the NP complete problem
- Faster than classical quantum algorithm for dense formulas of exact satisfiability and occupation problems
- Computing hypergraph Ramsey numbers by using quantum circuit
- Programmable Hamiltonian for one-way patterns
- Quantum speedups for exponential-time dynamic programming algorithms
- Novel method to solve Hamilton loop problem
- On the algorithmic and non algorithmic solvable problems from quantum computing point of view
- A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
- Rapid solution of problems by quantum computation
This page was built for publication: A Quantum Algorithm for Finding a Hamilton Circuit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536601)
