NSF award 2543506 · University of California-Berkeley

CAREER: Quantum-Inspired Relaxation and Embedding Frameworks for Scalable Scientific Computing in High Dimensions

Final report due

28 October 2031

in 1,836 days · The award ends on 30 June 2031.

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 2031in 1596 days
award ending 2031-06-30 · Research.gov
This one is ours, not NSF’s.
Extension request16 May 2031in 1671 days
award ending 2031-06-30 · Research.gov
PAPPG 24-1: “at least 45 days prior to the end date”
No-cost extension notice20 Jun 2031in 1706 days
award ending 2031-06-30 · Research.gov
PAPPG 24-1: “at least ten calendar days prior to the end date”
Final report due28 Oct 2031in 1836 days
award ending 2031-06-30 · Research.gov
PAPPG 24-1: “no later than 120-days following the end date of the award”
Project outcomes report due28 Oct 2031in 1836 days
award ending 2031-06-30 · Research.gov
PAPPG 24-1: “no later than 120 days following the end date”
Award is closed out28 Oct 2031in 1836 days
award ending 2031-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 2031.
NSF rules say the final report is due no later than 120 days after that.
So the final report is due by 28 October 2031.

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: 2543506
Period of support: 1 Jul 2026 – 30 Jun 2031
Amount: $500,000
Awardee: University of California-Berkeley, Berkeley, CA
Program: COMPUTATIONAL MATHEMATICS
Directorate: MPS

Abstract

Many scientific and engineering problems are difficult because the number of possible configurations grows exponentially with system size. This challenge arises in quantum materials, molecular systems, statistical mechanics, imaging, and global optimization. Direct computation is often impossible, while purely local or black-box methods can miss the structure that makes the problem scientifically tractable. This…

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.