Pith. sign in

REVIEW 3 cited by

Toward simulating Superstring/M-theory on a quantum computer

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.06573 v2 pith:OZBMBRXY submitted 2020-11-12 hep-th hep-latquant-ph

classification hep-thhep-latquant-ph
keywords quantumm-theorymatrixsuperstringcomputermodelsimulatingstate
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 state preparation, simulation of real-time dynamics, and measurements. Regularization is performed for the BMN matrix model with the introduction of energy cut-off via the truncation in the Fock space. We use the Wan-Kim algorithm for fast digital adiabatic state preparation to prepare the low-energy eigenstates of this model as well as thermofield double state. Then, we provide an explicit construction for simulating real-time dynamics utilizing techniques of block-encoding, qubitization, and quantum signal processing. Lastly, we present a set of measurements and experiments that can be carried out on a quantum computer to further our understanding of superstring/M-theory beyond analytic results.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An exact algorithm for U(N) matrix models in the gauge-invariant singlet sector

    hep-th 2026-07 conditional novelty 7.0 of 10

    A group-theoretic algorithm computes U(N)-singlet Hamiltonian matrix elements as closed-form polynomials in N, validated for one matrix against the exact fermion mapping.

  2. Exponential speedup in quantum simulation of Kogut-Susskind Hamiltonian via orbifold lattice

    quant-ph 2025-05 conditional novelty 6.0 of 10

    The Kogut-Susskind Hamiltonian is recovered from the orbifold lattice Hamiltonian in the infinite scalar mass limit, with numerical confirmation for SU(2) and SU(3) Yang-Mills theory in 2+1 dimensions.

  3. Simulating matrix models with tensor networks

    hep-th 2024-12 conditional novelty 6.0 of 10

    Tensor-network DMRG simulations of SU(2) and small-SU(N) bosonic and supersymmetric matrix models give convergent ground states and entanglement measures, with costs that appear to grow polynomially with the number of...

Pith tools