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:2603.18749 · International Symposium on Lattice Field Theory (LATTICE)

Simulating Supersymmetric Quantum Mechanics Using Variational Quantum Algorithms

John Kerfoot, David Schaich, Emanuele Mendicelli

quant-phhep-latSubmitted Mar 19, 2026• Announced Mar 20, 2026• 0 citations
arXivHTMLPDF

Abstract

The study of spontaneous supersymmetry breaking (SSB) on the lattice is obstructed by a severe sign problem. Quantum computing provides a promising alternative approach. In particular, properties of supersymmetry relate SSB to the ground-state energy, which can be probed using hybrid quantum--classical algorithms such as the variational quantum eigensolver (VQE). In this work we present VQE analyses for supersymmetric quantum mechanics with various superpotentials. A key new feature is an adaptive ansatz construction algorithm that reduces the number of variational parameters within our ansätze. This lowers the resource burden on both the classical optimizer and the noisy quantum processor, thereby improving the feasibility of these calculations in the NISQ era. Additionally, we present preliminary VQE results obtained from real IBM quantum devices, highlighting accuracy, resource constraints, and computational cost, both with and without the application of error mitigation techniques.

Comments
10 pages, 2 figures, Contribution to the 42nd International Symposium on Lattice Field Theory (LATTICE2025)

Related papers

The Cost of Improving the Precision of the Variational Quantum Eigensolver for Quantum Chemistry

Ivana Miháliková, Matej Pivoluska, Martin Plesch +3 more

New approaches into computational quantum chemistry can be developed through the use of quantum computing. While universal, fault-tolerant quantum computers are still not available, and we want to utilize today's noisy quantum processors. One of their flagship applications is the variational quantum eigensolver (VQE)-an algorithm for calculating the minimum energy of a physical Hamiltonian. In this study, we investigate how various types of errors affect the VQE and how to efficiently use the available resources to produce precise computational results. We utilize a simulator of a noisy quantum device, an exact statevector simulator, and physical quantum hardware to study the VQE algorithm for molecular hydrogen. We find that the optimal method of running the hybrid classical-quantum optimization is to: (i) allow some noise in intermediate energy evaluations, using fewer shots per step and fewer optimization iterations, but ensure a high final readout precision; (ii) emphasize efficient problem encoding and ansatz parametrization; and (iii) run all experiments within a short time-frame, avoiding parameter drift with time. Nevertheless, current publicly available quantum resources are still very noisy and scarce/expensive, and even when using them efficiently, it is quite difficult to perform trustworthy calculations of molecular energies.

arXiv:2111.04965•Nanomaterials•Jan 14, 2022•26 citations

Towards quantum simulation of lower-dimensional supersymmetric lattice models

Emanuele Mendicelli, David Schaich

Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle physics and fostering connections to theories of quantum gravity. However, lattice studies exploring the non-perturbative features of these models, such as spontaneous supersymmetry breaking and real-time evolution encounter significant challenges, particularly due to the infamous sign problem. The sign problem obstructs simulations on classical computers, especially when dealing with high-dimensional lattice systems. While one potential solution is to adopt the Hamiltonian formalism, this approach necessitates an exponential increase in classical resources with the number of lattice sites and degrees of freedom, rendering it impractical for large systems. In contrast, quantum hardware offers a promising alternative, as it requires in principle a polynomial amount of resources, making the study of these models more accessible. In this context, we explore the encoding of lower-dimensional supersymmetric quantum mechanics onto qubits. We also highlight our ongoing efforts to implement and check the model supersymmetry breaking on an IBM gate-based quantum simulator with and without shot noise, addressing the technical challenges we face and the potential implications of our findings for advancing our understanding of supersymmetry.

International Symposium on Lattice Field Theory (LATTICE)•Dec 6, 2024•1 citation

Quantum computing for lattice supersymmetry

Chris Culver, David Schaich

Quantum computing promises the possibility of studying the real-time dynamics of non-perturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices are severely limited by noise, making investigations of simple low-dimensional lattice systems ideal testbeds for algorithm development. Considering simple supersymmetric systems, such as supersymmetric quantum mechanics with different superpotentials, allows for the analysis of phenomena like dynamical supersymmetry breaking. We present ongoing work applying quantum computing techniques to study such theories, targeting real-time dynamics and supersymmetry breaking effects.

