Comparison of variational quantum eigensolvers in light nuclei

• URL: http://arxiv.org/abs/2507.13819v1
• Date: Fri, 18 Jul 2025 11:08:57 GMT
• Title: Comparison of variational quantum eigensolvers in light nuclei
• Authors: Miquel Carrasco-Codina, Emanuele Costa, Antonio Márquez Romero, Javier Menéndez, Arnau Rios,
• Abstract summary: We present classical simulations of the ground states of light atomic nuclei within the $p$ shell.<n>We compare the performance of two leading variational quantum eigensolver algorithms.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers [0.0]
  We show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states.<n>Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
  arXiv  Detail & Related papers  (2024-04-29T17:14:21Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Nuclear shell-model simulation in digital quantum computers [1.5478949073334747]
  We present a shell-model quantum circuit design strategy to find nuclear ground states. We quantify the circuit depth, width and number of gates to encode realistic shell-model wavefunctions.
  arXiv  Detail & Related papers  (2023-02-07T17:48:19Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Is quantum computing green? An estimate for an energy-efficiency quantum advantage [0.0]
  We show that the green quantum advantage threshold depends on (i) the quality of the experimental quantum gates and (ii) the entanglement generated in the QPU. We compute the green quantum advantage threshold for a few paradigmatic examples in terms of algorithms and hardware platforms.
  arXiv  Detail & Related papers  (2022-05-24T14:14:00Z)
• Phenomenological Theory of Variational Quantum Ground-State Preparation [0.0]
  The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits. We show that the algorithm's success crucially depends on other parameters such as the learning rate. We propose a symmetry-enhanced simulation protocol that should be used if the gap closes.
  arXiv  Detail & Related papers  (2022-05-12T18:00:04Z)
• Quantum algorithms for estimating quantum entropies [6.211541620389987]
  We propose quantum algorithms to estimate the von Neumann and quantum $alpha$-R'enyi entropies of an fundamental quantum state. We also show how to efficiently construct the quantum entropy circuits for quantum entropy estimation using single copies of the input state.
  arXiv  Detail & Related papers  (2022-03-04T15:44:24Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Variational Monte Carlo calculations of $\mathbf{A\leq 4}$ nuclei with an artificial neural-network correlator ansatz [62.997667081978825]
  We introduce a neural-network quantum state ansatz to model the ground-state wave function of light nuclei. We compute the binding energies and point-nucleon densities of $Aleq 4$ nuclei as emerging from a leading-order pionless effective field theory Hamiltonian.
  arXiv  Detail & Related papers  (2020-07-28T14:52:28Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.