Daniele Ottaviani

Daniele Ottaviani

Auto-generated profile, based on publicly available information

Daniele Ottaviani

Quantum Computing Lab, CINECA, Casalecchio di Reno, Italy

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
9 June 2022 in Quantum Science and Technology
Verified
Journal Article
Open access
KMKevin Mato
Kevin Mato
RMRiccardo Mengoni
Riccardo Mengoni
DODaniele Ottaviani
Daniele Ottaviani
GPGianluca Palermo
Gianluca Palermo
Molecular docking is an important step of the drug discovery process which aims at calculating the preferred position and shape of one molecule to a second when they are bound to each other. During such analysis, 3D representations of molecules are manipulated according to their degree of freedoms: rigid roto-translation and fragment rotations along the rotatable bonds. In our work, we focussed on one specific phase of the molecular docking procedure i.e. molecular unfolding (MU), which is used to remove the initial bias of a molecule by expanding it to an unfolded shape simpler to manipulate within the target cavity. The objective of the MU problem is to find the configuration that maximizes the molecular area, or equivalently, that maximizes the internal distances between atoms inside the molecule. We propose a quantum annealing approach to MU by formulating it as a high-order unconstrained binary optimization which was possible to solve on the latest D-wave annealing hardware (2000Q and advantage). Results and performances obtained with quantum annealers are compared with state of art classical solvers.

29 October 2020 in Astronomy & Astrophysics
Verified
Journal Article
Open access
PDF file
VRValerio Roscani
Valerio Roscani
Silvia TozzaSilvia Tozza
Silvia Tozza
MCM. Castellano
M. Castellano
EME. Merlin
E. Merlin
DOD. Ottaviani
D. Ottaviani
AFA. Fontana
A. Fontana
Aims.We present a comprehensive analysis of the performance of noise-reduction (denoising) algorithms to determine whether they provide advantages in source detection, mitigating noise on extragalactic survey images.Methods.The methods we analyze here are representative of different algorithmic families: Perona-Malik filtering, bilateral filter, total variation denoising, structure-texture image decomposition, non-local means, wavelets, and block-matching We tested the algorithms on simulated images of extragalactic fields with resolution and depth typical of theHubble,Spitzer, andEuclidSpace Telescopes, and of ground-based instruments. After choosing their best internal parameters configuration, we assessed their performance as a function of resolution, background level, and image type, in addition to testing their ability to preserve the objects fluxes and shapes. Finally, we analyze, in terms of completeness and purity, the catalogs that were extracted after applying denoising algorithms on a simulatedEuclidWide Survey VIS image and on real H160 andK-band (HAWK-I) observations of the CANDELS GOODS-South field.Results.Denoising algorithms often outperform the standard approach of filtering with the point spread function (PSF) of the image. Applying structure-texture image decomposition, Perona-Malik filtering, the total variation method by Chambolle, and bilateral filtering on theEuclid-VIS image, we obtain catalogs that are both more pure and complete by 0.2 magnitude than those based on the standard approach. The same result is achieved with the structure-texture image decomposition algorithm applied on the H160 image. The relative advantage of denoising techniques with respect to PSF filtering rises with increasing depth. Moreover, these techniques better preserve the shape of the detected objects with respect to PSF smoothing.Conclusions.Denoising algorithms provide significant improvements in the detection of faint objects and enhance the scientific return of current and future extragalactic surveys. We identify the most promising denoising algorithms among the 20 techniques considered in this study.

30 September 2025 in Quantum Science and Technology
Verified
Journal Article
Open access
PDF file
ETEmanuele Triuzzi
Emanuele Triuzzi
RMRiccardo Mengoni
Riccardo Mengoni
FMFrancesco Micucci
Francesco Micucci
DBDomenico Bonanni
Domenico Bonanni
DODaniele Ottaviani
Daniele Ottaviani
GPGianluca Palermo
Gianluca Palermo
Molecular docking is an essential step in the drug discovery process involving the detection of three-dimensional poses of a ligand inside the active site of the protein. In this paper, we address the Molecular Docking search phase by formulating the problem in quadratic unconstrained binary optimization terms, suitable for an annealing approach. We propose a problem formulation as a weighted subgraph isomorphism between the ligand graph and the grid of the target protein pocket. In particular, we applied a graph representation to the ligand embedding all the geometrical properties of the molecule including its flexibility, and we created a weighted spatial grid to the 3D space region inside the pocket. The proposed quantum annealing-based method for molecular docking achieves valid ligand placements. Compared to simulated annealing, quantum solvers sampled fewer but higher-quality solutions with lower root-mean-square deviation, demonstrating competitive performance within hardware limits.