Verifying Quantum Phase Estimation (QPE) using Prove-It
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914726735249408 |
|---|---|
| author | Witzel, Wayne M. Craft, Warren D. Carr, Robert Kapur, Deepak |
| author_facet | Witzel, Wayne M. Craft, Warren D. Carr, Robert Kapur, Deepak |
| contents | The general-purpose interactive theorem-proving assistant called Prove-It was used to verify the Quantum Phase Estimation (QPE) algorithm, specifically claims about its outcome probabilities. Prove-It is unique in its ability to express sophisticated mathematical statements, including statements about quantum circuits, integrated firmly within its formal theorem-proving framework. We demonstrate our ability to follow a textbook proof to produce a formally certified proof, highlighting useful automation features to fill in obvious steps and make formal proving nearly as straightforward as informal theorem proving. Finally, we make comparisons with formal theorem-proving in other systems where similar claims about QPE have been proven. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_02183 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Verifying Quantum Phase Estimation (QPE) using Prove-It Witzel, Wayne M. Craft, Warren D. Carr, Robert Kapur, Deepak Quantum Physics Logic in Computer Science The general-purpose interactive theorem-proving assistant called Prove-It was used to verify the Quantum Phase Estimation (QPE) algorithm, specifically claims about its outcome probabilities. Prove-It is unique in its ability to express sophisticated mathematical statements, including statements about quantum circuits, integrated firmly within its formal theorem-proving framework. We demonstrate our ability to follow a textbook proof to produce a formally certified proof, highlighting useful automation features to fill in obvious steps and make formal proving nearly as straightforward as informal theorem proving. Finally, we make comparisons with formal theorem-proving in other systems where similar claims about QPE have been proven. |
| title | Verifying Quantum Phase Estimation (QPE) using Prove-It |
| topic | Quantum Physics Logic in Computer Science |
| url | https://arxiv.org/abs/2304.02183 |