A proof-of-concept that maps circle packing for chromatography to a maximum independent set problem and runs QAOA on 18 qubits, with resource estimates for harder sphere packing variants.
Compact packings of the plane with two sizes of discs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We consider packings of the plane using discs of radius 1 and r. A packing is compact if every disc D is tangent to a sequence of discs D_1, D_2, ..., D_n such that D_i is tangent to D_{i+1}. We prove that there are only nine values of r with r<1 for which such packings are possible. For each of the nine values we describe the possible compact packings.
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Sphere Packing on a Quantum Computer for Chromatography Modeling
A proof-of-concept that maps circle packing for chromatography to a maximum independent set problem and runs QAOA on 18 qubits, with resource estimates for harder sphere packing variants.