权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

Model Theory, Quantum Complexity, and Embedding Problems in Operator Algebras

模型论、量子复杂性和算子代数中的嵌入问题

基本信息

批准号：
2054477
负责人：
Isaac Goldbring
金额：
$ 38.98万
依托单位：
University of California-Irvine
依托单位国家：
美国
项目类别：
Standard Grant
财政年份：
2021
资助国家：
美国
起止时间：
2021-07-01 至 2025-06-30
项目状态：
未结题

来源：
https://www.nsf.gov/awardsearch/showAward?AWD_ID=2054477&HistoricalAwards=false
关键词：
Model Theory Quantum Complexity Embedding

项目摘要

This project lies at the intersection of three seemingly unrelated areas: von Neumann algebras, quantum complexity theory, and model theory. Von Neumann algebras were introduced by John von Neumann in his mathematical account of quantum mechanics and consist of infinite-sized matrices closed under various natural operations. Quantum complexity theory considers the difficulty of solving or verifying solutions to decision problems using the quantum model of computation, that is to say, computers that run according to the laws of quantum physics as opposed to classical physics. Recently, a landmark result in quantum complexity theory showed that classically unsolvable decision problems could be reliably verified by a quantum computer. This quantum complexity result established a negative solution to a famous problem in operator algebras, the so-called Connes Embedding Problem, posed in 1976, which asks whether or not every von Neumann algebra can be approximated by a simple von Neumann algebra known as the hyperfinite II_1 factor. Using techniques from model theory, a branch of mathematical logic that studies classes of structures by examining what is expressible about them using first-order logic, the PI and a collaborator greatly simplified and elucidated the connection between the quantum complexity result and the solution to the Connes Embedding Problem. This project plans to deepen the connection between these three areas by isolating the exact model-theoretic content behind the quantum complexity result and deducing further von Neumann algebraic consequences. More specifically, the PI plans on extending the model-theoretic analysis of the quantum complexity result to understand the complexity of the full first-order theory of the hyperfinite II_1 factor; the PI's work with Hart established this connection for the one-quantifier theory. In addition, the PI plans to pursue proofs of the failure of the Connes Embedding Problem which avoid the use of the quantum complexity result by using the model-theoretic notions of existentially closed models and Robinson forcing; due to the difficulty in proving the quantum complexity result, a new proof along these lines would serve as a great simplification of the resolution of the Connes Embedding Problem. The project will also study other uses of model theory in von Neumann algebra theory, including furthering progress on Popa's embedding problem, which asks about the existence of certain kinds of ergodic embeddings of II_1 factors into ultrapowers. The PI also plans on making progress on the C*-algebra version of the Connes Embedding Problem known as the Kirchberg Embedding Problem, which asks if every C*-algebra is approximated by the Cuntz algebra, an algebra of extreme importance in the classification program for nuclear C*-algebras. Finally, while the majority of the model-theoretic study of von Neumann algebras has focused on so-called finite algebras, the PI plans on studying the model-theoretic properties of arbitrary von Neumann algebras through the lens of W*-probability spaces.This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

这个项目位于三个看似无关的领域的交叉点：冯诺依曼代数，量子复杂性理论和模型理论。冯·诺依曼代数是由约翰·冯·诺依曼在他的量子力学的数学描述中引入的，由在各种自然运算下闭合的无限大小的矩阵组成。量子复杂性理论考虑了使用量子计算模型解决或验证决策问题的解决方案的困难，也就是说，计算机根据量子物理学定律而不是经典物理学运行。最近，量子复杂性理论的一个里程碑式的结果表明，经典的不可解决策问题可以通过量子计算机可靠地验证。这个量子复杂性的结果为算子代数中的一个著名问题建立了一个负解，即所谓的康纳斯嵌入问题，该问题于1976年提出，它询问是否每个冯诺依曼代数都可以近似为一个简单的冯诺依曼代数，称为超有限II_1因子。模型论是数学逻辑的一个分支，通过研究结构的类别，研究它们使用一阶逻辑的可表达性，PI和合作者极大地简化和阐明了量子复杂性结果与康纳斯嵌入问题解决方案之间的联系。该项目计划通过隔离量子复杂性结果背后的确切模型理论内容并进一步推导冯诺依曼代数结果来加深这三个领域之间的联系。更具体地说，PI计划扩展量子复杂性结果的模型理论分析，以理解超有限II_1因子的完整一阶理论的复杂性; PI与哈特的工作为单量词理论建立了这种联系。此外，PI计划通过使用存在闭模型和罗宾逊强迫的模型理论概念来避免使用量子复杂性结果来证明康纳斯嵌入问题的失败;由于证明量子复杂性结果的困难，沿着这些路线的新证明将大大简化康纳斯嵌入问题的解决方案。该项目还将研究模型论在冯·诺依曼代数理论中的其他用途，包括进一步研究波帕嵌入问题，该问题询问II_1因子到超幂的某些遍历嵌入的存在性。 PI还计划在康纳斯嵌入问题的C*-代数版本上取得进展，称为基希贝格嵌入问题，该问题询问是否每个C*-代数都可以由Cuntz代数近似，Cuntz代数是核C*-代数分类程序中极其重要的代数。最后，虽然大多数冯诺依曼代数的模型理论研究都集中在所谓的有限代数上，但PI计划通过W* 概率空间的透镜研究任意冯诺依曼代数的模型理论性质。该奖项反映了NSF的法定使命，并通过使用基金会的智力价值和更广泛的影响审查标准进行评估，被认为值得支持。