Pub Date : 2023-09-17DOI: 10.1109/qce57702.2023.20313
Brian La Cour, Lia Yeh, Marek Osinski
{"title":"Message from the Chairs","authors":"Brian La Cour, Lia Yeh, Marek Osinski","doi":"10.1109/qce57702.2023.20313","DOIUrl":"https://doi.org/10.1109/qce57702.2023.20313","url":null,"abstract":"","PeriodicalId":117771,"journal":{"name":"International Conference on Quantum Computing and Engineering","volume":"51 1","pages":"xiii"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139339308","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-17DOI: 10.1109/qce57702.2023.20312
H. Müller, Yuri Alexev, Andrea Delgado, Greg Byrd
{"title":"Message from the Chairs: 2023 IEEE International Conference on Quantum Computing and Engineering","authors":"H. Müller, Yuri Alexev, Andrea Delgado, Greg Byrd","doi":"10.1109/qce57702.2023.20312","DOIUrl":"https://doi.org/10.1109/qce57702.2023.20312","url":null,"abstract":"","PeriodicalId":117771,"journal":{"name":"International Conference on Quantum Computing and Engineering","volume":"19 1","pages":"xxiii-xxv"},"PeriodicalIF":0.0,"publicationDate":"2023-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139339420","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-10-01DOI: 10.1109/QCE49297.2020.00011
E. Berg
In this work we consider Kitaev's algorithm for quantum phase estimation. We analyze the use of phase shifts that simplify the estimation of successive bits in the estimation of unknown phase φ, By using increasingly accurate shifts we reduce the number of measurements to the point where only a single measurement is needed for each additional bit. This results in an algorithm that can estimate φ to $m$ + 2 bits of accuracy with probability at least 1- ∊ using $N$ ∊ + $m$ measurements, where $N$ ∊ is a quantity that depends only on ∊ and the particular sampling algorithm. We present different sampling algorithms and study the exact number of measurements needed through careful numerical evaluation, and provide theoretical bounds and numerical values for $N$ ∊ .
{"title":"Iterative quantum phase estimation with optimized sample complexity","authors":"E. Berg","doi":"10.1109/QCE49297.2020.00011","DOIUrl":"https://doi.org/10.1109/QCE49297.2020.00011","url":null,"abstract":"In this work we consider Kitaev's algorithm for quantum phase estimation. We analyze the use of phase shifts that simplify the estimation of successive bits in the estimation of unknown phase φ, By using increasingly accurate shifts we reduce the number of measurements to the point where only a single measurement is needed for each additional bit. This results in an algorithm that can estimate φ to $m$ + 2 bits of accuracy with probability at least 1- ∊ using $N$ ∊ + $m$ measurements, where $N$ ∊ is a quantity that depends only on ∊ and the particular sampling algorithm. We present different sampling algorithms and study the exact number of measurements needed through careful numerical evaluation, and provide theoretical bounds and numerical values for $N$ ∊ .","PeriodicalId":117771,"journal":{"name":"International Conference on Quantum Computing and Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121216637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：