FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914031216885760 |
|---|---|
| author | Wang, Ziyuan Cheng, Bin Yuan, Longxiang Ji, Zhengfeng |
| author_facet | Wang, Ziyuan Cheng, Bin Yuan, Longxiang Ji, Zhengfeng |
| contents | Applications of decision diagrams in quantum circuit analysis have been an active research area. Our work introduces FeynmanDD, a new method utilizing standard and multi-terminal decision diagrams for quantum circuit simulation and equivalence checking. Unlike previous approaches that exploit patterns in quantum states and operators, our method explores useful structures in the path integral formulation, essentially transforming the analysis into a counting problem. The method then employs efficient counting algorithms using decision diagrams as its underlying computational engine. Through comprehensive theoretical analysis and numerical experiments, we demonstrate FeynmanDD's capabilities and limitations in quantum circuit analysis, highlighting the value of this new BDD-based approach. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_08276 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams Wang, Ziyuan Cheng, Bin Yuan, Longxiang Ji, Zhengfeng Quantum Physics Data Structures and Algorithms Applications of decision diagrams in quantum circuit analysis have been an active research area. Our work introduces FeynmanDD, a new method utilizing standard and multi-terminal decision diagrams for quantum circuit simulation and equivalence checking. Unlike previous approaches that exploit patterns in quantum states and operators, our method explores useful structures in the path integral formulation, essentially transforming the analysis into a counting problem. The method then employs efficient counting algorithms using decision diagrams as its underlying computational engine. Through comprehensive theoretical analysis and numerical experiments, we demonstrate FeynmanDD's capabilities and limitations in quantum circuit analysis, highlighting the value of this new BDD-based approach. |
| title | FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams |
| topic | Quantum Physics Data Structures and Algorithms |
| url | https://arxiv.org/abs/2509.08276 |