SearcharxivSearch

arXiv subjects

Emanuele Costa

Publications and source records attributed to Emanuele Costa.

11 recordsLinked to original sources

Towards interpretable AI with quantum annealing feature selection

Deep learning models are used in critical applications, in which mistakes can have serious consequences. Therefore, it is crucial to understand how and why models generate predictions. This understanding provides useful information to check whether the model is learning the right patterns, detect biases in the data, improve model design, and build systems that can be trusted. This work proposes a new method for interpreting Convolutional Neural Networks in image classification tasks. The approach works by selecting the most representative feature maps that contribute to each prediction. To solve this combinatorial problem, we encode it into a quantum constrained optimization problem and propose to solve it using quantum annealing. We evaluate our method against the state-of-the-art explainable AI techniques, specifically GradCAM and GradCAM++, and observe an improved class disentanglement, i.e. the model's decision boundaries become more distinct and its reasoning more transparent. This demonstrates that our approach enhances the quality of explanations, making it easier to understand which features the model relies on for specific predictions. In addition, we study the computational behavior of the quantum annealing algorithm. Specifically, we analyze the minimum energy gap of the system during computation and the probability that the algorithm finds the correct solution. These analyses provide theoretical insight into why the method works effectively in practice.

cs.LG

Improved quasiparticle nuclear Hamiltonians for quantum computing

Quantum computing is increasingly offering concrete solutions toward the simulation of nuclear structure, with the potential to overcome the exponential scaling that limits classical diagonalization methods in large spaces. A particularly efficient encoding scheme, based on collective like-nucleon pairing modes, reduces the qubit requirements by half and avoids the non-local operator strings of standard fermion-to-qubit mappings. While this quasiparticle framework provides accurate results for semimagic nuclei, it does not adequately describe open-shell systems where proton-neutron correlations become important. In this work, we apply Brillouin-Wigner perturbation theory to systematically improve the quasiparticle description of open-shell nuclei in the $sd$ shell, reaching an energy relative error below $0.2\%$ compared to the nuclear shell model. Furthermore, to make the effective Hamiltonian suitable for quantum simulation, we introduce a mean-field Hartree-Fock approximation of the non-quasiparticle resolvent, achieving ground-state energies typically within $2\%$ of the exact shell-model result. This represents a systematic improvement over the bare quasiparticle Hamiltonian while remaining within the reach of near-term quantum devices.

nucl-th

Quasiparticle pairing encoding of atomic nuclei for quantum annealing

Quantum computing is emerging as a promising tool in nuclear physics. However, the cost of encoding fermionic operators hampers the application of algorithms in current noisy quantum devices. In this work, we analyze an encoding scheme based on pairing nucleon modes. This approach significantly reduces the complexity of the encoding, while maintaining a high accuracy for the ground states of semimagic nuclei across the $sd$ and $pf$ shells and for tin isotopes. In addition, we also explore the encoding ability to describe open-shell nuclei within the above configuration spaces. When this scheme is applied to a trotterized quantum adiabatic evolution, our results demonstrate a computational advantage of up to three orders of magnitude in CNOT gate count compared to the standard Jordan-Wigner encoding. Our approach paves the way for efficient quantum simulations of nuclear structure using quantum annealing, with applications to both digital and hybrid quantum computing platforms.

nucl-th

Adaptive-basis sample-based neural diagonalization for quantum many-body systems

Accurately estimating ground-state energies of quantum many-body systems is still a challenging computational task because of the exponential growth of the Hilbert space with the system size. Sample-based diagonalization (SBD) methods address this problem by projecting the Hamiltonian onto a subspace spanned by a selected set of basis configurations. In this article, we introduce two neural network-enhanced approaches for SBD: sample-based neural diagonalization (SND) and adaptive-basis SND (AB-SND). Both employ autoregressive neural networks to efficiently sample relevant basis configurations, with AB-SND additionally optimizing a parameterized basis transformation so that the ground-state wave function becomes more concentrated. We consider different classes of basis transformations: single-spin and non-overlapping two-spin rotations, which are tractable on classical computers, and also more expressive global unitaries that can be implemented using quantum circuits. We demonstrate the effectiveness of these techniques on various quantum Ising models, showing that SND achieves high accuracy for concentrated ground states, while AB-SND consistently outperforms both SND and more conventional SBD methods, allowing entering regimes in which the ground state is not concentrated in the original computational basis.

quant-ph

Comparison of variational quantum eigensolvers in light nuclei

Quantum computing is one of the most promising technologies of the near future, and the simulation of quantum many-body systems is a natural application. In this work, we present classical simulations of the ground states of light atomic nuclei within the $p$ shell, from $^{6}$He to $^{10}$B, calculated within the nuclear shell model. We compare the performance of two leading variational quantum eigensolver algorithms: the Unitary Coupled Cluster (UCC) and the Adaptive Derivative-Assembled Pseudo-Trotter (ADAPT) methods, introducing a new metric to quantify the use of quantum resources in each simulation. We find that Slater determinants are the most useful reference states for both approaches. Our analysis suggests that ADAPT is more efficient for nuclei close to magic numbers, while UCC tends to require fewer resources toward the mid shell. This work lays the groundwork for robust benchmarking of quantum algorithms in nuclear structure studies.

