A Quantum Algorithm for Finding a Hamilton Circuit
From MaRDI portal
Publication:3536601
DOI10.1088/0253-6102/35/4/385zbMATH Open1160.81332OpenAlexW2312912728MaRDI QIDQ3536601FDOQ3536601
Authors: Hao Guo, Gui-Lu Long, Yang Sun, Xiao-Lin Xiu 
Publication date: 21 November 2008
Published in: Communications in Theoretical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0253-6102/35/4/385
Recommendations
Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cited In (15)
- Title not available (Why is that?)
- New quantum algorithm for studying NP-complete problems
- 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)
