Grant: Discovery Grants Program - Individual
University of Waterloo
$27,000.00
Operator Algebras and Quantum Information
FY 2018-19
Summary
This grant will study problems that have a strong link between operator algebras and quantum information theory. We will study the probability densities that can arise from the randomness of quantum experiments. Currently, there are several mathematical models for what these probability densities are and it is not known if they all yield the same sets of densities matrices. Whether or not two of these models give the same sets of densities is now known to be equivalent to one of the important open problems in operator algebras, the Connes embedding conjecture. *Many two-person games which have no winning strategy, when one is restricted to use classically generated randomness, can have winning strategies when the randomness arises from entangled quantum experiments. We will study the problem of whether or not all models for these quantum probability densities agree by trying to determine if the games that have winning strategies for these different models are the same or not.*Many games that we study arise from graph theory and have the property that if one is restricted to asking for a winning classical strategy, then that can happen if and only if the game parameters are the same as the usual graph parameters. But when one allows these winning quantum strategies the values of these parameters can be much smaller. For example, the coloring number of a graph is the smallest number of colors needed so that each vertex can be assigned a color with no two adjacent vertices receiving the same color. In the graph coloring game, two players try to convince a referee that they have a coloring, using a certain number of colors, by answering a series of questions. The questions are designed so that they never need to divulge the actual coloring. If the players use classical probability densities, then the fewest number of colors that they can use and always win is exactly the coloring number, but if they use an entangled quantum experiment to produce their answers, then they can design a strategy that always gives correct answers but uses far fewer colors. This smallest value we call the quantum chromatic number. But this integer could depend on which model of quantum mechanics that we use. In a similar manner, we are able to generate new quantum values for many other graph parameters. Trying to compute these values always reduces to a problem in operator algebras, for which we have no clear answers and no algorithms. Some of these problems are known to belong to a family of problems called the NP-hard problems.* These problems can all be interpreted as questions about tensor products of operator systems, and the study of these tensor products and operator systems is our longer term research project. Operator systems and completely positive maps are fundamental to quantum information theory and we will continue to pursue both the theory and the applications of these objects.*
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2016-03784
Name nom
Paulsen, Vern
Department département
Pure Mathematics
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2018
Competition year année de concours
2016
Award amount
27000
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
2904
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Operator algebra
Research subject fr
Algèbre des opérateurs
Partie
3
Nb partie
5
Application title
Operator Algebras and Quantum Information
Keyword
NSERC
Application summary
This grant will study problems that have a strong link between operator algebras and quantum information theory. We will study the probability densities that can arise from the randomness of quantum experiments. Currently, there are several mathematical models for what these probability densities are and it is not known if they all yield the same sets of densities matrices. Whether or not two of these models give the same sets of densities is now known to be equivalent to one of the important open problems in operator algebras, the Connes embedding conjecture. *Many two-person games which have no winning strategy, when one is restricted to use classically generated randomness, can have winning strategies when the randomness arises from entangled quantum experiments. We will study the problem of whether or not all models for these quantum probability densities agree by trying to determine if the games that have winning strategies for these different models are the same or not.*Many games that we study arise from graph theory and have the property that if one is restricted to asking for a winning classical strategy, then that can happen if and only if the game parameters are the same as the usual graph parameters. But when one allows these winning quantum strategies the values of these parameters can be much smaller. For example, the coloring number of a graph is the smallest number of colors needed so that each vertex can be assigned a color with no two adjacent vertices receiving the same color. In the graph coloring game, two players try to convince a referee that they have a coloring, using a certain number of colors, by answering a series of questions. The questions are designed so that they never need to divulge the actual coloring. If the players use classical probability densities, then the fewest number of colors that they can use and always win is exactly the coloring number, but if they use an entangled quantum experiment to produce their answers, then they can design a strategy that always gives correct answers but uses far fewer colors. This smallest value we call the quantum chromatic number. But this integer could depend on which model of quantum mechanics that we use. In a similar manner, we are able to generate new quantum values for many other graph parameters. Trying to compute these values always reduces to a problem in operator algebras, for which we have no clear answers and no algorithms. Some of these problems are known to belong to a family of problems called the NP-hard problems.* These problems can all be interpreted as questions about tensor products of operator systems, and the study of these tensor products and operator systems is our longer term research project. Operator systems and completely positive maps are fundamental to quantum information theory and we will continue to pursue both the theory and the applications of these objects.*