Full description
The weighted Max-Cut is a NP hard problem with application implications. This collection includes Python script and numerical results solving the Max-Cut problem on a cubic lattice with 11x11x11 nodes and random edge weights with mixed signs. Solution time with a novel SEMO (spin-error mitigation for optimisation) error-mitigated quantum annealing for the problem is compared with the standard D-Wave quantum annealing and BQM hybrid solvers, and various classical solvers including simulated annealing, Tabu search, Goemans-Williamson and Goemans-Williamson-inspired algorithms. It has been quantitatively demonstrated that the SEMO error-mitigated quantum annealing is outperforming other approaches. The error-mitigated quantum annealing approach presented in this article would be applicable in solving other discrete optimisation problems efficiently, which is particularly impactful for certain time-critical applications.Available: 2026-04-07
Data time period: 2025-07-01 to 2026-04-03
Subjects
Artificial Intelligence |
Goemans-Williamson algorithm |
Information and Computing Sciences |
Modelling and Simulation |
Tabu search |
Weighted Max-Cut |
cubic lattice |
quantum annealing |
simulated annealing |
spin-error mitigation for optimisation (SEMO) |
User Contributed Tags
Login to tag this record with meaningful keywords to make it easier to discover
Identifiers
- DOI : 10.25919/8B1K-4S54
- Handle : 102.100.100/733855
- URL : data.csiro.au/collection/csiro:73984
