Pith. sign in

REVIEW 1 cited by

Ising formulations of routing optimization problems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.05022 v1 pith:IUSTETCH submitted 2020-12-09 quant-ph

Daniel Jaroszewski , Fabian Klos , Benedikt Sturm This is my paper · ORCID
classification quant-ph
keywords routingformulationsfunctionsoptimizationquantumadiabaticalgorithmsbinary
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We formulate binary optimization functions for single-vehicle routing, travelling salesperson and collision-free multi-vehicle routing with significant improvements in the number of variables over existing formulations. The provided functions are readily implemented on gate-based quantum computers using variational algorithms and on adiabatic quantum hardware.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Ising Acceleration for Multi-Robot Multi-Target Planning

    cs.ET 2026-08 conditional novelty 6.0 of 10

    A compact CMOS Ising chip used as a candidate generator can solve parts of multi-robot planning with large accelerator-only energy savings, though host-side energy and projected tour-construction costs weaken the head...

Pith tools