In this talk I will introduce the quantum phase-estimation problem as well as the iterative algorithm by Kitaev that is commonly used to solve it. I show how Kitaev’s algorithm can be modified to obtain an asymptotically minimal sampling complexity. Two novel algorithms for obtaining an initial phase estimate, used to start the iterative estimation process, are given along with their theoretical sample complexity.
Event Categories
- Mathematical Biology Seminar
- IAM Career Chats
- IAM Seminar
- IAM Graduate Seminar
- SCAIM Seminar
- Fluids Seminar
- Mathematics of Information and Applications Seminar
- BC Data Science Colloquium
- IAM Distinguished Colloquium
- Probability Seminar
- CS Seminar
- Quantum Information and Computing
- Algorithms Seminars
- Annual Retreat
- PIMS
- Other IAM Events
- Computer Science Distinguigshed Lectures
- IAM-PIMS Distinguished Colloquium
- IAM Public Lecture
- IAM Distinguished Alumni Lecture
- IAM Seminar / UBC Early-Career Award Lecture