search

qiskit-community / qiskit-hackathon-korea-21

A repository for Qiskit Hackathon Korea (February 16-19, 2021)
33 stars 11 forks source link

Finding Efficient Solution for Hamiltonian Cycle (NP-complete Problem) #22

Open ho0-kim opened 3 years ago

ho0-kim commented 3 years ago

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

Deliverable

jupyter notebook or a paper

GitHub repo

https://github.com/ho0-kim/Hamiltonian_Cycle_Problem_with_QC

Han-JaeHoon commented 3 years ago

You're the team leader and you're looking for a team member?

ho0-kim commented 3 years ago

@Han-JaeHoon Yes. I'm currently looking for teammates.

0sophy1 commented 3 years ago

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

dongsin-kim commented 3 years ago

Hi, I'm interested in this project :)

barrelo89 commented 3 years ago

Would you add me to your team? I am already registered in the team matching web page.

Grace-11 commented 3 years ago

Hi, I'm also interested in this prob!

kjwcoo commented 3 years ago

I wanna join this team! Plz assign me :)

Han-JaeHoon commented 3 years ago

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 commented 3 years ago

Can I join multiple teams?

ho0-kim commented 3 years ago

@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.