据推测,物理学的进一步进步可能会导致更快的计算机。例如,已经表明基于'''玻姆力学 Bohmian Mechanics'''的非局部隐变量量子计算机可以实现对<math>N</math>-- 项目数据库最多<math>O(\sqrt[3]{N})</math>步,比[[Grover算法]]略有加速,它运行在<math>O(\sqrt{N})</math>步。但是请注意,这两种搜索方法都不允许量子计算机在多项式时间内解决[[NP完全问题]]。<ref name="auto">{{cite web|url=http://www.scottaaronson.com/papers/qchvpra.pdf|title=Quantum Computing and Hidden Variables|last=Aaronson|first=Scott}}</ref> 量子引力理论,例如M 理论和圈量子引力,可能允许建造速度更快的计算机。然而,由于时间问题,在这些理论中定义计算是一个悬而未决的问题;也就是说,在这些物理理论中,目前没有明显的方法来描述观察者在某个时间点向计算机提交输入然后在稍后的时间点接收输出意味着什么。<ref>{{Cite journal|first=Scott|last=Aaronson|title=NP-complete Problems and Physical Reality|journal=ACM SIGACT News|volume=2005|arxiv=quant-ph/0502072|year=2005|bibcode=2005quant.ph..2072A|author-link=Scott Aaronson}} See section 7 "Quantum Gravity": "[…] to anyone who wants a test or benchmark for a favorite quantum gravity theory,[author's footnote: That is, one without all the bother of making numerical predictions and comparing them to observation] let me humbly propose the following: ''can you define Quantum Gravity Polynomial-Time?'' […] until we can say what it means for a 'user' to specify an 'input' and ‘later' receive an 'output'—''there is no such thing as computation, not even theoretically.''" (emphasis in original)</ref><ref name=":0">{{cite web | url=http://www.dwavesys.com/en/pressreleases.html#lm_2011 |title= D-Wave Systems sells its first Quantum Computing System to Lockheed Martin Corporation |access-date=30 May 2011 |date=25 May 2011 |publisher=D-Wave}}</ref> | 据推测,物理学的进一步进步可能会导致更快的计算机。例如,已经表明基于'''玻姆力学 Bohmian Mechanics'''的非局部隐变量量子计算机可以实现对<math>N</math>-- 项目数据库最多<math>O(\sqrt[3]{N})</math>步,比[[Grover算法]]略有加速,它运行在<math>O(\sqrt{N})</math>步。但是请注意,这两种搜索方法都不允许量子计算机在多项式时间内解决[[NP完全问题]]。<ref name="auto">{{cite web|url=http://www.scottaaronson.com/papers/qchvpra.pdf|title=Quantum Computing and Hidden Variables|last=Aaronson|first=Scott}}</ref> 量子引力理论,例如M 理论和圈量子引力,可能允许建造速度更快的计算机。然而,由于时间问题,在这些理论中定义计算是一个悬而未决的问题;也就是说,在这些物理理论中,目前没有明显的方法来描述观察者在某个时间点向计算机提交输入然后在稍后的时间点接收输出意味着什么。<ref>{{Cite journal|first=Scott|last=Aaronson|title=NP-complete Problems and Physical Reality|journal=ACM SIGACT News|volume=2005|arxiv=quant-ph/0502072|year=2005|bibcode=2005quant.ph..2072A|author-link=Scott Aaronson}} See section 7 "Quantum Gravity": "[…] to anyone who wants a test or benchmark for a favorite quantum gravity theory,[author's footnote: That is, one without all the bother of making numerical predictions and comparing them to observation] let me humbly propose the following: ''can you define Quantum Gravity Polynomial-Time?'' […] until we can say what it means for a 'user' to specify an 'input' and ‘later' receive an 'output'—''there is no such thing as computation, not even theoretically.''" (emphasis in original)</ref><ref name=":0">{{cite web | url=http://www.dwavesys.com/en/pressreleases.html#lm_2011 |title= D-Wave Systems sells its first Quantum Computing System to Lockheed Martin Corporation |access-date=30 May 2011 |date=25 May 2011 |publisher=D-Wave}}</ref> |