Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of Waterloo

$30,000.00

Problems in algebraic combinatorics

EF 2014-15

Résumé
Physicists, computer scientists and mathematicians are working to decide how we may best make use of quantum computers. Here the basic problem is to work out just what we might do with a quantum computer that we cannot do with the ordinary computers already on our desks. This raises many questions, and a number of these are related to problems that have long been studied by mathematicians. My research will concern three of these.(1) One of the strange features of quantum mechanics is that it is formulated in terms of complex, rather than real, space. A consequence of this is that questions about measurements are related to questions about certain families of lines in complex space. But the real analogs of these problems have already been extensively studied by mathematicians, and I would like to use these results as a guide to extend our knowledge in the complex case. (2) Operating a quantum computer will require us to move information around a network efficiently. One of the most efficient ways to do this involves what physicists call ""perfect state transfer''. The underlying theory here is determined by the structure of the underlying network and, more precisely on the spectral properties of the underlying graph. This is a subject that mathematicians have studied for many years, and my aim is to apply what we have learned to these new problems. (3) Finally there are not many problems where we can expect a quantum computer to be more effective than a classical computer. One of these is the graph isomorphism problem. Physicists have proposed a number of algorithms for this, but cannot show that they will actually work in practice. I have shown that some of these do not work, and I plan to study the algorithms whose status is undecided.
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
9439-2012
Name nom
Godsil, Christopher
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
2014
Competition year année de concours
2012
Award amount
30000
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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
3
Nb partie
5
Application title
Problems in algebraic combinatorics
Keyword
NSERC
Application summary
Physicists, computer scientists and mathematicians are working to decide how we may best make use of quantum computers. Here the basic problem is to work out just what we might do with a quantum computer that we cannot do with the ordinary computers already on our desks. This raises many questions, and a number of these are related to problems that have long been studied by mathematicians. My research will concern three of these.(1) One of the strange features of quantum mechanics is that it is formulated in terms of complex, rather than real, space. A consequence of this is that questions about measurements are related to questions about certain families of lines in complex space. But the real analogs of these problems have already been extensively studied by mathematicians, and I would like to use these results as a guide to extend our knowledge in the complex case. (2) Operating a quantum computer will require us to move information around a network efficiently. One of the most efficient ways to do this involves what physicists call ""perfect state transfer''. The underlying theory here is determined by the structure of the underlying network and, more precisely on the spectral properties of the underlying graph. This is a subject that mathematicians have studied for many years, and my aim is to apply what we have learned to these new problems. (3) Finally there are not many problems where we can expect a quantum computer to be more effective than a classical computer. One of these is the graph isomorphism problem. Physicists have proposed a number of algorithms for this, but cannot show that they will actually work in practice. I have shown that some of these do not work, and I plan to study the algorithms whose status is undecided.