qiskit-hackathon-korea-21
qiskit-hackathon-korea-21 copied to clipboard
qiskit-community
Finding Efficient Solution for Hamiltonian Cycle (NP-complete Problem)
Abstract
Hamiltonian Cycle is an NP-complete problem so there is no worst-case efficient algorithm so far. Hamiltonian Cycle is useful to generate Gray Code, which is applied to error correction, circuit minimization, etc. Quantum computing is specialized to solve this kind of graph. If we suggest an efficient algorithm using quantum computing, it will be the best solution for this problem all around the world. Let's dig into this quiz together.
Members
- @ho0-kim - Slack:
@Hoyoung Kim - @kjwcoo - Slack:
@Jinwoong Kim - @barrelo89 - Slack:
@Duin - @dongsin-kim - Slack:
@Dongsin Kim - @Grace-11 - Slack:
@Eun-Ju Park - Qiskit Coach: @githubhandle
Deliverable
jupyter notebook or a paper
GitHub repo
https://github.com/ho0-kim/Hamiltonian_Cycle_Problem_with_QC
You're the team leader and you're looking for a team member?
Do you want to join this team? If so, I will assign you
Would you add me to your team? I am already registered in the team matching web page.
I really want to join this team!! I'm interested in solving NP-Problems in P-Complexity!
You're the team leader and you're looking for a team member?
Do you want to join this team? If so, I will assign you
@Han-JaeHoon Of course, I don't mind having more smart friends like you. But, I think you need to ask regulation on multiple-project participation to @0sophy1.