Source code for the book "Quantum Computing for Programmers", Cambridge University Press

MaxCut is a powerful cutlist optimizer for cabinetry & woodworking. Learn how to integrate with it via CLI to automate workflows.

Repository for the paper "Fast and Provable Greedy Algorithms for the Max-Cut Relaxation"

A Python Toolkit for Systematic Structure Enumeration of 2D Monolayer Networks on Archimedean Tilings

FPT-based data reduction and kernelization for the maximum cut problem

budgeted hebbian kuramoto with fixed support and symmetric-frobenius projection — control/calibration algorithm for oscillator-based ising machines

Patent-pending 5G frequency assignment optimizer. +33.1% interference reduction on 20k-node benchmark. ratio 0.820 | <8 min | <80MB RAM | no GPU | O-RAN rApp ready. NDA required for source code.

Greedy Frank-Wolfe algorithm with KL property for Max-Cut SDP relaxation and reweighted ℓ1 minimization

Reinforcement Learning (RL) environments for a range of graph problems. Written in Jraph.

Markus Baumann experiments on parametrized Hamiltonians and implicit differentiation for bilevel Max-Cut optimization.

Classical SA vs D-Wave quantum annealing on Max-Cut and spin glass problems. Phase 1 complete: all classical solvers converge to identical solutions up to n=500. Waiting on D-Wave QPU access to test if quantum tunneling breaks the classical consensus.

A GPU-accelerated heuristic solver for Max-Cut and QUBO optimization, built with Rust and WebGPU.

Lean 4 formalization of finite-N Kuramoto synchronization: order-parameter bounds, gradient identities, contraction, and weighted/Hebbian Lyapunov descent.

Dual decomposition solvers for (lifted) multicut and max cut based on the LP_MP library.

Python toolkit for solving NP-complete problems (TSP, MAX-CUT) using exact methods, heuristics, genetic algorithms, and ensemble methods