Cover Image

Classical and Quantum Heuristics for the Binary Paint Shop Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Vijendran, V, Koh, Dax Enshan, Lam, Ping Koy, Assad, Syed M
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Data Structures and Algorithms Emerging Technologies Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Parameter Tuning of Level-1 QAOA for Ising Models
by: Vijendran, V, et al.
Published: (2025)

Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
by: Zhong, Dawei, et al.
Published: (2024)

Quantum-inspired Tensor Network for QUBO, QUDO and Tensor QUDO Problems with k-neighbors
by: Subiñas, Sergio Muñiz, et al.
Published: (2026)

Theoretical Approximation Ratios for Warm-Started QAOA on 3-Regular Max-Cut Instances at Depth $p=1$
by: Tate, Reuben, et al.
Published: (2024)

Probing Quantum Telecloning on Superconducting Quantum Processors
by: Pelofske, Elijah, et al.
Published: (2023)

Comparing Algorithms for Loading Classical Datasets into Quantum Memory
by: Miranskyy, Andriy, et al.
Published: (2024)

Quantum Fourier Transform for Image Processing
by: Zhang, Ze Yu, et al.
Published: (2023)

Image Computation for Quantum Transition Systems
by: Hong, Xin, et al.
Published: (2025)

Quantum Circuit Simulation with Fast Tensor Decision Diagram
by: Zhang, Qirui, et al.
Published: (2024)

Algebraic Reduction to Improve an Optimally Bounded Quantum State Preparation Algorithm
by: Belli, Giacomo, et al.
Published: (2026)

An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq
by: Liu, Wenjie, et al.
Published: (2023)

Infeasibility of constructing a special orthogonal matrix for the deterministic remote preparation of arbitrary n-qubit state
by: Liu, Wenjie, et al.
Published: (2023)

Resource-aware scheduling of multiple quantum circuits on a hardware device
by: Bhoumik, Debasmita, et al.
Published: (2024)

Universal Coating by 3D Hybrid Programmable Matter
by: Kostitsyna, Irina, et al.
Published: (2023)

Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024)

Decoded Quantum Interferometry Under Noise
by: Bu, Kaifeng, et al.
Published: (2025)

The Better Solution Probability Metric: Optimizing QAOA to Outperform its Warm-Start Solution
by: Feeney, Sean, et al.
Published: (2024)

Quantum speedups for stochastic optimization
by: Sidford, Aaron, et al.
Published: (2023)

On Speedups for Convex Optimization via Quantum Dynamics
by: Chakrabarti, Shouvanik, et al.
Published: (2025)

Treasure Hunt in Anonymous Graphs with Quantum Pebbles by Oblivious Agents
by: Gaur, Gaurav, et al.
Published: (2025)

Near-Optimal Quantum Algorithm for Minimizing the Maximal Loss
by: Wang, Hao, et al.
Published: (2024)

Gibbs Sampling of Continuous Potentials on a Quantum Computer
by: Motamedi, Arsalan, et al.
Published: (2022)

Quantum Speedups for Group Relaxations of Integer Linear Programs
by: Augustino, Brandon, et al.
Published: (2026)

Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)

Quantum Optimization Algorithms in Operations Research: Methods, Applications, and Implications
by: Klug, Florian
Published: (2023)

Online Matching on $3$-Uniform Hypergraphs
by: Borst, Sander, et al.
Published: (2024)

Quantum Approximate Optimization Algorithms for Maximum Cut on Low-Girth Graphs
by: Li, Tongyang, et al.
Published: (2024)

Flow Shop Scheduling with Stochastic Reentry
by: von Aspern, Maximilian, et al.
Published: (2026)

A Catalyst Framework for the Quantum Linear System Problem via the Proximal Point Algorithm
by: Kim, Junhyung Lyle, et al.
Published: (2024)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)

The Fair Periodic Assignment Problem
by: van Lieshout, Rolf, et al.
Published: (2025)

On the Complexity of Bilevel Independent Set Problem
by: Muluk, Komal
Published: (2026)

Approximation Schemes for Sequential Hiring Problems
by: Segev, Danny, et al.
Published: (2026)

Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)

Solving the Probabilistic Profitable Tour Problem on a Tree
by: Angelelli, Enrico, et al.
Published: (2022)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)