arXiv:2112.07651•International Symposium on Lattice Field Theory (LATTICE)•May 16, 2022•13 citations

Towards Quantum Simulation of Lower-Dimensional Supersymmetric Lattice Models

Emanuele Mendicelli, David Schaich

Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle physics and fostering connections to theories of quantum gravity. However, lattice studies exploring the non-perturbative features of these models, such as spontaneous supersymmetry breaking and real-time evolution encounter significant challenges, particularly due to the infamous sign problem. The sign problem obstructs simulations on classical computers, especially when dealing with high-dimensional lattice systems. While one potential solution is to adopt the Hamiltonian formalism, this approach necessitates an exponential increase in classical resources with the number of lattice sites and degrees of freedom, rendering it impractical for large systems. In contrast, quantum hardware offers a promising alternative, as it requires in principle a polynomial amount of resources, making the study of these models more accessible. In this context, we explore the encoding of lower-dimensional supersymmetric quantum mechanics onto qubits. We also highlight our ongoing efforts to implement and check the model supersymmetry breaking on an IBM gate-based quantum simulator with and without shot noise, addressing the technical challenges we face and the potential implications of our findings for advancing our understanding of supersymmetry.

arXiv:2411.15083•Qeios•Nov 27, 2024•1 citation

A Unified Benchmarking Study of Variational Quantum Eigensolver Ansatz for Electronic Structure Problems

Julie Maria Raju, Abhoy Kole, Julen Larrucea +3 more

Electronic structure calculations become computationally expensive on classical computers as electron correlation increases. Quantum computing offers a promising alternative through hybrid quantum-classical Variational Quantum Eigensolver (VQE) on Noisy-Intermediate Scale Quantum (NISQ) devices. The choice of ansatz plays a pivotal role in the performance and scalability of the VQE, yet selecting an optimal ansatz remains challenging. Existing approaches including chemically inspired ansatz, adaptive schemes and Hardware Efficient Ansätze (HEA) lack a unified comparison. This gap makes the scalability and trade-offs of each method unclear for varying molecular sizes. This work presents a systematic benchmarking study comparing Unitary Couples Cluster Singles and Doubles Ansatz (UCCSD), fermionic ADAPT-VQE, BasicPCA HEA, and Excitation Preserving HEA across molecules of varying size like $H_2$, $LiH$, $N_2$. We evaluate trade-offs among circuit depth, parameter count, ground-state energy error, and NISQ feasibility. ADAPT-VQE achieves accuracy comparable to UCCSD with lower resource overhead, but becomes impractical for modest system sizes ($\sim$10 electrons) due to increasing circuit complexity. In contrast, HEA reduces hardware costs but requires more parameters and sacrifices accuracy, with performance strongly dependent on molecular size. The Excitation Preserving ansatz remains below chemical accuracy for $H_2$ and $LiH$, and fails for $N_2$, underscoring the need to balance expressibility and trainability. Overall, these results highlight key trade-offs between accuracy and resource efficiency across VQE ansätze, emphasizing the need to improve ADAPT-VQE scalability and HEA accuracy while addressing optimization challenges for near-term quantum hardware.

arXiv:2611.15365•Nov 11, 2026•0 citations

Limitations of quantum hardware for molecular energy estimation using VQE

Abel Carreras, Román Orús, David Casanova

