Exploring lattice supersymmetry with variational quantum deflation
David Schaich, Christopher Culver
TL;DR
This paper investigates how quantum computing, specifically the variational quantum deflation algorithm, can be used to study spontaneous supersymmetry breaking in lattice models, potentially overcoming classical sign problems.
Contribution
It explores the application of variational quantum deflation to lower-dimensional lattice supersymmetry models, advancing quantum approaches to supersymmetry breaking.
Findings
Potential of quantum algorithms to study supersymmetry breaking
Application of variational quantum deflation to lattice models
Addressing sign problems in lattice supersymmetry
Abstract
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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.