Quantum Computing Learning Challenge #3 - Max Cut

Overview

Welcome to the second learning challenge for the Topcoder’s new Quantum computing challenge series!

Are you interested in Quantum Computing, but haven’t had a chance to get to know better yet? Do you want to get in touch with the world’s newest technology that one could possibly imagine? Then here is your chance!

Fujitsu - the leading Japanese information and communication technology (ICT) company has just announced the launch of their Quantum-inspired computer called “Digital Annealer” ( denoted as DA in this challenge series)

DA uses a digital circuit design inspired by quantum phenomena. DA is a new computer architecture that focuses on rapidly solving combinatorial optimization problems. It can solve difficult problems within several seconds that take classical computers a considerable amount of time to process.

Since DA is built using existing semiconductor technology, it operates stably at normal temperatures without requiring a special cooling system. Digital Annealer has demonstrated a great ability to practically solve various combinatorial optimization problems which require large-scale computations and a high accuracy.

Fujitsu is pairing up with Topcoder to run several challenges where you will be able to learn some basics of the Quantum computing technology. You should be able to understand its programming methodology and be able to solve a basic real-world problem in an actual challenge.

More information about this challenge series can be found here: https://www.topcoder.com/lp/digitalannealer

Prizes

We will be awarding $50 to the first 30 members who are able to submit successful code. Prize winners will be finalized after the submission phase is over.
Good Luck!

Tutorial #3 Overview

Maximum Cut is a well-known NP-complete problem. Its weighted version is one of Karp's 21 NP-complete problems. In this learning challenge, we will be using DA to solve this puzzle instantly.



To make this tutorial more exciting, we are hiding several equations and codes at the beginning of the challenge. These hidden equations will be opened after 48 hours from the start date.

If you didn’t participate in the previous learning challenge about Sudoku, please have a check first. 

Good Luck!
 

Tutorial #3

Please refer to the tutorial website: https://tc3-japan.github.io/DA_tutorial/tutorial-3-max-cut.html

Final Submission Guidelines

Please refer to "Note on Submissions" section of the tutorial on rules and how you will get results of your submissions.
https://tc3-japan.github.io/DA_tutorial/tutorial-3-max-cut.html#NoteOnSubmissions
* Note that some of the submission rules have changed from the previous challenge