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.
His conjec- ture was finally proven, with the aid of computer proof assistants, in 2017 [10]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 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.