Grant: Discovery Grants Program - Individual
Dalhousie University
$46,000.00
Mathematical Methods for Practical Quantum Computing
FY 2023-24
Summary
The goal of my research program is to devise practical applications for computing devices known as quantum computers. Quantum computers can harness quantum mechanical phenomena. This allows them to efficiently solve certain problems for which no efficient classical methods are known. In 1994, Peter Shor provided the most famous example of such a quantum speedup by proving that quantum computers can factor integers in polynomial time. This running time is in striking contrast with the exponential running time of the best known classical algorithms. In the time since Shor's discovery, many algorithms leveraging the power of quantum computers have been introduced with applications ranging from cryptography to materials science. This promised increase in efficiency has provided great incentive to solve the challenges associated with building quantum computers and the resulting research efforts recently culminated in the development of small but fully programmable quantum computers. Despite this great experimental progress, applications of quantum computers remain distant. According to the current estimates, the cost of running quantum algorithms exceeds by far the most optimistic previsions for hardware growth. As a result, quantum computers are unlikely to solve problems of practical interests using available techniques. One of the main obstacles to the practical application of quantum computers is the overhead incurred when expressing a quantum algorithm as a logical quantum circuit. This process, which maps the abstract description of an algorithm to the explicit description of a quantum circuit, is often carried out using techniques developed more than a decade ago. At the time, these methods were considered sufficient because the challenges associated with building reliable quantum computers were so far from being met. In light of recent experimental progress, however, these methods appear inadequate. My research program aims at reducing the overhead associated with the construction of logical circuits and their decomposition into basic operations. I plan to develop new methods for the construction of quantum circuits and reliable tools for their optimization. I expect that the contributions stemming from my program will have significant effects on the field of quantum computation and will assist in turning quantum computers into instruments of scientific discovery.
Program
Discovery Grants Program - Individual
Recipient
Location
Nova Scotia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2018-04064
Name nom
Ross, Neil
Department département
Mathematics and Statistics
Organization id
79
Institution établissement
Dalhousie University
Province en
Nova Scotia
Province fr
Nouvelle-Écosse
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2018
Award amount
46000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR LA DÉCOUVERTE
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
9999
Research subject group en
Not available
Research subject group fr
Not available
Research subject en
Non disponible
Research subject fr
Non disponible
Application title
Mathematical Methods for Practical Quantum Computing
Keyword
Categorical Quantum Mechanics; Exact and Approximate Synthesis; Monoidal Categories; Normal Forms; Quantum Advantage; Quantum Circuit Optimization; Quantum Computing; Quantum Simulation; Rewriting
Application summary
The goal of my research program is to devise practical applications for computing devices known as quantum computers. Quantum computers can harness quantum mechanical phenomena. This allows them to efficiently solve certain problems for which no efficient classical methods are known. In 1994, Peter Shor provided the most famous example of such a quantum speedup by proving that quantum computers can factor integers in polynomial time. This running time is in striking contrast with the exponential running time of the best known classical algorithms. In the time since Shor's discovery, many algorithms leveraging the power of quantum computers have been introduced with applications ranging from cryptography to materials science. This promised increase in efficiency has provided great incentive to solve the challenges associated with building quantum computers and the resulting research efforts recently culminated in the development of small but fully programmable quantum computers. Despite this great experimental progress, applications of quantum computers remain distant. According to the current estimates, the cost of running quantum algorithms exceeds by far the most optimistic previsions for hardware growth. As a result, quantum computers are unlikely to solve problems of practical interests using available techniques. One of the main obstacles to the practical application of quantum computers is the overhead incurred when expressing a quantum algorithm as a logical quantum circuit. This process, which maps the abstract description of an algorithm to the explicit description of a quantum circuit, is often carried out using techniques developed more than a decade ago. At the time, these methods were considered sufficient because the challenges associated with building reliable quantum computers were so far from being met. In light of recent experimental progress, however, these methods appear inadequate. My research program aims at reducing the overhead associated with the construction of logical circuits and their decomposition into basic operations. I plan to develop new methods for the construction of quantum circuits and reliable tools for their optimization. I expect that the contributions stemming from my program will have significant effects on the field of quantum computation and will assist in turning quantum computers into instruments of scientific discovery.