Interdisciplinary Research On Quantum CS- Cryptography, Program Verification, and Their Interplay
Abstract
As scalable quantum computers are expected to be realized in the future, there has been fast- growing research on investigating how quantum computation can revolutionize computer science, leading to many emerging fields in quantum computer science. In this proposal, we focus on quantum cryptography and program verification based on our expertise and past collaboration. For quantum cryptography, our primary goal is to understand the type of computational hardness in the quantum world by investigating the relationship among computational quantum primitives and through the lens of quantum complexity theory. We also plan to tackle the question of verifiably delegating quantum computation with negligible soundness error, a challenging open question when the computation outputs a quantum state or a randomized sample. For quantum program verification, we have recently developed a novel tree-automata-based approach for fully automated quantum program verification. Our approach is the first to combine automata theory and quantum program verification with great potential in its versatility and scalability compared to others. We plan to further investigate this approach in many directions. Finally, we will investigate possible interplay between the two fields. A potential direction is to study the complexity of the computational problems raised in quantum program verification. We hope this may inspire new quantum approaches for quantum program verification.
Document Details
- Document Type
- DoD Grant Award
- Publication Date
- Feb 16, 2024
- Source ID
- FA23862314107
Entities
People
- Kai-Min Chung
Organizations
- Academia Sinica
- Air Force Office of Scientific Research
- United States Air Force