Pith. sign in

REVIEW 1 cited by

Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers

Not yet reviewed by Pith; the record is open.

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 2401.08989 v3 pith:Q2Q2V7ZG submitted 2024-01-17 quant-ph math.OC

classification quant-phmath.OC
keywords quantumcomputersmodelssolvingtutorialapplicationsbinaryd-wave
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This tutorial offers a quick, hands-on introduction to solving Quadratic Unconstrained Binary Optimization (QUBO) models on currently available quantum computers and their simulators. We cover both IBM and D-Wave machines: IBM utilizes a gate-circuit architecture, and D-Wave is a quantum annealer. We provide examples of three canonical problems and two models from practical applications. The tutorial is structured to bridge the gap between theory and practice: we begin with an overview of QUBOs, explain their relevance and connection to quantum algorithms, introduce key quantum computing concepts, provide the foundations for two quantum heuristics, and provide detailed implementation guides. An associated GitHub repository provides the codes in five companion notebooks. In addition to reaching undergraduate and graduate students in computationally intensive disciplines, this article aims to reach working industry professionals seeking to explore the potential of near-term quantum applications. As our title indicates, this tutorial is intended to be a starting point in a journey towards solving more complex QUBOs on quantum computers.

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. Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems

    math.OC 2025-06 conditional novelty 5.0 of 10

    The authors apply spectral outer-approximation cuts from continuous SDP to binary SDP reformulations of binary QCQPs, reporting strong speedups on Boolean least squares and mixed results on quadratic knapsack.

Pith tools