The quantum ensemble variational optimization algorithm: Applications to molecular inverse design

Abstract

Designing molecules with optimized properties remains a fundamental challenge due to the intricate relationship between molecular structure and properties. Traditional computational approaches that address the combinatorial number of possible molecular designs become unfeasible as the molecular size increases, suffering from the so-called “curse of dimensionality” problem. Recent advances in quantum computing hardware present new opportunities to address this problem. Here, we introduce the quantum ensemble variational optimization (QEVO) method for near-term and early fault-tolerant quantum computing platforms. QEVO efficiently maps molecular structures onto an orthonormal basis of binary strings and samples from a superposition state generated by a variational ansatz. The ansatz is iteratively optimized to identify molecular candidates with the desired property. Our numerical simulations demonstrate the potential of QEVO to design drug-like molecules with anticancer properties, operating in combinatorial spaces composed of up to 2 160 solutions, while employing a shallow quantum circuit that requires only a modest number of qubits. We envision that QEVO could be applied to a wide range of complex problems, offering practical solutions to problems with combinatorial complexity.