[WingCode] Quantum Scam Finder

[WingCode]

Team Name: WingCode

Project Description:

This project finds scammer customer nodes in a banking graph. Scammer nodes tends to be the one with highly interconnected with other scammer nodes so that they are able to funnel the money around and making it difficult to track the sources of funds.
The problem of finding this highly interconnected nodes is called clique problem in graph theory which is NP-Hard with banks having large customer bases with lot of interactions. We can use quantum computing optimiser such as QAOA to find these scammer nodes and scam rings.

Presentation:

https://github.com/WingCode/quantum-scam-finder/blob/main/README.md
Pitch deck: https://drive.google.com/file/d/1LE_eSIOze6kh9vcpNMevzmwM0LSUSYuz/view?usp=sharing

Source code:

https://github.com/WingCode/quantum-scam-finder/blob/main/qc_clique_scam_finder.ipynb

Which challenges/prizes would you like to submit your project for?

• Quantum Finance Challenge Award
• Google Quantum AI Research Challenge Award
• Hybrid Algorithms Challenge Award
• IBM Qiskit Challenge Award
• QAOA Challenge Award
• Quantum Entrepreneurship Challenge Award

[isaacdevlugt]

Thank you for your submission! There's still time to populate your submission with code, presentation material, etc. Please make any final adjustments before the deadline tonight at 17h00 EST!

Good luck!