Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Streif, Michael, Yarkoni, Sheir, Skolik, Andrea, Neukart, Florian, Leib, Martin
Formato:	Preprint
Publicado:	2020
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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