Variational quantum eigensolvers (VQEs) are among the most promising quantum algorithms for solving electronic structure problems in quantum chemistry, particularly during the noisy intermediate-scale quantum (NISQ) era. In this study, we investigate the capabilities and limitations of VQE algorithms implemented on current quantum hardware for determining molecular ground-state energies, focusing on the adaptive derivative-assembled pseudo-Trotter ansatz VQE (ADAPT-VQE). To address the significant computational challenges posed by molecular Hamiltonians, we explore various well known strategies to simplify the Hamiltonian, optimize the ansatz, and improve classical parameter optimization through modifications of the COBYLA optimizer. These enhancements are integrated into a tailored quantum computing implementation designed to minimize the circuit depth and computational cost. Using benzene as a benchmark system, we demonstrate the application of these optimizations on an IBM quantum computer. Despite these improvements, our results highlight the limitations imposed by current quantum hardware, particularly the impact of quantum noise on state preparation and energy measurement. The noise levels in today's devices prevent meaningful evaluations of molecular Hamiltonians with sufficient accuracy to produce reliable quantum chemical insights. Finally, we extrapolate the requirements for future quantum hardware to enable practical and scalable quantum chemistry calculations using VQE algorithms. This work provides an assessment of current quantum algorithms for molecular modeling on real quantum hardware, highlighting the impact of noise and hardware limitations on the achievable accuracy.

