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:2011.01239

Supersymmetry and Quantum Computation

P. Marcos Crichigno

Published Nov 2, 2020• 14 citations
arXivHTMLPDF

Abstract

The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of $\mathcal N \leq 2$ quantum mechanical systems is $\#P$-complete and therefore intractable. Then, the notions of supersymmetry in the space of qubits and supersymmetric quantum circuits are introduced and some of their properties discussed. In particular, it is shown that these define a nontrivial subclass of quantum algorithms with robustness properties typical of supersymmetric systems. Concrete examples, including the supersymmetric SYK model and fermion hard-core models are discussed. Some applications and open questions are suggested.

DOI
10.48550/arxiv.2011.01239

Related papers

Recent Developments in Supersymmetric Quantum Mechanics

Georg Junker

Some recent results in supersymmetric quantum mechanics are presented. New semi-classical approximation formulas for Witten's realization of supersymmetric quantum mechanics are discussed. Implications of the supersymmetric structure of Pauli's Hamiltonian are also considered. In particular, the paramagnetisation of a non-interacting electron gas is related to a modified version of Witten's index. We also show that the supersymmetry in this system provides a new counter example for the paramagnetic conjecture.

arXiv:cond-mat/9403088•Mar 29, 1994•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•13 citations

Tutorial: basic concepts in quantum circuits

J.P. Hayes

Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.

ACM/IEEE Design Automation Conference (DAC)•Mar 2, 2004•0 citations

Tutorial: basic concepts in quantum circuits

John P. Hayes

Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.

ACM/IEEE Design Automation Conference (DAC)•Jan 1, 2003•0 citations

A Study about the Supersymmetry in the context of Quantum Mechanics

Marques, Fabricio

In this work we present an introduction to Supersymmetry in the context of 1-dimensional Quantum Mechanics. For that purpose we develop the concept of hamiltonians factorization using the simple harmonic oscillator as an example, we introduce the supersymmetric oscilator and, next, we generalize these concepts to introduce the fundamentals of Supersymmetric Quantum Mechanics. We also discuss useful tools to solve problems in Quantum Mechanics which are intrinsecally related to Supersymmetry as hierarchy of hamiltonians and shape invariance. We present two approximation methods which will be specially useful: the well known Variational Method and the Logarithmic Perturbation Theory, the latter being closely related to the concepts of superpotentials and hierarchy of hamiltonians. Finally, we present problems related to superpotentials which are monomials in even powers of the x coordinate multiplied by the sign function epsilon(x), which seems to be a new class of problems in Supersymmetric Quantum Mechanics.

arXiv:1111.0827•Nov 3, 2011•1 citation

Supersymmetric Sachdev-Ye-Kitaev models

Wenbo Fu, Davide Gaiotto A, JUAN M. MALDACENA +1 more

We discuss a supersymmetric generalization of the Sachdev-Ye-Kitaev (SYK) model. These are quantum mechanical models involving $N$ Majorana fermions. The supercharge is given by a polynomial expression in terms of the Majorana fermions with random coefficients. The Hamiltonian is the square of the supercharge. The $\mathcal{N}=1$ model with a single supercharge has unbroken supersymmetry at large $N$, but nonperturbatively spontaneously broken supersymmetry in the exact theory. We analyze the model by looking at the large $N$ equation, and also by performing numerical computations for small values of $N$. We also compute the large $N$ spectrum of ``singlet'' operators, where we find a structure qualitatively similar to the ordinary SYK model. We also discuss an $\mathcal{N}=2$ version. In this case, the model preserves supersymmetry in the exact theory and we can compute a suitably weighted Witten index to count the number of ground states, which agrees with the large $N$ computation of the entropy. In both cases, we discuss the supersymmetric generalizations of the Schwarzian action which give the dominant effects at low energies.

Physical review. D/Physical review. D.•Jan 13, 2017•354 citations
The interplay between supersymmetry and classical and quantum computation is discussed. First, it is shown that the problem of computing the Witten index of N≤2\mathcal N \leq 2N≤2 quantum mechanical systems is #P\#P#P-complete and therefore intractable. Then, the notions of supersymmetry in the space of qubits and supersymmetric quantum circuits are introduced and some of their properties discussed. In particular, it is shown that these define a nontrivial subclass of quantum algorithms with robustness properties typical of supersymmetric systems. Concrete examples, including the supersymmetric SYK model and fermion hard-core models are discussed. Some applications and open questions are suggested.
Some recent results in supersymmetric quantum mechanics are presented. New semi-classical approximation formulas for Witten's realization of supersymmetric quantum mechanics are discussed. Implications of the supersymmetric structure of Pauli's Hamiltonian are also considered. In particular, the paramagnetisation of a non-interacting electron gas is related to a modified version of Witten's index. We also show that the supersymmetry in this system provides a new counter example for the paramagnetic conjecture.
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.
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
Over the last decade a new way to compute has been defined which, unlike conventional methods, is based on quantum mechanics rather than classical physics. This fundamental change in paradigm can, in principle, solve some important and hitherto intractable problems such as prime factorization of large numbers. This tutorial presentation will review the basics of quantum computation and the design of circuits to implement quantum algorithms. The starting point is the notion of a quantum bit or qubit. Because of the superposition property of quantum states, n qubits can store 2n numbers simultaneously, implying a type of massive parallelism. Furthermore, quantum states allow powerful forms of interaction such as entanglement that have no classical counterparts. Qubits are fragile, however, and are altered by measurement; hence quantum circuits must follow very different rules from classical ones. The differences between quantum and classical logic circuits will be discussed and illustrated. Finally, the physical implementation of quantum devices will be considered, along with the prospects for practical quantum computers.
In this work we present an introduction to Supersymmetry in the context of 1-dimensional Quantum Mechanics. For that purpose we develop the concept of hamiltonians factorization using the simple harmonic oscillator as an example, we introduce the supersymmetric oscilator and, next, we generalize these concepts to introduce the fundamentals of Supersymmetric Quantum Mechanics. We also discuss useful tools to solve problems in Quantum Mechanics which are intrinsecally related to Supersymmetry as hierarchy of hamiltonians and shape invariance. We present two approximation methods which will be specially useful: the well known Variational Method and the Logarithmic Perturbation Theory, the latter being closely related to the concepts of superpotentials and hierarchy of hamiltonians. Finally, we present problems related to superpotentials which are monomials in even powers of the x coordinate multiplied by the sign function epsilon(x), which seems to be a new class of problems in Supersymmetric Quantum Mechanics.
We discuss a supersymmetric generalization of the Sachdev-Ye-Kitaev (SYK) model. These are quantum mechanical models involving NNN Majorana fermions. The supercharge is given by a polynomial expression in terms of the Majorana fermions with random coefficients. The Hamiltonian is the square of the supercharge. The N=1\mathcal{N}=1N=1 model with a single supercharge has unbroken supersymmetry at large NNN, but nonperturbatively spontaneously broken supersymmetry in the exact theory. We analyze the model by looking at the large NNN equation, and also by performing numerical computations for small values of NNN. We also compute the large NNN spectrum of ``singlet'' operators, where we find a structure qualitatively similar to the ordinary SYK model. We also discuss an N=2\mathcal{N}=2N=2 version. In this case, the model preserves supersymmetry in the exact theory and we can compute a suitably weighted Witten index to count the number of ground states, which agrees with the large NNN computation of the entropy. In both cases, we discuss the supersymmetric generalizations of the Schwarzian action which give the dominant effects at low energies.