Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs-Reference-Cited by-同舟云学术

Quantum Weakest Preconditions for Reasoning about Expected Runtimes of Quantum Programs

Published:2022-08-02 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science
language:
Short-container-title:

Author:

Liu Junyi¹,Zhou Li²,Barthe Gilles³,Ying Mingsheng⁴

Affiliation:

1. Institute of Software, Chinese Academy of Sciences, China and University of Chinese Academy of Sciences, China

2. Max Planck Institute for Security and Privacy, Germany

3. Max Planck Institute for Security and Privacy, Germany and IMDEA Software Institute, Spain

4. Institute of Software, Chinese Academy of Sciences, China and Tsinghua University, China

Funder

National Key Research and Development Program of China

National Natural Science Foundation of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3531130.3533327

Reference43 articles.

1. Quantum walks on graphs

2. Quantum Walk Algorithm for Element Distinctness

3. Quantum Random Walks – New Method for Designing Quantum Algorithms

4. One-dimensional quantum walks

5. Frank Arute , Kunal Arya , Ryan Babbush , Dave Bacon , Joseph C Bardin , Rami Barends , Rupak Biswas , Sergio Boixo , Fernando GSL Brandao , David A Buell , 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 ( 2019 ), 505–510. https://doi.org/10.1038/s41586-019-1666-5 10.1038/s41586-019-1666-5 Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando GSL Brandao, David A Buell, 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505–510. https://doi.org/10.1038/s41586-019-1666-5

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System;Proceedings of the ACM on Programming Languages;2024-08-15

2. The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation;Proceedings of the ACM on Programming Languages;2024-06-20

3. On the Hardness of Analyzing Quantum Programs Quantitatively;Lecture Notes in Computer Science;2024

4. Circuit Width Estimation via Effect Typing and Linear Dependency;Lecture Notes in Computer Science;2024

5. Structured Theorem for Quantum Programs and its Applications;ACM Transactions on Software Engineering and Methodology;2023-05-26