QAOA applied to the Maximum Cut combinatorial optimization problem with Qiskit
-
Updated
Apr 1, 2026 - Python
QAOA applied to the Maximum Cut combinatorial optimization problem with Qiskit
Benchmarks digital adiabatic QA on Random/MaxCut/MIS QUBO with Qiskit Aer, including QA/SA/PRR comparisons.
Quantum Approximate Optimization Algorithm (p=1) for MaxCut on a 4-node cycle graph.
Fast MAXCUT, TSP, and sampling heuristics from near-ideal transverse field Ising model (TFIM)
Hybrid quantum-classical solver for large-scale weighted Max-Cut using QAOA, quantum preconditioning, and classical refinement, with real hardware validation on Rigetti Ankaa-3.
[ICLR'26] A Derandomization Framework for Structure Discovery: Applications in Neural Networks and Beyond
In this work, we use LR-QAOA protocol as an easy-to-implement scalable benchmarking methodology that assesses quantum processing units (QPUs) at different widths (number of qubits) and 2-qubit gate depths.
A gravity-inspired physics optimization kernel with a constraint-driven runtime (Ising/QUBO as the description layer).
A quantum algorithm for the maximum cut problem in arbitrary graphs. Implementation using Qiskit.
Fixed linear ramp schedules in QAOA constitute a universal set parameters, i.e., a set of γ and β parameters that rapidly approximate the optimal solution, x∗, independently of the COP selected, and that the success probability of finding it, probability(x∗), increases with the number of QAOA layers p.
Solver for Maximum Cut and QUBO problems
Official repository of the paper "MaxCutPool: differentiable feature-aware Maxcut for pooling in graph neural networks" presented at ICLR 2025.
MaxCut is a powerful cutlist optimizer for cabinetry & woodworking. Learn how to integrate with it via CLI to automate workflows.
Implementation of a new Quantum Oracle for solving the Max-Cut Problem with Grover Search Algorithm
Open source MaxCut solver
Graph extension of bandlimited selected spectrum.
Quantum computing experiments via DWave's quantum annealing.
A reinforcement learning based solver for combinatorial problems
QAOA is one of the flavors of VQA, and it is considered to assert so-called "Quantum Supremacy". I have implemented a Quantum circuit to solve Max-Cut problem. I have written a report of my work.
Add a description, image, and links to the maxcut topic page so that developers can more easily learn about it.
To associate your repository with the maxcut topic, visit your repo's landing page and select "manage topics."