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

Qeios

Towards Quantum Simulation of Lower-Dimensional Supersymmetric Lattice Models

Emanuele Mendicelli, David Schaich

Published Nov 27, 2024• 0 citations
Publisher

Abstract

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.

DOI
10.32388/iesa19

Related papers

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•Nov 22, 2024•0 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•0 citations

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•6 citations

Quantum Computing for the Wess–Zumino Model

Chris Culver, David Schaich

Future quantum computers will enable novel sign-problem-free studies of dynamical phenomena in non-perturbative quantum field theories, including real-time evolution and spontaneous supersymmetry breaking. We are investigating applications of quantum computing to low-dimensional supersymmetric lattice systems that can serve as testbeds for existing and near-future quantum devices. Here we present initial results for the $\mathcal{N} = 1$ Wess--Zumino model in 1+1~dimensions, building on our prior analyses of 0+1-dimensional supersymmetric quantum mechanics. In addition to exploring supersymmetry breaking using the variational quantum eigensolver, we consider the prospects for real-time evolution.

arXiv:2301.02230•International Symposium on Lattice Field Theory (LATTICE)•Feb 3, 2023•1 citation

Simulating Supersymmetric Quantum Mechanics Using Variational Quantum Algorithms

John Kerfoot, David Schaich, Emanuele Mendicelli

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.

quant-pharXiv:2603.18749•Mar 20, 2026•0 citations

Exploring lattice supersymmetry with variational quantum deflation

David Schaich, Chris Culver

Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource requirements, in particular the $\mathcal N = 1$ Wess--Zumino model in 1+1 dimensions, we are exploring ways quantum computing could be used to study spontaneous supersymmetry breaking. A particularly promising recent development is to apply the variational quantum deflation algorithm, which generalizes the variational quantum eigensolver so as to resolve multiple low-energy states.

arXiv:2410.11514•International Symposium on Lattice Field Theory (LATTICE)•Oct 11, 2024•1 citation
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.
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.
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.
Future quantum computers will enable novel sign-problem-free studies of dynamical phenomena in non-perturbative quantum field theories, including real-time evolution and spontaneous supersymmetry breaking. We are investigating applications of quantum computing to low-dimensional supersymmetric lattice systems that can serve as testbeds for existing and near-future quantum devices. Here we present initial results for the N=1\mathcal{N} = 1N=1 Wess--Zumino model in 1+1~dimensions, building on our prior analyses of 0+1-dimensional supersymmetric quantum mechanics. In addition to exploring supersymmetry breaking using the variational quantum eigensolver, we consider the prospects for real-time evolution.
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.
Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource requirements, in particular the N=1\mathcal N = 1N=1 Wess--Zumino model in 1+1 dimensions, we are exploring ways quantum computing could be used to study spontaneous supersymmetry breaking. A particularly promising recent development is to apply the variational quantum deflation algorithm, which generalizes the variational quantum eigensolver so as to resolve multiple low-energy states.