Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2604.11381

Improved quasiparticle nuclear Hamiltonians for quantum computing

Emanuele Costa, Javier Menendez

nucl-thquant-phSubmitted Apr 13, 2026• Announced Apr 14, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Comments
12 pages, 6 figures

Related papers

Quasiparticle pairing encoding of atomic nuclei for quantum annealing

Emanuele Costa, Axel Pérez-Obiol, J. Menéndez +3 more

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.

arXiv:2510.10118•Physics Letters B•Nov 30, 2025•5 citations

A low-circuit-depth quantum computing approach to the nuclear shell model

Chandan Sarma, P. D. Stevenson

Abstract In this work, we introduce a new qubit mapping strategy for the Variational Quantum Eigensolver (VQE) applied to nuclear shell model calculations, where each Slater Determinant (SD) is mapped to a qubit, rather than assigning qubits to individual single-particle states. While this approach may increase the total number of qubits required in some cases, it enables the construction of simpler quantum circuits that are more compatible with current noisy intermediate-scale quantum (NISQ) devices. We apply this method to seven nuclei: Four lithium isotopes $${}^{6-9}$$ Li from the p -shell, $${}^{18}$$ F from the sd -shell, and two heavier nuclei ( $${}^{210}$$ Po, and $${}^{210}$$ Pb). We run circuits representing their ground states on a noisy simulator (IBM’s FakeFez backend) and quantum hardware ( $$ibm\_pittsburgh$$ ). For heavier nuclei, we demonstrate the feasibility of simulating $${}^{210}$$ Po and $${}^{210}$$ Pb as 22- and 29-qubit systems, respectively. Additionally, we employ Zero-Noise Extrapolation (ZNE) via two-qubit gate folding to mitigate errors in both simulated and hardware-executed results. Post-mitigation, the best results show less than 4 % deviation from shell model binding energy predictions across all nuclei studied. This SD-based qubit mapping proves particularly effective for lighter nuclei and two-nucleon systems, offering a promising route for near-term quantum simulations in nuclear physics.

arXiv:2510.02124•Discover Quantum Science•Feb 17, 2026•2 citations

Advancing quantum simulations of the nuclear shell model with Gray-code–based resource-efficient protocols

Nifeeya Singh, Pooja Siwach, P. Arumugam

Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei, is one such case with high demand for resources as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. We aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. We achieve noise resilience by designing an optimized ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray code encoding and generalizing transformations of fermionic operators to efficiently represent manybody states. By employing the noise-resilient protocols, we achieve the ground and excited state energy levels of 38Ar and 6Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan Wigner and Gray code encoding using VQE, qubit-ADAPT-VQE, and VQD. Our work highlights the potential of noise-resilient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations.

arXiv:2504.11689•Physical Review C•Aug 15, 2025•8 citations

A low-circuit-depth quantum computing approach to the nuclear shell model

P. D. Stevenson, Chandan Sarma

