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:2412.06979 · IEEE Computer Society Annual Symposium on VLSI

Efficacious Qubit Mappings for Quantum Simulations of the12C Rotational Band

Darin C. Mumma, Z. H. Sun, Alexis Mercenne, Kristina D. Launey, Soorya Rethinasamy, James A. Sauls

Published Jul 1, 2024• 0 citations
arXivHTMLPDF

Abstract

Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the space they occupy. We present first quantum simulations based on the variational quantum eigensolver for the low-lying structure of the12C nucleus that provide acceptable bound-state energies even in the presence of noise. We achieve this by taking advantage of two critical developments. First, we utilize an almost perfect symmetry of atomic nuclei that, in a complete symmetry-adapted basis, drastically reduces the size of the model space. Second, we use the efficacious Gray encoding, for which it has been recently shown that it is resource efficient, especially when coupled with a near band -diagonal structure of the nuclear Hamiltonian.

DOI
10.1109/isvlsi61997.2024.00119

Related papers

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

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

Qubit-efficient variational algorithm for nuclear structure

Chandan Sarma, Paul Stevenson

In this work, we compare three qubit-mapping strategies to study the structure of the nuclear ground state within the shell model description employing the Variational Quantum Eigensolver (VQE) approach. Although the initial point for different mappings is a Hamiltonian matrix in many-body particle basis or Slater determinant (SD) basis, the structure of the trial wavefunction and resource counts are different for each mapping. These three mappings are tested for a mid $p$-shell nucleus $^{10}$B and compared the quantum resources required to find the ground state for each mapping. Further, we extend the qubit-efficient mapping to study the ground state of one more mid $p$-shell nucleus $^{12}$C. We run circuits up to 26-qubits representing their ground states on a noisy simulator (IBM's FakeFez backend) and quantum hardware ($ibm\_fez$). The best post-error mitigated results from the hardware for $^{10}$B ground state is obtained following SD to qubit mapping with a percent error of 0.21 \%. The percent errors for the same state following cSD and pnSD mapping are 3.37 and 8.88 \%, respectively. On the other hand, following the cSD mapping, the post-error mitigated ground state energy of $^{12}$C is 6.82 \% away from the exact result. We further evaluate the fidelity of the VQE wavefunctions obtained from hardware with respect to the shell model wavefunctions for the cSD mapping. This cSD mapping can be useful for scaling the VQE algorithm for complex nuclei across different mass regions in terms of qubit efficiency.

nucl-thCross-listedarXiv:2605.30261•May 29, 2026•0 citations

Improving Hamiltonian encodings with the Gray code

Olivia Di Matteo, Anna E. McCoy, Peter Gysbers +3 more

Due to the limitations of present-day quantum hardware, it is especially critical to design algorithms that make the best possible use of available resources. When simulating quantum many-body systems on a quantum computer, straightforward encodings that transform many-body Hamiltonians into qubit Hamiltonians use $N$ of the available basis states of an $N$-qubit system, whereas ${2}^{N}$ are in theory available. We explore an efficient encoding that uses the entire set of basis states, where terms in the Hamiltonian are mapped to qubit operators with a Hamiltonian that acts on the basis states in Gray code order. This encoding is applied to the commonly studied problem of finding the ground-state energy of a deuteron with a simulated variational quantum eigensolver (VQE). It is compared to a standard ``one-hot'' encoding, and various trade-offs that arise are analyzed. The energy distribution of VQE solutions has smaller variance than the one obtained by the one-hot encoding even in the presence of simulated hardware noise, despite an increase in the number of measurements. The reduced number of qubits and a shorter-depth variational Ansatz enables the encoding of larger problems on current-generation machines. This encoding also demonstrates improvements for simulating time evolution of the same system, producing circuits for the evolution operators with reduced depth and roughly half the number of gates compared to a one-hot encoding.

arXiv:2008.05012•Physical Review A•Apr 2, 2021•74 citations

Variance minimisation on a quantum computer for nuclear structure

Isaac Hobday, P. D. Stevenson, James Benstead

Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today's quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian, $\langle H^2\rangle - \langle H\rangle ^2$, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.

arXiv:2209.07820•Sep 16, 2022•1 citation

Nuclear shell-model simulation in digital quantum computers

Axel Pérez-Obiol, A. M. Romero, J. Menéndez +3 more

The nuclear shell model is one of the prime many-body methods to study the structure of atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number of particles increases. We present a shell-model quantum circuit design strategy to find nuclear ground states by exploiting an adaptive variational quantum eigensolver algorithm. Our circuit implementation is in excellent agreement with classical shell-model simulations for a dozen of light and medium-mass nuclei, including neon and calcium isotopes. We quantify the circuit depth, width and number of gates to encode realistic shell-model wavefunctions. Our strategy also addresses explicitly energy measurements and the required number of circuits to perform them. Our simulated circuits approach the benchmark results exponentially with a polynomial scaling in quantum resources for each nucleus. This work paves the way for quantum computing shell-model studies across the nuclear chart and our quantum resource quantification may be used in configuration-interaction calculations of other fermionic systems.

arXiv:2302.03641•Scientific Reports•Jul 29, 2023•48 citations
Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the space they occupy. We present first quantum simulations based on the variational quantum eigensolver for the low-lying structure of the12C nucleus that provide acceptable bound-state energies even in the presence of noise. We achieve this by taking advantage of two critical developments. First, we utilize an almost perfect symmetry of atomic nuclei that, in a complete symmetry-adapted basis, drastically reduces the size of the model space. Second, we use the efficacious Gray encoding, for which it has been recently shown that it is resource efficient, especially when coupled with a near band -diagonal structure of the nuclear Hamiltonian.
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 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.
In this work, we compare three qubit-mapping strategies to study the structure of the nuclear ground state within the shell model description employing the Variational Quantum Eigensolver (VQE) approach. Although the initial point for different mappings is a Hamiltonian matrix in many-body particle basis or Slater determinant (SD) basis, the structure of the trial wavefunction and resource counts are different for each mapping. These three mappings are tested for a mid ppp-shell nucleus 10^{10}10B and compared the quantum resources required to find the ground state for each mapping. Further, we extend the qubit-efficient mapping to study the ground state of one more mid ppp-shell nucleus 12^{12}12C. We run circuits up to 26-qubits representing their ground states on a noisy simulator (IBM's FakeFez backend) and quantum hardware (ibm_fezibm\_fezibm_fez). The best post-error mitigated results from the hardware for 10^{10}10B ground state is obtained following SD to qubit mapping with a percent error of 0.21 \%. The percent errors for the same state following cSD and pnSD mapping are 3.37 and 8.88 \%, respectively. On the other hand, following the cSD mapping, the post-error mitigated ground state energy of 12^{12}12C is 6.82 \% away from the exact result. We further evaluate the fidelity of the VQE wavefunctions obtained from hardware with respect to the shell model wavefunctions for the cSD mapping. This cSD mapping can be useful for scaling the VQE algorithm for complex nuclei across different mass regions in terms of qubit efficiency.
Due to the limitations of present-day quantum hardware, it is especially critical to design algorithms that make the best possible use of available resources. When simulating quantum many-body systems on a quantum computer, straightforward encodings that transform many-body Hamiltonians into qubit Hamiltonians use NNN of the available basis states of an NNN-qubit system, whereas 2N{2}^{N}2N are in theory available. We explore an efficient encoding that uses the entire set of basis states, where terms in the Hamiltonian are mapped to qubit operators with a Hamiltonian that acts on the basis states in Gray code order. This encoding is applied to the commonly studied problem of finding the ground-state energy of a deuteron with a simulated variational quantum eigensolver (VQE). It is compared to a standard ``one-hot'' encoding, and various trade-offs that arise are analyzed. The energy distribution of VQE solutions has smaller variance than the one obtained by the one-hot encoding even in the presence of simulated hardware noise, despite an increase in the number of measurements. The reduced number of qubits and a shorter-depth variational Ansatz enables the encoding of larger problems on current-generation machines. This encoding also demonstrates improvements for simulating time evolution of the same system, producing circuits for the evolution operators with reduced depth and roughly half the number of gates compared to a one-hot encoding.
Quantum computing opens up new possibilities for the simulation of many-body nuclear systems. As the number of particles in a many-body system increases, the size of the space if the associated Hamiltonian increases exponentially. This presents a challenge when performing calculations on large systems when using classical computing methods. By using a quantum computer, one may be able to overcome this difficulty thanks to the exponential way the Hilbert space of a quantum computer grows with the number of quantum bits (qubits). Our aim is to develop quantum computing algorithms which can reproduce and predict nuclear structure such as level schemes and level densities. As a sample Hamiltonian, we use the Lipkin-Meshkov-Glick model. We use an efficient encoding of the Hamiltonian onto many-qubit systems, and have developed an algorithm allowing the full excitation spectrum of a nucleus to be determined with a variational algorithm capable of implementation on today's quantum computers with a limited number of qubits. Our algorithm uses the variance of the Hamiltonian, ⟨H2⟩−⟨H⟩2\langle H^2\rangle - \langle H\rangle ^2⟨H2⟩−⟨H⟩2, as a cost function for the widely-used variational quantum eigensolver (VQE). In this work we present a variance based method of finding the excited state spectrum of a small nuclear system using a quantum computer, using a reduced-qubit encoding method.
The nuclear shell model is one of the prime many-body methods to study the structure of atomic nuclei, but it is hampered by an exponential scaling on the basis size as the number of particles increases. We present a shell-model quantum circuit design strategy to find nuclear ground states by exploiting an adaptive variational quantum eigensolver algorithm. Our circuit implementation is in excellent agreement with classical shell-model simulations for a dozen of light and medium-mass nuclei, including neon and calcium isotopes. We quantify the circuit depth, width and number of gates to encode realistic shell-model wavefunctions. Our strategy also addresses explicitly energy measurements and the required number of circuits to perform them. Our simulated circuits approach the benchmark results exponentially with a polynomial scaling in quantum resources for each nucleus. This work paves the way for quantum computing shell-model studies across the nuclear chart and our quantum resource quantification may be used in configuration-interaction calculations of other fermionic systems.