2021
DOI: 10.1007/jhep07(2021)140
|View full text |Cite
|
Sign up to set email alerts
|

Toward simulating superstring/M-theory on a quantum computer

Abstract: We present a novel framework for simulating matrix models on a quantum computer. Supersymmetric matrix models have natural applications to superstring/M-theory and gravitational physics, in an appropriate limit of parameters. Furthermore, for certain states in the Berenstein-Maldacena-Nastase (BMN) matrix model, several supersymmetric quantum field theories dual to superstring/M-theory can be realized on a quantum device. Our prescription consists of four steps: regularization of the Hilbert space, adiabatic s… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6

Relationship

3
3

Authors

Journals

citations
Cited by 39 publications
(48 citation statements)
references
References 146 publications
0
48
0
Order By: Relevance
“…We use the prescription used in ref. [28]. Let |j (j = 0, 1, • • • , Λ − 1) be the j-th excited state of the harmonic oscillator.…”
Section: Jhep09(2021)034mentioning
confidence: 99%
See 4 more Smart Citations
“…We use the prescription used in ref. [28]. Let |j (j = 0, 1, • • • , Λ − 1) be the j-th excited state of the harmonic oscillator.…”
Section: Jhep09(2021)034mentioning
confidence: 99%
“…To construct this ground state we will apply the adiabatic algorithm. The approach here will be almost identical to the construction discussed in section 4.5 of [28], where block-encoding of the Hamiltonian is achieved from the Pauli sum form and then Wan-Kim [37] algorithm is carefully applied to efficiently prepare the ground state. 17 For 0 ≤ s ≤ 1, we introduceĤ(s) aŝ…”
Section: Ground State Preparationmentioning
confidence: 99%
See 3 more Smart Citations