Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université d'Ottawa

$26,000.00

Applications and Advances in Quantum Complexity

FY 2024-25

Summary
Recently, quantum information theory has produced significant scientific achievements, such as the complexity theory result MIP* = RE, the establishment of quantum advantage, and protocols for delegating quantum computation. Central to these breakthroughs is a delicate interplay between the relatively young field of quantum complexity theory, and various disciplines. For example, techniques in operator algebras have facilitated breakthroughs in non-locality/self-testing, a key ingredient in both delegated quantum computation and the MIP* = RE result. Conversely, techniques in complexity theory can help make progress in operator algebras, as illustrated by the resolution of Connes Embedding problem via the MIP* = RE result. Similarly, complexity theory tells us which physical systems we cannot efficiently simulate, and thus informs demonstrations of quantum advantage. Navigating this interdisciplinary landscape requires collaboration between experts who can differ significantly in their techniques, and intuitions. This proposal aims to build bridges across these disciplines in order to obtain highly impactful results on topics such as: Complexity in games, Complexity in quantum graphs, Applications/ Advances in quantum proof protocols, and Applications of quantum advantage. These results are poised to make pivotal contributions to this rapidly evolving field and further reinforce Canada's reputation as a global frontrunner in quantum computing and quantum information theory.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2024-06049
Name nom
Mehta, Arthur
Department département
Mathematics and Statistics
Organization id
28
Institution établissement
Université d'Ottawa
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2024
Competition year année de concours
2024
Award amount
26000
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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2900
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Pure mathematics
Research subject fr
Mathématiques pures
Field of research list names en
Not available
Field of research list names fr
Non disponible
Socioeconomic objective list names en
Not available
Socioeconomic objective list names fr
Non disponible
Application title
Applications and Advances in Quantum Complexity
Keywords
quantum complexity theory; non-local games; operator algebras; operator systems; device independence; quantum advantage; quantum graphs; delegated quantum computation; quantum cryptography
Application summary
Recently, quantum information theory has produced significant scientific achievements, such as the complexity theory result MIP* = RE, the establishment of quantum advantage, and protocols for delegating quantum computation. Central to these breakthroughs is a delicate interplay between the relatively young field of quantum complexity theory, and various disciplines. For example, techniques in operator algebras have facilitated breakthroughs in non-locality/self-testing, a key ingredient in both delegated quantum computation and the MIP* = RE result. Conversely, techniques in complexity theory can help make progress in operator algebras, as illustrated by the resolution of Connes Embedding problem via the MIP* = RE result. Similarly, complexity theory tells us which physical systems we cannot efficiently simulate, and thus informs demonstrations of quantum advantage. Navigating this interdisciplinary landscape requires collaboration between experts who can differ significantly in their techniques, and intuitions. This proposal aims to build bridges across these disciplines in order to obtain highly impactful results on topics such as: Complexity in games, Complexity in quantum graphs, Applications/ Advances in quantum proof protocols, and Applications of quantum advantage. These results are poised to make pivotal contributions to this rapidly evolving field and further reinforce Canada's reputation as a global frontrunner in quantum computing and quantum information theory.