Grant: Discovery Grants Program - Individual
University of Calgary
$122,000.00
Scalable Quantum Computing
FY 2023-24
Summary
Quantum computing aims to solve some classical (i.e., non-quantum) problems faster than classical computers allow. Technically, this speedup means that the computational time scales better for a quantum computer than for a classical computer. Three examples help to explain. Whereas the time to find a marked item in an unstructured search of N items is linear in N classically, a quantum search is provably quadratically better, i.e., requiring only the square root of N evaluations. Quantum factorization, which is based on finding hidden periodicity efficiently on a quantum computer, is superpolynomially faster than the sub-exponential-time classical number-field sieve and has potential applications to linear-equation solvers. Quantum annealers aspire to demonstrate speedup over classical computing for some hard optimization problems and the quantum advantage is an open question. Optimization problems are ubiquitous, such as in finance and protein folding, so success with quantum annealing could have enormous positive ramifications for society. A key point of these goals is that the quantum computer itself must scale well to larger numbers of qubits and run-times or the theoretical advantage of quantum computing is lost to hardware problems. This research program addresses and seeks to resolve the problems of scalability, driven by the principle of co-design, namely that the type of problem being solved influences choices about architecture and design and the limitations of the computer influences which computational problems are suitable for quantum computing. This research involves one undergraduate student annually, five graduate students and one postdoctoral researcher in strategically important research topics that underpin positively disrupting, i.e., rapidly transforming, computer technology with ramifications in many areas of science, technology and beyond. These trainees will have opportunities to work with experts in experimental physics and in computer science, which prepares them for academic and industrial opportunities in quantum computing. This project aims to advance scalability of quantum computing along the following avenues, namely designing high-fidelity quantum circuits, developing quantum algorithms for dozens-of-qubits quantum computing, creating algorithms for sampling problems inspired by the BosonSampling problem, articulating verification-and-validation to know that components and devices meet standards and do what they are supposed to, and establishing confidentiality, integrity and availability for interconnected quantum things. In this last case, things refers to components, devices and systems and pertains to quantum networking, multi-party quantum communication and quantum computing on the cloud. One graduate student will work on each of these five avenues and a postdoctoral researcher will have the grand view and interconnect these discoveries. The undergraduate students will focus on solving technical issues.
Program
Discovery Grants Program - Individual
Recipient
Location
Alberta, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
RGPIN-2019-04840
Name nom
Sanders, Barry
Department département
Physics and Astronomy - Physics and Astronomy
Organization id
11
Institution établissement
University of Calgary
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2023
Competition year année de concours
2019
Award amount
122000
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
1505
Committee name en
Physics
Committee name fr
Physique
Area of application code
1202
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Physical sciences
Area of application fr
Sciences physiques
Research subject code
2805
Research subject group en
Artificial intelligence
Research subject group fr
Learning and inference theories
Research subject en
Intelligence artificielle
Research subject fr
Théories de l'apprentissage et l'inférence
Application title
Scalable Quantum Computing
Keyword
Ion trap; Quantum algorithm; Quantum computing; Quantum control; Quantum information; Quantum network; Quantum simulation; Reinforcement learning; Superconducting circuit; Verification and Validation
Application summary
Quantum computing aims to solve some classical (i.e., non-quantum) problems faster than classical computers allow. Technically, this speedup means that the computational time scales better for a quantum computer than for a classical computer. Three examples help to explain. Whereas the time to find a marked item in an unstructured search of N items is linear in N classically, a quantum search is provably quadratically better, i.e., requiring only the square root of N evaluations. Quantum factorization, which is based on finding hidden periodicity efficiently on a quantum computer, is superpolynomially faster than the sub-exponential-time classical number-field sieve and has potential applications to linear-equation solvers. Quantum annealers aspire to demonstrate speedup over classical computing for some hard optimization problems and the quantum advantage is an open question. Optimization problems are ubiquitous, such as in finance and protein folding, so success with quantum annealing could have enormous positive ramifications for society. A key point of these goals is that the quantum computer itself must scale well to larger numbers of qubits and run-times or the theoretical advantage of quantum computing is lost to hardware problems. This research program addresses and seeks to resolve the problems of scalability, driven by the principle of co-design, namely that the type of problem being solved influences choices about architecture and design and the limitations of the computer influences which computational problems are suitable for quantum computing. This research involves one undergraduate student annually, five graduate students and one postdoctoral researcher in strategically important research topics that underpin positively disrupting, i.e., rapidly transforming, computer technology with ramifications in many areas of science, technology and beyond. These trainees will have opportunities to work with experts in experimental physics and in computer science, which prepares them for academic and industrial opportunities in quantum computing. This project aims to advance scalability of quantum computing along the following avenues, namely designing high-fidelity quantum circuits, developing quantum algorithms for dozens-of-qubits quantum computing, creating algorithms for sampling problems inspired by the BosonSampling problem, articulating verification-and-validation to know that components and devices meet standards and do what they are supposed to, and establishing confidentiality, integrity and availability for interconnected quantum things. In this last case, things refers to components, devices and systems and pertains to quantum networking, multi-party quantum communication and quantum computing on the cloud. One graduate student will work on each of these five avenues and a postdoctoral researcher will have the grand view and interconnect these discoveries. The undergraduate students will focus on solving technical issues.