Classical and Quantum Heuristics for the Binary Paint Shop Problem

arXiv:2509.15294 · quant-ph, cs.DS, cs.ET, math.OC · Submitted 2025-09-18 · Read on arXiv

quant-ph, cs.DS, cs.ET, math.OC

Submitted: 2025-09-18

Updated: 2026-10-09

Terminology

• Binary Paint Shop Problem — 2× in this paper
• Benchmark — 1× in this paper · explained in 2 episodes
• Quantum Approximate Optimisation Algorithm — 1× in this paper
• Recursive Star Greedy — 1× in this paper

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians