A Quantum Algorithm for Finding a Hamilton Circuit

DOI10.1088/0253-6102/35/4/385zbMATH Open1160.81332OpenAlexW2312912728MaRDI QIDQ3536601FDOQ3536601

Gui-Lu Long, Hao Guo, 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

zbMATH Keywords

quantum algorithmNP-problemHamilton circuit

Mathematics Subject Classification ID

Quantum computation (81P68) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Cited In (6)

• Title not available (Why is that?)
• New quantum algorithm for studying NP-complete problems
• Experimental NMR realization of a generalized quantum search algorithm
• Programmable Hamiltonian for one-way patterns
• A Quantum Hamiltonian Identification Algorithm: Computational Complexity and Error Analysis
• Rapid solution of problems by quantum computation

   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 👍 👎
• Title not available (Why is that?) 👍 👎

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)