CAREER: Complexity Theory of Quantum States: A Novel Approach for Characterizing Quantum Computer Science
职业:量子态复杂性理论:表征量子计算机科学的新方法
基本信息
- 批准号:2339116
- 负责人:
- 金额:$ 78.82万
- 依托单位:
- 依托单位国家:美国
- 项目类别:Continuing Grant
- 财政年份:2024
- 资助国家:美国
- 起止时间:2024-05-01 至 2029-04-30
- 项目状态:未结题
- 来源:
- 关键词:
项目摘要
Quantum computing can help solve some of the most complex problems in physics, chemistry, material design, optimization, and machine learning. Quantum complexity theory plays a crucial role in guiding the advancement of quantum computing. Nowadays, the study of quantum computing and quantum physics leads to many new computational tasks for dealing with quantum information. The theoretical framework in standard complexity theory might be insufficient to guide the investigation of these new problems. This award will provide a novel theoretical framework to steer the development of fast quantum algorithms for various new problems in quantum physics and computer science, and construct more secure quantum cryptography. Beyond technology, the award will support the (i) development of new quantum computing courses for science and engineering students that will be shared with nearby Hispanic-serving institutions in Houston, (ii) mentoring of students from underrepresented groups through the Research Emerging Scholars Program and the Quantum Research Experiences for Undergraduates Program, and (iii) institution of a Hybrid Quantum Computing Seminar to deepen the engagement with internal and external stakeholders in the quantum computing community.Quantum computing introduces many well-motivated computational tasks that ask to identify specific properties of input quantum states. For example, state tomography asks to learn the classical description of the input quantum states, and the security of quantum cryptography relies on the hardness of extracting information from quantum messages. However, the standard complexity theory for problems with classical inputs and outputs is inadequate for identifying the computational complexity of these new computational tasks. Therefore, this award seeks to advance the following three thrusts: (i) develop the complexity theory for problems that ask to identify specific properties of input quantum states, (ii) identify the security of quantum cryptographic primitives through the new complexity theory, and (iii) use the framework to characterize the computational hardness of variants of problems with quantum inputs.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.
量子计算可以帮助解决物理、化学、材料设计、优化和机器学习中一些最复杂的问题。量子复杂性理论在指导量子计算的进步中发挥着至关重要的作用。如今,量子计算和量子物理的研究引发了许多处理量子信息的新计算任务。标准复杂性理论的理论框架可能不足以指导这些新问题的研究。该奖项将为量子物理和计算机科学中的各种新问题提供一个新颖的理论框架,引导快速量子算法的发展,并构建更安全的量子密码学。除了技术之外,该奖项还将支持(i)为科学和工程专业的学生开发新的量子计算课程,这些课程将与休斯顿附近的拉美裔服务机构共享,(ii)通过研究新兴学者计划指导来自代表性不足群体的学生和本科生量子研究体验计划,以及(iii)举办混合量子计算研讨会,以加深与量子计算社区内部和外部利益相关者的接触。量子计算引入了许多积极主动的计算要求识别输入量子态的特定属性的任务。例如,状态断层扫描要求学习输入量子态的经典描述,而量子密码学的安全性依赖于从量子消息中提取信息的难度。然而,经典输入和输出问题的标准复杂性理论不足以识别这些新计算任务的计算复杂性。因此,该奖项旨在推进以下三个重点:(i)针对要求识别输入量子态特定属性的问题开发复杂性理论,(ii)通过新的复杂性理论识别量子密码原语的安全性,以及( iii) 使用该框架来表征量子输入问题变体的计算难度。该奖项反映了 NSF 的法定使命,并通过使用基金会的智力价值和更广泛的影响审查标准进行评估,被认为值得支持。
项目成果
期刊论文数量(0)
专著数量(0)
科研奖励数量(0)
会议论文数量(0)
专利数量(0)
数据更新时间:{{ journalArticles.updateTime }}
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
数据更新时间:{{ journalArticles.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ monograph.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ sciAawards.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ conferencePapers.updateTime }}
{{ item.title }}
- 作者:
{{ item.author }}
数据更新时间:{{ patent.updateTime }}
Nai-Hui Chia其他文献
Nai-Hui Chia的其他文献
{{
item.title }}
{{ item.translation_title }}
- DOI:
{{ item.doi }} - 发表时间:
{{ item.publish_year }} - 期刊:
- 影响因子:{{ item.factor }}
- 作者:
{{ item.authors }} - 通讯作者:
{{ item.author }}
{{ truncateString('Nai-Hui Chia', 18)}}的其他基金
Collaborative Research: FET: Small: Minimum Quantum Circuit Size Problems, Variants, and Applications
合作研究:FET:小型:最小量子电路尺寸问题、变体和应用
- 批准号:
2243659 - 财政年份:2022
- 资助金额:
$ 78.82万 - 项目类别:
Standard Grant
Collaborative Research: FET: Small: Minimum Quantum Circuit Size Problems, Variants, and Applications
合作研究:FET:小型:最小量子电路尺寸问题、变体和应用
- 批准号:
2224132 - 财政年份:2022
- 资助金额:
$ 78.82万 - 项目类别:
Standard Grant
相似国自然基金
数字孪生油气藏关键理论方法——D/G Transformer迭代复杂油气藏建模研究
- 批准号:42330813
- 批准年份:2023
- 资助金额:230 万元
- 项目类别:重点项目
基于系统动力学的复杂网络系统容错控制及新型电力系统安全域理论研究
- 批准号:62373089
- 批准年份:2023
- 资助金额:50 万元
- 项目类别:面上项目
复杂环境下网络化系统协同控制理论及其在多无人系统中的应用
- 批准号:62373106
- 批准年份:2023
- 资助金额:50 万元
- 项目类别:面上项目
复杂激光等离子体环境下束间能量转移的理论模拟研究
- 批准号:12375239
- 批准年份:2023
- 资助金额:53 万元
- 项目类别:面上项目
深部开采复杂应力环境岩体时效损伤理论与灾变临界判识
- 批准号:52374077
- 批准年份:2023
- 资助金额:50 万元
- 项目类别:面上项目
相似海外基金
CAREER: Algebraic and Geometric Complexity Theory
职业:代数和几何复杂性理论
- 批准号:
2047310 - 财政年份:2021
- 资助金额:
$ 78.82万 - 项目类别:
Continuing Grant
CAREER: Theory and Algorithms for Efficient Control of Wireless Networks with Jointly Optimized Performance: High Throughput, Low Delay, and Low Complexity
职业:具有联合优化性能的无线网络高效控制的理论和算法:高吞吐量、低延迟和低复杂性
- 批准号:
2112694 - 财政年份:2020
- 资助金额:
$ 78.82万 - 项目类别:
Continuing Grant
Measuring the role of mental model complexity on individual behavioral and neural differences in adaptive decision making
衡量心理模型复杂性对适应性决策中个体行为和神经差异的作用
- 批准号:
9758624 - 财政年份:2019
- 资助金额:
$ 78.82万 - 项目类别:
CAREER: Theory and Algorithms for Efficient Control of Wireless Networks with Jointly Optimized Performance: High Throughput, Low Delay, and Low Complexity
职业:具有联合优化性能的无线网络高效控制的理论和算法:高吞吐量、低延迟和低复杂性
- 批准号:
1651947 - 财政年份:2017
- 资助金额:
$ 78.82万 - 项目类别:
Continuing Grant
Center for Complexity and Self-management of Chronic Disease (CSCD)
慢性病复杂性和自我管理中心 (CSCD)
- 批准号:
8821267 - 财政年份:2014
- 资助金额:
$ 78.82万 - 项目类别: