Bounds for Quantum Circuits using Logic-Based Analysis
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929608498085888 |
|---|---|
| author | Fauseweh, Benedikt Hermann, Ben Howar, Falk |
| author_facet | Fauseweh, Benedikt Hermann, Ben Howar, Falk |
| contents | We explore ideas for scaling verification methods for quantum circuits using SMT (Satisfiability Modulo Theories) solvers. We propose two primary strategies: (1) decomposing proof obligations via compositional verification and (2) leveraging linear over-approximation techniques for gate effects. We present two examples and demonstrate the application of these ideas to proof Hamming weight preservation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_19177 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Bounds for Quantum Circuits using Logic-Based Analysis Fauseweh, Benedikt Hermann, Ben Howar, Falk Logic in Computer Science Software Engineering We explore ideas for scaling verification methods for quantum circuits using SMT (Satisfiability Modulo Theories) solvers. We propose two primary strategies: (1) decomposing proof obligations via compositional verification and (2) leveraging linear over-approximation techniques for gate effects. We present two examples and demonstrate the application of these ideas to proof Hamming weight preservation. |
| title | Bounds for Quantum Circuits using Logic-Based Analysis |
| topic | Logic in Computer Science Software Engineering |
| url | https://arxiv.org/abs/2411.19177 |