Grant: Discovery Grants Program - Individual
Simon Fraser University
$50,000.00
Combinatorial designs in quantum information theory and digital communications
FY 2017-18
Summary
Modern society would be unrecognizable without digital communications technologies such as satellite communication, cell phones, portable music players, flash drives, GPS (global positioning system) navigation, and movies on demand. A key reason these technologies have become ubiquitous, widely accepted, and highly dependable is the critical support provided by embedded mathematical structures and algorithms that remain invisible to the user. The requirement for embedded mathematics in these technologies derives from a combination of physical constraints, for example the desire to send information from one device to another using energy efficiently, or to pass information securely between two parties even though outsiders can monitor the exchange, or to recover transmitted information correctly despite corruption of the original signal by noise. These combinations of physical constraints correspond to mathematical problems of arranging objects subject to multiple constraints; such problems are solved by combinatorial designs . The short-term objectives of this proposal involve the use of combinatorial designs to solve three notoriously challenging problems of digital communications: (1) Construct large sets of complex equiangular lines. (2) Constrain the largest number of complex mutually unbiased bases. (3) Construct families of binary sequences with large asymptotic merit factor. Seeking a complete solution to these problems is highly ambitious: each has resisted considerable effort over decades by numerous mathematicians, physicists, and engineers. Problems 1 and 2 arise in quantum information theory, a dynamic research area dealing with the processing of information at very small scales where conventional physics no longer applies. Solving these problems would benefit the quantum version of cryptography (where one wishes to make messages difficult for an adversary to read) and the quantum version of error-correcting codes (where, on the contrary, one wishes to make messages easy for others to read even in the presence of noise). The importance of combinatorial designs in solving these problems has not yet been established, and is a major innovative aspect of this proposal. Problem 3 arises in conventional (non-quantum) digital communications and in statistical mechanics. Its solution would allow the design of more efficient radar and wireless communications, and the creation of patentable technology. The aim is not only to solve these specific problems, but in doing so to create new tools and methods for analyzing a wide class of combinatorial structures related to digital communications. This links to the long-term goal of my research program: to combine combinatorial, algebraic, analytical, and computational techniques to transform radically the study of classical and emerging problems that are important in practical and theoretical digital communications.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2015-04881
Name nom
Jedwab, Jonathan
Department département
Mathematics - Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2017
Competition year année de concours
2015
Award amount
50000
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
2718
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Communication and information theory
Research subject fr
Théorie des télécommunications et de l'information
Partie
3
Nb partie
6
Application title
Combinatorial designs in quantum information theory and digital communications
Keyword
NSERC
Application summary
Modern society would be unrecognizable without digital communications technologies such as satellite communication, cell phones, portable music players, flash drives, GPS (global positioning system) navigation, and movies on demand. A key reason these technologies have become ubiquitous, widely accepted, and highly dependable is the critical support provided by embedded mathematical structures and algorithms that remain invisible to the user. The requirement for embedded mathematics in these technologies derives from a combination of physical constraints, for example the desire to send information from one device to another using energy efficiently, or to pass information securely between two parties even though outsiders can monitor the exchange, or to recover transmitted information correctly despite corruption of the original signal by noise. These combinations of physical constraints correspond to mathematical problems of arranging objects subject to multiple constraints; such problems are solved by combinatorial designs . The short-term objectives of this proposal involve the use of combinatorial designs to solve three notoriously challenging problems of digital communications: (1) Construct large sets of complex equiangular lines. (2) Constrain the largest number of complex mutually unbiased bases. (3) Construct families of binary sequences with large asymptotic merit factor. Seeking a complete solution to these problems is highly ambitious: each has resisted considerable effort over decades by numerous mathematicians, physicists, and engineers. Problems 1 and 2 arise in quantum information theory, a dynamic research area dealing with the processing of information at very small scales where conventional physics no longer applies. Solving these problems would benefit the quantum version of cryptography (where one wishes to make messages difficult for an adversary to read) and the quantum version of error-correcting codes (where, on the contrary, one wishes to make messages easy for others to read even in the presence of noise). The importance of combinatorial designs in solving these problems has not yet been established, and is a major innovative aspect of this proposal. Problem 3 arises in conventional (non-quantum) digital communications and in statistical mechanics. Its solution would allow the design of more efficient radar and wireless communications, and the creation of patentable technology. The aim is not only to solve these specific problems, but in doing so to create new tools and methods for analyzing a wide class of combinatorial structures related to digital communications. This links to the long-term goal of my research program: to combine combinatorial, algebraic, analytical, and computational techniques to transform radically the study of classical and emerging problems that are important in practical and theoretical digital communications.