arXiv:2506.03995•Physical Chemistry Chemical Physics•Jan 1, 2026•10 citations
The study of spontaneous supersymmetry breaking (SSB) on the lattice is obstructed by a severe sign problem. Quantum computing provides a promising alternative approach. In particular, properties of supersymmetry relate SSB to the ground-state energy, which can be probed using hybrid quantum--classical algorithms such as the variational quantum eigensolver (VQE). In this work we present VQE analyses for supersymmetric quantum mechanics with various superpotentials. A key new feature is an adaptive ansatz construction algorithm that reduces the number of variational parameters within our ansätze. This lowers the resource burden on both the classical optimizer and the noisy quantum processor, thereby improving the feasibility of these calculations in the NISQ era. Additionally, we present preliminary VQE results obtained from real IBM quantum devices, highlighting accuracy, resource constraints, and computational cost, both with and without the application of error mitigation techniques.
New approaches into computational quantum chemistry can be developed through the use of quantum computing. While universal, fault-tolerant quantum computers are still not available, and we want to utilize today's noisy quantum processors. One of their flagship applications is the variational quantum eigensolver (VQE)-an algorithm for calculating the minimum energy of a physical Hamiltonian. In this study, we investigate how various types of errors affect the VQE and how to efficiently use the available resources to produce precise computational results. We utilize a simulator of a noisy quantum device, an exact statevector simulator, and physical quantum hardware to study the VQE algorithm for molecular hydrogen. We find that the optimal method of running the hybrid classical-quantum optimization is to: (i) allow some noise in intermediate energy evaluations, using fewer shots per step and fewer optimization iterations, but ensure a high final readout precision; (ii) emphasize efficient problem encoding and ansatz parametrization; and (iii) run all experiments within a short time-frame, avoiding parameter drift with time. Nevertheless, current publicly available quantum resources are still very noisy and scarce/expensive, and even when using them efficiently, it is quite difficult to perform trustworthy calculations of molecular energies.
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle physics and fostering connections to theories of quantum gravity. However, lattice studies exploring the non-perturbative features of these models, such as spontaneous supersymmetry breaking and real-time evolution encounter significant challenges, particularly due to the infamous sign problem. The sign problem obstructs simulations on classical computers, especially when dealing with high-dimensional lattice systems. While one potential solution is to adopt the Hamiltonian formalism, this approach necessitates an exponential increase in classical resources with the number of lattice sites and degrees of freedom, rendering it impractical for large systems. In contrast, quantum hardware offers a promising alternative, as it requires in principle a polynomial amount of resources, making the study of these models more accessible. In this context, we explore the encoding of lower-dimensional supersymmetric quantum mechanics onto qubits. We also highlight our ongoing efforts to implement and check the model supersymmetry breaking on an IBM gate-based quantum simulator with and without shot noise, addressing the technical challenges we face and the potential implications of our findings for advancing our understanding of supersymmetry.
Quantum computing promises the possibility of studying the real-time dynamics of non-perturbative quantum field theories while avoiding the sign problem that obstructs conventional lattice approaches. Current and near-future quantum devices are severely limited by noise, making investigations of simple low-dimensional lattice systems ideal testbeds for algorithm development. Considering simple supersymmetric systems, such as supersymmetric quantum mechanics with different superpotentials, allows for the analysis of phenomena like dynamical supersymmetry breaking. We present ongoing work applying quantum computing techniques to study such theories, targeting real-time dynamics and supersymmetry breaking effects.
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle physics and fostering connections to theories of quantum gravity. However, lattice studies exploring the non-perturbative features of these models, such as spontaneous supersymmetry breaking and real-time evolution encounter significant challenges, particularly due to the infamous sign problem. The sign problem obstructs simulations on classical computers, especially when dealing with high-dimensional lattice systems. While one potential solution is to adopt the Hamiltonian formalism, this approach necessitates an exponential increase in classical resources with the number of lattice sites and degrees of freedom, rendering it impractical for large systems. In contrast, quantum hardware offers a promising alternative, as it requires in principle a polynomial amount of resources, making the study of these models more accessible. In this context, we explore the encoding of lower-dimensional supersymmetric quantum mechanics onto qubits. We also highlight our ongoing efforts to implement and check the model supersymmetry breaking on an IBM gate-based quantum simulator with and without shot noise, addressing the technical challenges we face and the potential implications of our findings for advancing our understanding of supersymmetry.
Electronic structure calculations become computationally expensive on classical computers as electron correlation increases. Quantum computing offers a promising alternative through hybrid quantum-classical Variational Quantum Eigensolver (VQE) on Noisy-Intermediate Scale Quantum (NISQ) devices. The choice of ansatz plays a pivotal role in the performance and scalability of the VQE, yet selecting an optimal ansatz remains challenging. Existing approaches including chemically inspired ansatz, adaptive schemes and Hardware Efficient Ansätze (HEA) lack a unified comparison. This gap makes the scalability and trade-offs of each method unclear for varying molecular sizes. This work presents a systematic benchmarking study comparing Unitary Couples Cluster Singles and Doubles Ansatz (UCCSD), fermionic ADAPT-VQE, BasicPCA HEA, and Excitation Preserving HEA across molecules of varying size like H2H_2H2​, LiHLiHLiH, N2N_2N2​. We evaluate trade-offs among circuit depth, parameter count, ground-state energy error, and NISQ feasibility. ADAPT-VQE achieves accuracy comparable to UCCSD with lower resource overhead, but becomes impractical for modest system sizes ($\sim$10 electrons) due to increasing circuit complexity. In contrast, HEA reduces hardware costs but requires more parameters and sacrifices accuracy, with performance strongly dependent on molecular size. The Excitation Preserving ansatz remains below chemical accuracy for H2H_2H2​ and LiHLiHLiH, and fails for N2N_2N2​, underscoring the need to balance expressibility and trainability. Overall, these results highlight key trade-offs between accuracy and resource efficiency across VQE ansätze, emphasizing the need to improve ADAPT-VQE scalability and HEA accuracy while addressing optimization challenges for near-term quantum hardware.
Variational quantum eigensolvers (VQEs) are among the most promising quantum algorithms for solving electronic structure problems in quantum chemistry, particularly during the noisy intermediate-scale quantum (NISQ) era. In this study, we investigate the capabilities and limitations of VQE algorithms implemented on current quantum hardware for determining molecular ground-state energies, focusing on the adaptive derivative-assembled pseudo-Trotter ansatz VQE (ADAPT-VQE). To address the significant computational challenges posed by molecular Hamiltonians, we explore various well known strategies to simplify the Hamiltonian, optimize the ansatz, and improve classical parameter optimization through modifications of the COBYLA optimizer. These enhancements are integrated into a tailored quantum computing implementation designed to minimize the circuit depth and computational cost. Using benzene as a benchmark system, we demonstrate the application of these optimizations on an IBM quantum computer. Despite these improvements, our results highlight the limitations imposed by current quantum hardware, particularly the impact of quantum noise on state preparation and energy measurement. The noise levels in today's devices prevent meaningful evaluations of molecular Hamiltonians with sufficient accuracy to produce reliable quantum chemical insights. Finally, we extrapolate the requirements for future quantum hardware to enable practical and scalable quantum chemistry calculations using VQE algorithms. This work provides an assessment of current quantum algorithms for molecular modeling on real quantum hardware, highlighting the impact of noise and hardware limitations on the achievable accuracy.