Pith. sign in

REVIEW 1 cited by

Quantum Computing Dataset of Maximum Independent Set Problem on King's Lattice of over Hundred Rydberg Atoms

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 2311.13803 v1 pith:PQ6YUB2P submitted 2023-11-23 quant-ph physics.atom-phphysics.data-an

classification quant-phphysics.atom-phphysics.data-an
keywords dataproblemrydberg-atomatomscomputinggraphindependentking
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Finding the maximum independent set (MIS) of a large-size graph is a nondeterministic polynomial-time (NP)-complete problem not efficiently solvable with classical computations. Here, we present a set of quantum adiabatic computing data of Rydberg-atom experiments performed to solve the MIS problem of up to 141 atoms randomly arranged on the King's lattice. A total of 582,916 events of Rydberg-atom measurements are collected for experimental MIS solutions of 733,853 different graphs. We provide the raw image data along with the entire binary determinations of the measured many-body ground states and the classified graph data, to offer bench-mark testing and advanced data-driven analyses for validation of the performance and system improvements of the Rydberg-atom approach.

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. Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion

    quant-ph 2025-06 conditional novelty 6.0 of 10

    QAOA plus quantum subspace expansion systematically improves MIS solutions on small random graphs, with a fitted gate-count crossover extrapolated to about 75 nodes.

Pith tools