arXiv subjects

Anton Robert

Publications and source records attributed to Anton Robert.

4 recordsLinked to original sources

arXiv2023

Coupled interactions at the ionic graphene/water interface

We compute ionic free energy adsorption profiles at aqueous graphene interface by developing a self-consistent approach. To do so, we design a microscopic model for water and put the liquid on an equal footing with the graphene described by its electronic band structure. By evaluating progressively the electronic/dipolar coupled electrostatic interactions, we show that the coupling level including mutual graphene/water screening permits to recover remarkably the precision of extensive quantum simulations. We further derive the potential of mean force evolution of several alkali cations.

cond-mat.soft↗

arXiv2020

Pressure Correction for Solvation Theories

Liquid state theories such as integral equations and classical density functional theory often overestimate the bulk pressure of fluids because they require closure relations or truncations of functionals. Consequently, the cost to create a molecular cavity in the fluid is no longer negligible and those theories predict wrong solvation free energies. We show how to correct them simply by computing an optimized Van der Walls volume of the solute and removing the undue free energy to create such volume in the fluid. Given this versatile correction, we demonstrate that state-of-the-art solvation theories can predict, within seconds, hydration free energies of a benchmark of small neutral drug-like molecules with the same accuracy as day-long molecular simulations.

physics.chem-ph↗

arXiv2020

Improving Variational Quantum Optimization using CVaR

Hybrid quantum/classical variational algorithms can be implemented on noisy intermediate-scale quantum computers and can be used to find solutions for combinatorial optimization problems. Approaches discussed in the literature minimize the expectation of the problem Hamiltonian for a parameterized trial quantum state. The expectation is estimated as the sample mean of a set of measurement outcomes, while the parameters of the trial state are optimized classically. This procedure is fully justified for quantum mechanical observables such as molecular energies. In the case of classical optimization problems, which yield diagonal Hamiltonians, we argue that aggregating the samples in a different way than the expected value is more natural. In this paper we propose the Conditional Value-at-Risk as an aggregation function. We empirically show -- using classical simulation as well as quantum hardware -- that this leads to faster convergence to better solutions for all combinatorial optimization problems tested in our study. We also provide analytical results to explain the observed difference in performance between different variational algorithms.

quant-ph↗

arXiv2019

Resource-Efficient Quantum Algorithm for Protein Folding

Predicting the three-dimensional (3D) structure of a protein from its primary sequence of amino acids is known as the protein folding (PF) problem. Due to the central role of proteins' 3D structures in chemistry, biology and medicine applications (e.g., in drug discovery) this subject has been intensively studied for over half a century. Although classical algorithms provide practical solutions, sampling the conformation space of small proteins, they cannot tackle the intrinsic NP-hard complexity of the problem, even reduced to its simplest Hydrophobic-Polar model. While fault-tolerant quantum computers are still beyond reach for state-of-the-art quantum technologies, there is evidence that quantum algorithms can be successfully used on Noisy Intermediate-Scale Quantum (NISQ) computers to accelerate energy optimization in frustrated systems. In this work, we present a model Hamiltonian with $\mathcal{O}(N^4)$ scaling and a corresponding quantum variational algorithm for the folding of a polymer chain with $N$ monomers on a tetrahedral lattice. The model reflects many physico-chemical properties of the protein, reducing the gap between coarse-grained representations and mere lattice models. We use a robust and versatile optimisation scheme, bringing together variational quantum algorithms specifically adapted to classical cost functions and evolutionary strategies (genetic algorithms), to simulate the folding of the 10 amino acid Angiotensin peptide on 22 qubits. The same method is also successfully applied to the study of the folding of a 7 amino acid neuropeptide using 9 qubits on an IBM Q 20-qubit quantum computer. Bringing together recent advances in building gate-based quantum computers with noise-tolerant hybrid quantum-classical algorithms, this work paves the way towards accessible and relevant scientific experiments on real quantum processors.

quant-ph↗