Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$44,000.00

Algorithms for quantum computers

EF 2013-14

Résumé
The computers we use today operate according to principles that are rooted in classical physics. They represent data using bits, each bit taking the value 0 or 1. But quantum mechanics, the theory describing the behavior of atoms (and, fundamentally, all physical systems), offers a more general notion of information. In quantum mechanics, data can take on a superposition of the possible classical values. To exploit this new kind of information, we can envision constructing a quantum mechanical computer, an information-processing machine that operates according to the laws of quantum mechanics. Key discoveries in the 1980s and early 1990s showed that quantum computers could quickly perform certain tasks that seem to be intractable for classical computers. For example, there is an efficient quantum algorithm for decomposing an integer into its prime factors. No such algorithm is known for classical computers, and indeed, many of the cryptosystems in use today (for example, to encrypt financial transactions on the internet) are based on the widely-held assumption that this problem is hard. Thus quantum computers overturn established notions of what can be computed efficiently, with potentially dramatic implications for technology. However, only a handful of examples of quantum speedup are known, and the nature of the computational advantage provided by quantum mechanics is still poorly understood. My research program is focused on better understanding the power of quantum computers. Specifically, I work to develop new quantum algorithms that achieve dramatic speedup over classical computation. This research serves both to illuminate the differences between classical and quantum information processing and to find quantum solutions for problems of practical importance, such as search problems and cryptographic tasks. I am especially interested in developing novel algorithmic techniques for quantum computation, augmenting the toolbox of methods that can be used to design and analyze quantum algorithms.
Programme
Discovery Grants Program - Individual
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
356068-2013
Name nom
Childs, Andrew
Department département
Combinatorics and Optimization
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2013
Award amount
44000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2712
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Theory of computation
Research subject fr
Théorie de calcul
Partie
1
Nb partie
5
Application title
Algorithms for quantum computers
Keyword
NSERC
Application summary
The computers we use today operate according to principles that are rooted in classical physics. They represent data using bits, each bit taking the value 0 or 1. But quantum mechanics, the theory describing the behavior of atoms (and, fundamentally, all physical systems), offers a more general notion of information. In quantum mechanics, data can take on a superposition of the possible classical values. To exploit this new kind of information, we can envision constructing a quantum mechanical computer, an information-processing machine that operates according to the laws of quantum mechanics. Key discoveries in the 1980s and early 1990s showed that quantum computers could quickly perform certain tasks that seem to be intractable for classical computers. For example, there is an efficient quantum algorithm for decomposing an integer into its prime factors. No such algorithm is known for classical computers, and indeed, many of the cryptosystems in use today (for example, to encrypt financial transactions on the internet) are based on the widely-held assumption that this problem is hard. Thus quantum computers overturn established notions of what can be computed efficiently, with potentially dramatic implications for technology. However, only a handful of examples of quantum speedup are known, and the nature of the computational advantage provided by quantum mechanics is still poorly understood. My research program is focused on better understanding the power of quantum computers. Specifically, I work to develop new quantum algorithms that achieve dramatic speedup over classical computation. This research serves both to illuminate the differences between classical and quantum information processing and to find quantum solutions for problems of practical importance, such as search problems and cryptographic tasks. I am especially interested in developing novel algorithmic techniques for quantum computation, augmenting the toolbox of methods that can be used to design and analyze quantum algorithms.