Quantum Algorithms (W911NF-19-S-0010)

Quantum Algorithms (W911NF-19-S-0010) is sponsored by U.S. Army Research Office (ARO) and National Security Agency (NSA). This Broad Agency Announcement solicits proposals to develop new quantum computing algorithms for hard computational problems, develop insights into the power of quantum computation, and consider issues of quantum complexity and computability.

Development of Quantum Algorithms - Federal Grant Development of Quantum Algorithms The summary for the Development of Quantum Algorithms grant is detailed below. This summary states who is eligible for the grant, how much grant money will be awarded, current and past deadlines, Catalog of Federal Domestic Assistance (CFDA) numbers, and a sampling of similar government grants. Verify the accuracy of the data FederalGrants.

com provides by visiting the webpage noted in the Link to Full Announcement section or by contacting the appropriate person listed as the Grant Announcement Contact . If any section is incomplete, please visit the website for the Dept of the Army Materiel Command, which is the U.S. government agency offering this grant.

Development of Quantum Algorithms: The U.S. Army Research Office (ARO) together with the National Security Agency(NSA) is soliciting proposals to develop new quantum computing algorithms for hardcomputational problems, develop insights into the power of quantum computation, and considerissues of quantum complexity and computability.

Proposals for research in quantum algorithms should primarily be to devise novelquantum algorithms for solving mathematically and computationally hard problems fromsuch diverse fields as algebra, number theory, geometry, analysis, optimization, graphtheory, differential equations, combinatorics, topology, logic, and simulation.

Quantumalgorithms that are developed should focus on constructive solutions for specific tasksand on general methodologies for expressing and analyzing algorithms tailored tospecific problems. Complexity analysis such as upper and lower bounds on algorithms, includingdeveloping new methodologies for deriving such bounds, is encouraged. Noisy intermediatescale quantum (NISQ) computation produces approximate solutions.

The error in these solutionsdepends upon the noise. Complexity analysis of quantum algorithms for such approximatesolutions produced by NISQ machines is of interest. Investigators should presuppose the existence of a fully functional quantum computer andconsider what algorithmic tasks are particularly well suited to such a machine.

Anecessary component of this research will be to compare the efficiency of the quantumalgorithm to the best existing classical algorithm for the same problem. Although quantumalgorithm proposals may consider general architectural constraints (e.g. nearest neighbor onlygates) for implementing algorithms, they should otherwise concentrate on developing thealgorithm.

Quantum algorithm proposals may consider computational models other than thecircuit model (e.g. the adiabatic model). To characterize the efficiency of candidate quantum algorithms, metrics must bedeveloped to quantify the performance of quantum algorithms relative to their classicalanalogues.

The problems to which they are being applied must have well-defined inputs,and well-defined outputs, along with a well-defined statement of what exactly is beingcomputed. A full accounting of all computational resources must be made; typical units includenumbers of qubits, numbers of quantum gates, runtime of the algorithm, amount of memorybeing used, amounts of classical pre-computation and post-computation, and probability ofsuccess.

Worst-case analyses of the algorithms are preferable to average case analyses, but ifaverage case analysis is to be used in an efficiency measure, the distribution of all cases must bemade explicit as well as the placement of average cases within this distribution.

In addition, proposals that study the algorithmic limitations of fully functional quantum computers will be considered as long as similar performance metrics are specified and quantified.

Development of Quantum Algorithms Dept of the Army Materiel Command (DOD-AMC) Funding Opportunity Number: Current Application Deadline: Original Application Deadline: Maximum Federal Grant Award: Minimum Federal Grant Award: Expected Number of Awards: Cost Sharing or Matching: Applicants Eligible for this Grant Public and State controlled institutions of higher education - Native American tribal organizations (other than Federally recognized tribal governments) - Nonprofits having a 501 (c) (3) status with the IRS, other than institutions of higher education - Nonprofits that do not have a 501 (c) (3) status with the IRS, other than institutions of higher education - Private institutions of higher education - Individuals - For-profit organizations other than small businesses - Small businesses Grant Announcement Contact Similar Government Grants • REQUEST FOR INFORMATION - MUTUALLY BENEFICIAL MULTIDISCIPLINARY INNOVATION ECOSYSTEMS • Request for Information Trusted Partner Program • US Army Combat Capabilities Development Command Broad Agency Announcement • Staff Research Program • Quantum Characterization, Calibration, and Control (QC3) • Braod Agency Announcement for the Army Research Laboratory • TARDEC FY04 Broad Agency Announcement (BAA) • Fiscal Year 2004 Department of Defense Instrumentation Program for Tribal Colleges and Uni...

More Grants from the Dept of the Army Materiel Command • Department of Army Energetics Basic Research Center (EBRC) Fiscal Year 2025 • Collective Judgment Formation-Collaborative Research Alliance • Department of Defense Research and Education Program for Historically Black Colleges and U...

• Army Applications Lab Broad Agency Announcement For Disruptive Applications • Department of Army:FY25 Department of Defense Multidisciplinary Research Program of the Un... Federal Grants by Category Grants for Single Mothers Small Business Grants for Women Federal Grants for College Federal Tuition Assistance