AF: CQIS: Small: Theoretical Problems in Quantum Information

AF：CQIS：小：量子信息中的理论问题

• 批准号: 1717523
• 负责人: Sandeep Sadanandarao
• 金额: $ 45.16万
• 依托单位: Regents of the University of Michigan - Ann Arbor
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2017
• 资助国家: 美国
• 起止时间: 2017-06-01 至 2022-05-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1717523&HistoricalAwards=false
• 关键词: AF; CQIS; Small; Theoretical; Problems

This project addresses the following four sets of fundamental questions in quantum information.(1) Randomness extraction in the presence of quantum side information.To secure communication security, it is necessary to generate cryptographic keys that cannot be predicted by an adversary. Such keys are usually obtained through a randomness extraction process, which converts a weakly random input to a (almost) perfectly random output.The team is researching the most efficient methods for this task, with the focus on the setting that the adversary?s knowledge about the input is quantum.(2) Quantum cryptographic hash functions (qchash). Hash functions are powerful tools that can be used to verify the authenticity and the integrity of a message. Quantum hash functions extend (classical) hash functions by using a quantum state to ?tag? a classical message. The team is working to identify the advantages of such functions, especially in the scenario where classical side information is leaked to the adversary.(3) Quantum homomorphic encryption (QHE). Homomorphic encryption allows encrypted data to be processed by multiple parties without the need for decryption or for interactions with the owner of the data.The team is looking for the most efficient methods for achieving this task, when the data are quantum and the adversary is assumed to be all-powerful.(4) Quantum algorithms for combinatorial optimization. Many optimization problems from practice are extremely difficult to solve, even if one is content with an approximate answer. The team is examining to what extent quantum algorithms can speed up the computation or increase quality of approximation. A focus is on the recently proposed algorithmic framework of quantum approximate optimization algorithms (QAOA).Positive solutions to the above questions may lead to new and powerful quantum information applications for safeguarding information security and for solving optimization problems. The project also trains multiple students to become experts on quantum information science.

该项目解决了量子信息中的以下四组基本问题。（1）在存在量子侧信息的情况下随机提取。要确保通信安全性，有必要生成无法预测的对手进行的加密密钥。这些密钥通常是通过随机提取过程获得的，该过程将弱随机输入转换为（几乎）完美的随机输出。团队正在研究该任务的最有效方法，重点是对手有关输入的知识是量子的设置。（2）量子加密哈希函数（QCHASH）。哈希功能是强大的工具，可用于验证消息的真实性和完整性。量子哈希函数通过使用量子状态来扩展（经典）哈希函数？经典消息。该团队正在努力确定此类功能的优势，尤其是在经典侧面信息泄漏到对手的情况下。（3）量子同构加密（QHE）。同构加密允许多个方面处理加密的数据，而无需解密或与数据所有者进行交互。团队正在寻找实现此任务的最有效方法，当数据是量子和对手时，假定量化的量子。实践中的许多优化问题也很难解决，即使一个人满足于大概答案。该团队正在研究量子算法在多大程度上可以加快计算或提高近似质量的质量。重点是最近提出的量子近似优化算法（QAOA）的算法框架。上述问题的阳性解决方案可能会导致新的和强大的量子信息应用程序，以保护信息安全性并解决优化问题。该项目还训练多个学生成为量子信息科学的专家。

项目成果

Achievable rate-region for 3—User Classical-Quantum Interference Channel using Structured Codes

使用结构化代码实现 3 用户经典量子干涉通道的速率区域

• DOI: 10.1109/isit45174.2021.9518095
• 发表时间: 2021
• 期刊: IEEE International symposium on information theory
• 作者: Atif, Touheed Anwar;Padakandla, Arun;Pradhan, S. Sandeep
• 通讯作者: Pradhan, S. Sandeep

Faithful Simulation of Distributed Quantum Measurements with Applications in Distributed Rate-Distortion Theory

分布式量子测量的忠实模拟及其在分布式率失真理论中的应用

• 发表时间: 2019
• 期刊: IEEE International Symposium on Information Theory
• 作者: Mohsen Heidari, Touheed Anwar

Quantum Algorithms to Simulate Many-Body Physics of Correlated Fermions

• DOI: 10.1103/physrevapplied.9.044036
• 发表时间: 2018-04-26
• 期刊: PHYSICAL REVIEW APPLIED
• 影响因子: 4.6
• 作者: Jiang, Zhang;Sung, Kevin J.;Boixo, Sergio
• 通讯作者: Boixo, Sergio

OpenFermion: the electronic structure package for quantum computers

• DOI: 10.1088/2058-9565/ab8ebc
• 发表时间: 2020-07-01
• 期刊: QUANTUM SCIENCE AND TECHNOLOGY
• 影响因子: 6.7
• 作者: McClean, Jarrod R.;Rubin, Nicholas C.;Babbush, Ryan
• 通讯作者: Babbush, Ryan

Computing Sum of Sources over a Classical-Quantum MAC

通过经典量子 MAC 计算源之和

• DOI: 10.1109/tit.2022.3192876
• 发表时间: 2021
• 期刊: IEEE Transactions on Information Theory
• 影响因子: 2.5
• 作者: Sohail, Mohammad Aamir;Atif, Touheed Anwar;Padakandla, Arun;Sandeep Pradhan, S.
• 通讯作者: Sandeep Pradhan, S.