Abstract: Max-cut is an optimization problem in graph theory. The objective is to maximize the number of edges between two distinct subsets. To picture this, imagine a map of cities connected by highways. The goal of Max-cut is to divide these cities into two separate groups in a way that breaks as many highways between them as possible. While it sounds simple, this gets really hard for regular computers to solve when the graph gets big.
Quantum computers process things differently, so they can't just look at a standard graph. I had to translate the problem into a mathematical format the quantum system could actually read. To do this, I took my graph and converted it into a quadratic program.
Once the problem was set up, I put it into a Quantum Approximate Optimization Algorithm (QAOA) optimizer. The algorithm processed the math, and I got an optimal result back, proving that it worked. I successfully built a program that takes a standard graph problem, translates it for a quantum computer, and gets the right answer.
Log in or sign up for Devpost to join the conversation.