This research investigates four fundamental questions in quantum information processing. 1. The power and limitations of two quantum provers, in particular the relation of this model with the classical complexity classes of Polynomial Space and Exponential Time. 2. The optimal rate at which mixed state quantum information can be compressed, in particular if a well-known lower bound on the rate by Holevo quantity is tight. 3. Strong lower bound on quantum one-way communication. 4. The power and limitations of short quantum refereed games, in particular the relation of those models with other quantum and classical complexity classes.

Quantum information processing is of fundamental importance to the security, prosperity, and welfare of the nation, as it may lead to revolutionary technologies for super-fast computing and secure methods for communication. The successful completion of this project will illuminate the power and limitations of quantum information processing capabilities, thus contribute to the realistic deployment of quantum information technologies. PI will actively involve undergraduate and graduate students in his research.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Type
Standard Grant (Standard)
Application #
1216729
Program Officer
Almadena Chtchelkanova
Project Start
Project End
Budget Start
2012-08-01
Budget End
2016-07-31
Support Year
Fiscal Year
2012
Total Cost
$360,488
Indirect Cost
Name
Regents of the University of Michigan - Ann Arbor
Department
Type
DUNS #
City
Ann Arbor
State
MI
Country
United States
Zip Code
48109