nucl-th

A Quantum Annealing Protocol to Solve the Nuclear Shell Model

The nuclear shell model accurately describes the structure and dynamics of atomic nuclei. However, the exponential scaling of the basis size with the number of degrees of freedom hampers a direct numerical solution for heavy nuclei. In this work, we present a quantum annealing protocol to obtain nuclear ground states. We propose a tailored driver Hamiltonian that preserves a large gap and validate our approach in a dozen nuclei with basis sizes up to $10^5$ using classical simulations of the annealing evolution. We explore the relation between the spectral gap and the total time of the annealing protocol, assessing its accuracy by comparing the fidelity and energy relative error to classical benchmarks. While the nuclear Hamiltonian is non-local and thus challenging to implement in current setups, the estimated computational cost of our annealing protocol on quantum circuits is polynomial in the single particle basis size, paving the way to study heavier nuclei.

quant-ph

Solving deep-learning density functional theory via variational autoencoders

In recent years, machine learning models, chiefly deep neural networks, have revealed suited to learn accurate energy-density functionals from data. However, problematic instabilities have been shown to occur in the search of ground-state density profiles via energy minimization. Indeed, any small noise can lead astray from realistic profiles, causing the failure of the learned functional and, hence, strong violations of the variational property. In this article, we employ variational autoencoders to build a compressed, flexible, and regular representation of the ground-state density profiles of various quantum models. Performing energy minimization in this compressed space allows us to avoid both numerical instabilities and variational biases due to excessive constraints. Our tests are performed on one-dimensional single-particle models from the literature in the field and, notably, on a three-dimensional disordered potential. In all cases, the ground-state energies are estimated with errors below the chemical accuracy and the density profiles are accurately reproduced without numerical artifacts.

physics.comp-ph

Deep learning nonlocal and scalable energy functionals for quantum Ising models

Density functional theory (DFT) is routinely employed in material science and in quantum chemistry to simulate weakly correlated electronic systems. Recently, deep learning (DL) techniques have been adopted to develop promising functionals for the strongly correlated regime. DFT can be applied to quantum spin models too, but functionals based on DL have not been developed yet. Here, we investigate DL-based DFTs for random quantum Ising chains, both with nearest-neighbor and up to next-nearest neighbor couplings. Our neural functionals are trained and tested on data produced via the Jordan-Wigner transformation, exact diagonalization, and tensor-network methods. An economical gradient-descent optimization is used to find the ground-state properties of previously unseen Hamiltonian instances. Notably, our non-local functionals drastically improve upon the common local density approximations, and they are designed to be scalable, allowing us to simulate chain sizes much larger than those used for training. The prediction accuracy is analyzed, paying attention to the spatial correlations of the learned functionals and to the role of quantum criticality. Our findings indicate a suitable strategy to extend the reach of other computational methods with a controllable accuracy.

cond-mat.str-el

Accelerating equilibrium spin-glass simulations using quantum annealers via generative deep learning

Adiabatic quantum computers, such as the quantum annealers commercialized by D-Wave Systems Inc., are routinely used to tackle combinatorial optimization problems. In this article, we show how to exploit them to accelerate equilibrium Markov chain Monte Carlo simulations of computationally challenging spin-glass models at low but finite temperatures. This is achieved by training generative neural networks on data produced by a D-Wave quantum annealer, and then using them to generate smart proposals for the Metropolis-Hastings algorithm. In particular, we explore hybrid schemes by combining single spin-flip and neural proposals, as well as D-Wave and classical Monte Carlo training data. The hybrid algorithm outperforms the single spin-flip Metropolis-Hastings algorithm. It is competitive with parallel tempering in terms of correlation times, with the significant benefit of a much shorter equilibration time.

cond-mat.dis-nn

Deep learning density functionals for gradient descent optimization

Machine-learned regression models represent a promising tool to implement accurate and computationally affordable energy-density functionals to solve quantum many-body problems via density functional theory. However, while they can easily be trained to accurately map ground-state density profiles to the corresponding energies, their functional derivatives often turn out to be too noisy, leading to instabilities in self-consistent iterations and in gradient-based searches of the ground-state density profile. We investigate how these instabilities occur when standard deep neural networks are adopted as regression models, and we show how to avoid it using an ad-hoc convolutional architecture featuring an inter-channel averaging layer. The testbed we consider is a realistic model for noninteracting atoms in optical speckle disorder. With the inter-channel average, accurate and systematically improvable ground-state energies and density profiles are obtained via gradient-descent optimization, without instabilities nor violations of the variational principle.

physics.comp-ph