Quantum computing for lattice supersymmetry

TL;DR

This paper explores the application of quantum computing to simulate simple supersymmetric quantum systems, aiming to study real-time dynamics and supersymmetry breaking while addressing current hardware limitations.

Contribution

It introduces quantum algorithms tailored for supersymmetric lattice models and discusses their potential to overcome traditional computational challenges.

Findings

Quantum algorithms can simulate supersymmetric quantum mechanics.

Potential to study real-time dynamics and supersymmetry breaking.

Addresses noise limitations in current quantum devices.

Abstract

Quantum computing promises the possibility of studying the real-time dynamics of nonperturbative 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.