◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Leib

1 paper hereh-index 182.4k citations29 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • quant-ph1

identity via Semantic Scholar / OpenAlex

collaborators

1 paper

quant-ph2025

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

Michael Streif, Sheir Yarkoni, Andrea Skolik +2

The binary paint shop problem (BPSP) is an APX-hard optimization problem of the automotive industry. In this work, we show how to use the Quantum Approximate Optimization Algorithm…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.