# Sphere Packing on a Quantum Computer for Chromatography Modeling

Source: [Sphere Packing on a Quantum Computer for Chromatography Modeling](<https://www.sota2.com/research/paper/68fa48cb1e209131ce932322>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T07:00:28.011Z

Authors: Benjamin Hall, Ian Njoroge, Colin Campbell, Bharath Thotakura, Rich Rines, Victory Omole, Maen Qadan

Published: 2024-11-30T22:26:38.000Z

## Abstract

Column chromatography is an important process in downstream biopharmaceutical manufacturing that enables high-selectivity separation of proteins through various modalities, such as affinity, ion exchange, hydrophobic interactions, or a combination of the aforementioned modes. Current mechanistic models of column chromatography typically abstract particle-level phenomena, in particular adsorption kinetics. A mechanistic model capable of incorporating particle-level phenomena would increase the value derived from mechanistic models. To this end, we model column chromatography via sphere packing, formulating three versions, each with increasing complexity. The first, homogeneous circle packing, is recast as maximum independent set and solved by the Quantum Approximate Optimization Algorithm on a quantum computer. The second, heterogeneous circle packing, is formulated as a graphical optimization problem and solved via classical simulations, accompanied by a road map to a quantum solution. An extension to the third, heterogeneous sphere packing, is formulated mathematically in a manner suitable to a quantum solution. Finally, detailed resource scaling is conducted to estimate the quantum resources required to simulate the most realistic model, providing a pathway to quantum advantage.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2412.00601>)

[PDF](<https://arxiv.org/pdf/2412.00601.pdf>)