Abstract In this work, we introduce a new qubit mapping strategy for the Variational Quantum Eigensolver (VQE) applied to nuclear shell model calculations, where each Slater determinant (SD) is mapped to a qubit, rather than assigning qubits to individual single-particle states. While this approach may increase the total number of qubits required in some cases, it enables the construction of simpler quantum circuits that are more compatible with current noisy intermediate-scale quantum (NISQ) devices. We apply this method to seven nuclei: Four lithium isotopes $^{6-9}$Li from the \textit{p}-shell, $^{18}$F from the \textit{sd}-shell, and two heavier nuclei ($^{210}$Po, and $^{210}$Pb). We run circuits representing their ground states on a noisy simulator (IBM's \textit{FakeFez} backend) and quantum hardware ($ibm\_pittsburgh$). For heavier nuclei, we demonstrate the feasibility of simulating $^{210}$Po and $^{210}$Pb as 22- and 29-qubit systems, respectively. Additionally, we employ Zero-Noise Extrapolation (ZNE) via two-qubit gate folding to mitigate errors in both simulated and hardware-executed results. Post-mitigation, the best results show less than 4 \% deviation from shell model predictions across all nuclei studied. This SD-based qubit mapping proves particularly effective for lighter nuclei and two-nucleon systems, offering a promising route for near-term quantum simulations in nuclear physics. PACS numbers: 21.60.Cs, 21.30.Fe, 21.10.Dr, 27.20.+n

•Nov 4, 2025•1 citation

Fault-tolerant quantum algorithms for simulating atomic nuclei

James Benstead, Michael Garn, Neil Gaspar +5 more

To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for $^{32}$Mg and $^{219}$At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to $^{40}$Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.

quant-pharXiv:2607.21563•Jul 24, 2026•0 citations

Neutron–nucleus dynamics simulations for quantum computers

Soorya Rethinasamy, Ethan Guo, Alexander Wei +2 more

Abstract With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron–nucleus simulations with general potentials, which provides acceptable bound-state energies even in the presence of noise, through the noise-resilient (NR) training method. In particular, the algorithm can now solve for any band-diagonal to full Hamiltonian matrices, as needed to accommodate a general central potential. While we illustrate the approach for exponential Gaussian-like potentials and ab initio inter-cluster potentials (optical potentials), it can also accommodate the complete form of the chiral effective-field-theory nucleon–nucleon potentials used in ab initio nuclear calculations. In this study, we provide a comprehensive analysis for the efficacy of this approach for three different qubit encodings, including the one-hot, binary, and Gray encodings, in terms of the number of Pauli strings and commuting sets involved. We also discuss the advantages of the algorithm for Hamiltonians of various band-diagonal widths, especially critical for potentials of perturbative nature, leading to a drastically reduced runtime of quantum simulations. We prove that the Gray encoding allows for an efficient scaling of the model-space size N (or number of basis states used) and is more resource efficient for band-diagonal Hamiltonians having bandwidth up to N . We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity (QC) scheme. We lay out the explicit grouping of Pauli strings and the diagonalizing unitary under the DGC scheme, and we prove that it outperforms the QC scheme, at the cost of a more complex diagonalizing unitary. Lastly, we provide first solutions of the neutron–alpha dynamics from quantum simulations suitable for noisy intermediate-scale quantum processors, using an optical potential rooted in first principles, as well as a study of the bound-state physics in neutron–Carbon systems, along with a comparison of the efficacy of the one-hot and Gray encodings.

arXiv:2402.14680•Quantum Science and Technology•Dec 22, 2025•5 citations
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 sdsdsd shell, reaching an energy relative error below 0.2%0.2\%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%2\%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.
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.
Abstract In this work, we introduce a new qubit mapping strategy for the Variational Quantum Eigensolver (VQE) applied to nuclear shell model calculations, where each Slater Determinant (SD) is mapped to a qubit, rather than assigning qubits to individual single-particle states. While this approach may increase the total number of qubits required in some cases, it enables the construction of simpler quantum circuits that are more compatible with current noisy intermediate-scale quantum (NISQ) devices. We apply this method to seven nuclei: Four lithium isotopes 6−9{}^{6-9}6−9 Li from the p -shell, 18{}^{18}18 F from the sd -shell, and two heavier nuclei ( 210{}^{210}210 Po, and 210{}^{210}210 Pb). We run circuits representing their ground states on a noisy simulator (IBM’s FakeFez backend) and quantum hardware ( ibm_pittsburghibm\_pittsburghibm_pittsburgh ). For heavier nuclei, we demonstrate the feasibility of simulating 210{}^{210}210 Po and 210{}^{210}210 Pb as 22- and 29-qubit systems, respectively. Additionally, we employ Zero-Noise Extrapolation (ZNE) via two-qubit gate folding to mitigate errors in both simulated and hardware-executed results. Post-mitigation, the best results show less than 4 % deviation from shell model binding energy predictions across all nuclei studied. This SD-based qubit mapping proves particularly effective for lighter nuclei and two-nucleon systems, offering a promising route for near-term quantum simulations in nuclear physics.
Some of the computational limitations in solving the nuclear many-body problem could be overcome by utilizing quantum computers. The nuclear shell-model calculations providing deeper insights into the properties of atomic nuclei, is one such case with high demand for resources as the size of the Hilbert space grows exponentially with the number of particles involved. Quantum algorithms are being developed to overcome these challenges and advance such calculations. To develop quantum circuits for the nuclear shell-model, leveraging the capabilities of noisy intermediate-scale quantum (NISQ) devices. We aim to minimize resource requirements (specifically in terms of qubits and gates) and strive to reduce the impact of noise by employing relevant mitigation techniques. We achieve noise resilience by designing an optimized ansatz for the variational quantum eigensolver (VQE) based on Givens rotations and incorporating qubit-ADAPT-VQE in combination with variational quantum deflation (VQD) to compute ground and excited states incorporating the zero-noise extrapolation mitigation technique. Furthermore, the qubit requirements are significantly reduced by mapping the basis states to qubits using Gray code encoding and generalizing transformations of fermionic operators to efficiently represent manybody states. By employing the noise-resilient protocols, we achieve the ground and excited state energy levels of 38Ar and 6Li with better accuracy. These energy levels are presented for noiseless simulations, noisy conditions, and after applying noise mitigation techniques. Results are compared for Jordan Wigner and Gray code encoding using VQE, qubit-ADAPT-VQE, and VQD. Our work highlights the potential of noise-resilient protocols to leverage the full potential of NISQ devices in scaling the nuclear shell model calculations.
Abstract In this work, we introduce a new qubit mapping strategy for the Variational Quantum Eigensolver (VQE) applied to nuclear shell model calculations, where each Slater determinant (SD) is mapped to a qubit, rather than assigning qubits to individual single-particle states. While this approach may increase the total number of qubits required in some cases, it enables the construction of simpler quantum circuits that are more compatible with current noisy intermediate-scale quantum (NISQ) devices. We apply this method to seven nuclei: Four lithium isotopes 6−9^{6-9}6−9Li from the \textit{p}-shell, 18^{18}18F from the \textit{sd}-shell, and two heavier nuclei (210^{210}210Po, and 210^{210}210Pb). We run circuits representing their ground states on a noisy simulator (IBM's \textit{FakeFez} backend) and quantum hardware (ibm_pittsburghibm\_pittsburghibm_pittsburgh). For heavier nuclei, we demonstrate the feasibility of simulating 210^{210}210Po and 210^{210}210Pb as 22- and 29-qubit systems, respectively. Additionally, we employ Zero-Noise Extrapolation (ZNE) via two-qubit gate folding to mitigate errors in both simulated and hardware-executed results. Post-mitigation, the best results show less than 4 \% deviation from shell model predictions across all nuclei studied. This SD-based qubit mapping proves particularly effective for lighter nuclei and two-nucleon systems, offering a promising route for near-term quantum simulations in nuclear physics. PACS numbers: 21.60.Cs, 21.30.Fe, 21.10.Dr, 27.20.+n
To maximize the value of fault-tolerant quantum computers, it is essential to develop concrete applications beyond well-established domains such as chemistry and condensed-matter physics. Here we construct and compile quantum algorithms to simulate the structure of atomic nuclei -- a topic that has received relatively little attention from the quantum computing community despite its similarities to the electronic structure problem in chemistry -- via effective shell-model Hamiltonians and no-core-shell-model Hamiltonians with three-body interactions derived from chiral effective field theory. Furthermore, we provide quantum resource estimates, in terms of Toffoli gate and qubit counts, for these algorithms, which, to our knowledge, are the first such estimates for fault-tolerant quantum simulation of atomic nuclei. Notably, the estimates for 32^{32}32Mg and 219^{219}219At shell-model Hamiltonians are comparable to recent estimates of Femoco simulations, a standard benchmark in chemistry. For no-core-shell-model Hamiltonians suitable for light nuclei (up to 40^{40}40Ca or so), we find that resource requirements are significantly higher, suggesting that more bespoke strategies are required to make such simulations practicable. Throughout this work, we draw upon the similarities between nuclear and electronic structure problems, while also highlighting challenges that are specific to the former. We hope this work will spur long-term collaborations between the nuclear and quantum computing community with the ultimate goal of realizing useful nuclear simulations on quantum computers.
Abstract With a view toward addressing the explosive growth in the computational demands of nuclear structure and reactions modeling, we develop a novel quantum algorithm for neutron–nucleus simulations with general potentials, which provides acceptable bound-state energies even in the presence of noise, through the noise-resilient (NR) training method. In particular, the algorithm can now solve for any band-diagonal to full Hamiltonian matrices, as needed to accommodate a general central potential. While we illustrate the approach for exponential Gaussian-like potentials and ab initio inter-cluster potentials (optical potentials), it can also accommodate the complete form of the chiral effective-field-theory nucleon–nucleon potentials used in ab initio nuclear calculations. In this study, we provide a comprehensive analysis for the efficacy of this approach for three different qubit encodings, including the one-hot, binary, and Gray encodings, in terms of the number of Pauli strings and commuting sets involved. We also discuss the advantages of the algorithm for Hamiltonians of various band-diagonal widths, especially critical for potentials of perturbative nature, leading to a drastically reduced runtime of quantum simulations. We prove that the Gray encoding allows for an efficient scaling of the model-space size N (or number of basis states used) and is more resource efficient for band-diagonal Hamiltonians having bandwidth up to N . We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity (QC) scheme. We lay out the explicit grouping of Pauli strings and the diagonalizing unitary under the DGC scheme, and we prove that it outperforms the QC scheme, at the cost of a more complex diagonalizing unitary. Lastly, we provide first solutions of the neutron–alpha dynamics from quantum simulations suitable for noisy intermediate-scale quantum processors, using an optical potential rooted in first principles, as well as a study of the bound-state physics in neutron–Carbon systems, along with a comparison of the efficacy of the one-hot and Gray encodings.