<p>No, as far as I know, there are no models that use string theory.</p>

<p>Given that quantum field theories seem to be simulatable in polynomial time by a quantum computer (<a href="https://arxiv.org/abs/1111.3633" rel="noreferrer">Jordan, Lee, and Preskill, 2012</a>), the only possible more powerful physical system would be quantum gravity. This is because physicists generally believe that quantum field theory gives an excellent approximate description of the universe if gravity is neglected; however, general relativity seems incompatible with quantum mechanics. Thus, to get a full description of the universe, we need a theory of quantum gravity.  Many physicists believe this theory is given by string theory; however, physicists currently don't understand string theory well enough to use it as a basis for a model of computation.</p>

CC BY-SA 4.0
2019-04-12T11:19:44.173Z
2019-04-12T11:19:44.173Z
Peter Shor 
<p>I was reading Arora and Barak's book on computational complexity and in the section on 'criticism on Turing machine model and the class P' along with quantum computer it also mentions possibilities of other physical systems for computation such as string theory based computing. Are there any models that use string theory in particular?</p>

CC BY-SA 4.0
2020-09-03T05:40:42.693Z
Intuitively wouldn't string computations be mostly topological? I would expect them to equivalent to Extended Resolution. Wouldn't the string Lagrangian favor shorter proofs over longer proofs? And, of course, the whole thing would be quantum. Wouldn't QECC for strings work better if the string could be confined to 4 dimensions to take advantage of topological error correction?
botsina
CC BY-SA 4.0
2022-07-03T03:39:05.213Z
see principiabiomathematica.com
Perry Moncznik
<complexity-classes><quantum-computing>
String theory based computations
Root
# String theory based computations

(Asked by: username_0 on 2019-04-12)

I was reading Arora and Barak's book on computational complexity and in the section on 'criticism on Turing machine model and the class P' along with quantum computer it also mentions possibilities of other physical systems for computation such as string theory based computing. Are there any models that use string theory in particular?

**Tags:** complexity-classes, quantum-computing

> **Comments:**
> **username_1**: Intuitively wouldn't string computations be mostly topological? I would expect them to equivalent to Extended Resolution. Wouldn't the string Lagrangian favor shorter proofs over longer proofs? And, of course, the whole thing would be quantum. Wouldn't QECC for strings work better if the string could be confined to 4 dimensions to take advantage of topological error correction?  
> **username_2**: see principiabiomathematica.com  

---

## 1 answers

### Answer by username_3 on 2019-04-12. Score: 9 | Accepted answer

No, as far as I know, there are no models that use string theory.

Given that quantum field theories seem to be simulatable in polynomial time by a quantum computer ([Jordan, Lee, and Preskill, 2012](https://arxiv.org/abs/1111.3633)), the only possible more powerful physical system would be quantum gravity. This is because physicists generally believe that quantum field theory gives an excellent approximate description of the universe if gravity is neglected; however, general relativity seems incompatible with quantum mechanics. Thus, to get a full description of the universe, we need a theory of quantum gravity. Many physicists believe this theory is given by string theory; however, physicists currently don't understand string theory well enough to use it as a basis for a model of computation.


---

