Cover Image

Beating classical heuristics for the binary paint shop problem with the quantum approximate optimization algorithm

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Streif, Michael, Yarkoni, Sheir, Skolik, Andrea, Neukart, Florian, Leib, Martin
Format:	Preprint
Published:	2020
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
by: Goh, Mark, et al.
Published: (2026)

Vanishing performance of the parity-encoded quantum approximate optimization algorithm applied to spin-glass models
by: Wybo, Elisabeth, et al.
Published: (2023)

Scalable embedding of parity constraints in quantum annealing hardware
by: Cattelan, Michele, et al.
Published: (2024)

Geometry-Information Duality: Quantum Entanglement Contributions to Gravitational Dynamics
by: Neukart, Florian
Published: (2024)

A scalable quantum-enhanced greedy algorithm for maximum independent set problems
by: Wybo, Elisabeth, et al.
Published: (2026)

Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement
by: Simidzija, Petar, et al.
Published: (2026)

Quantum-classical hybrid algorithm using quantum annealing for multi-objective job shop scheduling
by: Sawamura, Kenta, et al.
Published: (2025)

Quantum reinforcement learning of classical rare dynamics: Enhancement by intrinsic Fourier features
by: Wilms, Alissa, et al.
Published: (2025)

Applying the quantum approximate optimization algorithm to general constraint satisfaction problems
by: Boulebnane, Sami, et al.
Published: (2024)

Improved precision scaling for simulating coupled quantum-classical dynamics
by: Simon, Sophia, et al.
Published: (2023)

Solving non-native combinatorial optimization problems using hybrid quantum-classical algorithms
by: Wurtz, Jonathan, et al.
Published: (2024)

Quantum chemistry, classical heuristics, and quantum advantage
by: Chan, Garnet Kin-Lic
Published: (2024)

A heuristic for solving the irregular strip packing problem with quantum optimization
by: Matt, Paul-Amaury, et al.
Published: (2024)

Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization
by: Castro, Erick R., et al.
Published: (2023)

Auxiliary-qubit-free quantum approximate optimization algorithm for the minimum dominating set problem
by: Li, Guanghui, et al.
Published: (2025)

Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms
by: Hattori, Tomohiro, et al.
Published: (2026)

Hybrid quantum-classical algorithm for near-optimal planning in POMDPs
by: Cunha, Gilberto, et al.
Published: (2025)

Analyzing the quantum approximate optimization algorithm: ansätze, symmetries, and Lie algebras
by: Kazi, Sujay, et al.
Published: (2024)

Compressed sensing enhanced by quantum approximate optimization algorithm
by: Chevalier, Baptiste, et al.
Published: (2024)

On the dynamical Lie algebras of quantum approximate optimization algorithms
by: Allcock, Jonathan, et al.
Published: (2024)

Multilevel leapfrogging initialization for quantum approximate optimization algorithm
by: Ni, Xiao-Hui, et al.
Published: (2023)

Compressed space quantum approximate optimization algorithm for constrained combinatorial optimization
by: Shirai, Tatsuhiko, et al.
Published: (2024)

Molecular docking via quantum approximate optimization algorithm
by: Ding, Qi-Ming, et al.
Published: (2023)

Benchmarking a heuristic Floquet adiabatic algorithm for the Max-Cut problem
by: Granet, Etienne, et al.
Published: (2024)

Information scrambling and entanglement in quantum approximate optimization algorithm circuits
by: Qian, Chen, et al.
Published: (2023)

An introduction to variational quantum algorithms for combinatorial optimization problems
by: Grange, Camille, et al.
Published: (2022)

Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
by: Binkowski, Lennart, et al.
Published: (2022)

Systematic study on the dependence of the warm-start quantum approximate optimization algorithm on approximate solutions
by: Okada, Ken N., et al.
Published: (2022)

Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm
by: Wybo, Elisabeth, et al.
Published: (2024)

Distributed quantum-classical hybrid algorithm for solving K-SAT problem
by: Huang, Huaijing, et al.
Published: (2026)

Routing and wavelength assignment in quantum key distribution networks: power control heuristics for quantum-classical multiplexing
by: Ruiz, Lidia, et al.
Published: (2024)

Oracle problems as communication tasks and optimization of quantum algorithms
by: Te'eni, Amit, et al.
Published: (2024)

Hybrid classical-quantum branch-and-bound algorithm for solving integer linear problems
by: Sanavio, Claudio, et al.
Published: (2023)

Applying quantum approximate optimization to the heterogeneous vehicle routing problem
by: Fitzek, David, et al.
Published: (2021)

Performance and scaling analysis of variational quantum simulation
by: Ponce, Mario, et al.
Published: (2024)

Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation
by: Zhang, Siran, et al.
Published: (2026)

Quantum and classical correlations in shrinking algorithms for optimization
by: Fischer, Victor, et al.
Published: (2024)

A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code
by: Mohan, Ankith, et al.
Published: (2023)

Optimal elemental configuration search in crystal using quantum approximate optimization algorithm
by: Ichikawa, Kazuhide, et al.
Published: (2025)

A meaningful optimal control problem in quantum and classical physics
by: Lazarus, Arnaud, et al.
Published: (2025)