Welcome to 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
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.
Tutorial #1 Overview
Sudoku (https://en.wikipedia.org/wiki/Sudoku) is a well-known number puzzle. There are numbers of algorithms to solve Sudoku as explained here: “Mathematics of Sudoku” ( https://en.wikipedia.org/wiki/Mathematics_of_Sudoku), and we will be using DA to solve this puzzle instantly.
With this challenge, you will learn how to turn the Sudoku problem into the QUBO formulation using one of the hardest Sudoku problems as example ( https://www.telegraph.co.uk/news/science/science-news/9359579/Worlds-hardest-sudoku-can-you-crack-it.html)