A Matrix Big Bang on a Quantum Computer
Viti Chandra, Yuan Feng, Michael McGuigan

TL;DR
This paper explores quantum simulations of non-critical M-theory matrix models, demonstrating reduced qubit requirements and applying quantum algorithms to compute ground states, singularities, and BRST invariants.
Contribution
It introduces quantum algorithms for simulating non-critical M-theory matrix models, highlighting their simplicity and efficiency over critical theories.
Findings
Fewer qubits and Pauli terms needed for non-critical M-theory
Quantum algorithms successfully compute ground state energies
Simulation of Matrix Big Bang singularities on quantum computers
Abstract
M-theory is a mysterious theory that seeks to unite different string theories in one lower dimension. The most studied example is eleven dimensional but other dimensions have been considered. The non-critical M-theories seek to unite different non-critical string theories. From the point of view of computing, non-critical M-theories should be simpler to simulate as they have fewer fields than eleven dimensional M-theory. The simplicity of non-critical M-theory carries over to quantum computing and we show that the quantum simulation requires fewer qubits and Pauli terms than critical M-theory. As an example quantum calculation we study the quantum computation of the ground state energy of Matrix models of non-critical M-theory in 3d in the finite difference and oscillator basis and compare the accuracy, number of qubits and number of Pauli terms of the different basis using the…
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.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Computational Physics and Python Applications
