Award Abstract # 2144219
CAREER: New Frontiers in Quantum Protocols, Operator Algebras, and Property Testing

NSF Org: CCF
Division of Computing and Communication Foundations
Recipient: THE TRUSTEES OF COLUMBIA UNIVERSITY IN THE CITY OF NEW YORK
Initial Amendment Date: January 27, 2022
Latest Amendment Date: April 1, 2025
Award Number: 2144219
Award Instrument: Continuing Grant
Program Manager: Elizabeth Behrman
ebehrman@nsf.gov
 (703)292-7049
CCF
 Division of Computing and Communication Foundations
CSE
 Directorate for Computer and Information Science and Engineering
Start Date: February 1, 2022
End Date: January 31, 2027 (Estimated)
Total Intended Award Amount: $675,031.00
Total Awarded Amount to Date: $531,472.00
Funds Obligated to Date: FY 2022 = $193,706.00
FY 2023 = $200,622.00

FY 2024 = $67,526.00

FY 2025 = $69,618.00
History of Investigator:
  • Henry Yuen (Principal Investigator)
    hsy2116@columbia.edu
Recipient Sponsored Research Office: Columbia University
615 W 131ST ST
NEW YORK
NY  US  10027-7922
(212)854-6851
Sponsor Congressional District: 13
Primary Place of Performance: Columbia University
500 W 120th St
New York
NY  US  10027-6623
Primary Place of Performance
Congressional District:
13
Unique Entity Identifier (UEI): F4N1QNPB95M4
Parent UEI:
NSF Program(s): FET-Fndtns of Emerging Tech,
FOUNDATIONS,
ANALYSIS PROGRAM,
Algorithmic Foundations
Primary Program Source: 01002324DB NSF RESEARCH & RELATED ACTIVIT
01002627DB NSF RESEARCH & RELATED ACTIVIT

01002526DB NSF RESEARCH & RELATED ACTIVIT

01002425DB NSF RESEARCH & RELATED ACTIVIT

01002223DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 1045, 7928, 7203, 7927
Program Element Code(s): 089Y00, 126800, 128100, 779600
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.049, 47.070

ABSTRACT

Over the past decade, the study of quantum multiprover interactive proofs (QMIPs) has deepened the understanding of the power of quantum entanglement as an information-processing resource. This research led to a recent quantum complexity result, known as MIP* = RE, which characterizes the computational power of QMIPs. Surprisingly, this characterization yields answers to longstanding problems in mathematical physics and operator algebras. Motivated by this, this project aims to explore the fascinating connections between complexity theory, quantum information, and pure mathematics. The overarching theme is to investigate how classical users can test and characterize complex quantum objects, with applications ranging from cryptography to operator algebras. These investigations will spur interdisciplinary research across computer science, physics, and mathematics. In addition to leading the research, the PI will disseminate this subject matter to a wide variety of communities (both academic and industrial). The PI will also participate in outreach and education activities, both in-person and online, to promote interest in quantum information science in high school and undergraduate students.

This project will pursue three main directions. First, the PI will develop novel protocols that allow a classical user to verify complex quantum entanglement in untrusted quantum devices, with applications to entanglement theory and testing of noisy quantum computers. Second, the PI will further develop the techniques used in the proof of MIP* = RE to address unsolved questions in mathematics related to the resolutions of Tsirelson?s problem and Connes? embedding problem. Third, the PI will initiate the systematic study of a noncommutative model of property testing, which will examine how local classical tests can constrain complex, quantum objects. This research will build upon prior work of the PI on interactive protocols for testing quantum entangled devices.

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.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

She, Adrian and Yuen, Henry "Unitary Property Testing Lower Bounds by Polynomials" Leibniz International Proceedings in Informatics (LIPIcs):14th Innovations in Theoretical Computer Science Conference (ITCS 2023) , 2023 https://doi.org/10.4230/LIPIcs.ITCS.2023.96 Citation Details

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page