NSF award 2608763 · Lehigh University

Collaborative Research: Noise-Aware Optimization Algorithms for Hybrid Quantum Computing

Final report due

28 October 2029

in 1,106 days · The award ends on 30 June 2029.

GrantClerk is a private service. We are not NSF or any government agency.

Dates this award owes

NSF emails you about this too.

Decide about an extension2 Mar 2029in 866 days
award ending 2029-06-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 May 2029in 941 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Jun 2029in 976 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Oct 2029in 1106 days
award ending 2029-06-30 · Research.gov
PAPPG 24-1: “financially closed out 120 days after their expiration date”

Annual report dates come from the budget period on your award notice. That date is not public, so it is not shown here.

How we got this date

NSF lists this award's end date as 30 June 2029.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 October 2029.

Read the rule on Research.gov

Get a note before each report date

Add this award to your desk. We email you before each date and keep the dates in one place.

Renews each year until you cancel. Cancel any time from your account.

Already a member? Sign in

Award card

Award number: 2608763
Period of support: 1 Jul 2026 – 30 Jun 2029
Amount: $100,000
Awardee: Lehigh University, Bethlehem, PA
Program: COMPUTATIONAL MATHEMATICS
Directorate: MPS

Abstract

Quantum computing has the potential to transform scientific discovery and technological innovation in areas such as artificial intelligence, molecular simulation, biotechnology, and secure information processing. Variational quantum algorithms are among the most promising approaches for near-term quantum computing, but existing optimization methods used to train these algorithms often become unreliable when quantum…

Is this right?

We copy this from the public NSF award record. Your award notice and NSF always win. If a date looks wrong, check Research.gov.