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"

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

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

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

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

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.

Implicit-differentiation experiments for parametrized Hamiltonians and bilevel Max-Cut optimization.

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

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

Lean 4 / Mathlib formalization of finite-N Kuramoto synchronization: ODE existence + uniqueness, order-parameter bounds, Lyapunov descent, and convergence to synchrony for all-to-all AND general symmetric coupling with a uniform positive off-diagonal floor. Sorry-free, axiom footprint {propext, Classical.choice, Quot.sound}.

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

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

The source code supporting: