Google Research

Early Fault-Tolerant Quantum Algorithms & Applications

Overview

Quantum computing promises to solve computational problems that are beyond the reach of classical systems. This call for proposals focuses on the immediate frontier of quantum computing: the early fault-tolerant era. This call for proposals seeks to identify algorithms and applications that can run on early fault-tolerant devices - specifically targeting research that utilizes a relatively small number of logical qubits to solve classically intractable problems.

We seek research projects that propose algorithms and applications, novel ways of using error correction or error mitigation in this era, or compilation and resource optimization techniques, designed to achieve a quantum advantage while minimizing logical qubit and gate counts. We also seek to identify paths toward real-world utility and societal impact (e.g. in domains such as life sciences & health, climate & sustainability, energy & materials sciences, etc.).

Quick links

Quick links

details

Application status

Applications are now open.

Submit by August 7, 2026 at 11:59:59pm AoE (UTC-12). Notification of decisions will be announced by October 30, 2026.

Submit application
  • applications open
  • applications close
  • Notification of proposal decisions by

Research topics / questions

Unlike calls that look toward a more distant future of large fault tolerant systems with many logical qubits, this award targets the leanest possible path to utility. We are seeking proposals that can achieve quantum advantage within the constraints of early fault tolerant hardware.

We welcome proposals across these primary tracks:

  • Low-Resource Novel Algorithms: Development of entirely new quantum algorithms feasible to run on early fault-tolerant architectures.
  • Early Fault Tolerant Practical Applications: Mapping high-impact, real-world problems to know early fault tolerant algorithms.
  • Resource Reduction & Overhead Optimization: Breakthrough compilation, error correction, error mitigation, or algorithmic optimization techniques that drastically lower physical resources required for beyond classical applications.

We’re seeking proposals with:

  • Clear, mathematically rigorous estimates of the resource requirements, including logical qubit counts, gate depths, and error-correction overheads.
  • Strong theoretical justification demonstrating that the proposed solution cannot be efficiently simulated or matched by advanced classical computing methods.
  • Potential to accelerate the realization of practical quantum utility on early, rather than mature, fault-tolerant hardware.

Award details

Awards will be up to $100k, but we may consider larger amounts for exceptional proposals that demonstrate a clear and compelling rationale for the increased funding. Funds will be disbursed as unrestricted gifts to the university or degree-granting research institution and are not intended for overhead or indirect costs.

Requirements

Eligibility

  • Open to professors (assistant, associate, etc.) at a university or degree-granting research institution.
  • Applicants may only serve as Principal Investigator (PI) or co-PI on one proposal per round. There can be a maximum of 2 PIs per proposal.
  • Proposals must be related to computing or technology.

Review criteria

  • Faculty merit: Faculty is accomplished in research, community engagement, and open source contributions, with potential to contribute to responsible innovation.
  • Research merit: Faculty's proposed research is aligned with Google Research interests, innovative, and likely to have a significant impact on the field.
  • Proposal quality: The research proposal is clear, focused, and well-organized, and it demonstrates the team's ability to successfully execute the research and achieve a significant impact.
  • AI ethics principles: The research proposal strongly aligns with Google's AI Principles.

More info

We will host informational sessions with live Q&A. RSVP to attend here.

FAQ's

See FAQ's here.

Past award recipients

See past recipients.

×