Decision Diagrams for Symbolic Verification of Quantum Circuits
- Publisher:
- IEEE
- Publication Type:
- Conference Proceeding
- Citation:
- 2023 IEEE International Conference on Quantum Computing and Engineering (QCE), 2023, 1, pp. 970-977
- Issue Date:
- 2023-11-30
Embargoed
Filename | Description | Size | |||
---|---|---|---|---|---|
Decision Diagrams for Symbolic Verification of Quantum Circuits.pdf | Accepted version | 555.09 kB |
Copyright Clearance Process
- Recently Added
- In Progress
- Open Access
This item is currently unavailable due to the publisher's embargo.
With the rapid development of quantum computing automatic verification of quantum circuits becomes more and more important While several decision diagrams DDs have been introduced in quantum circuit simulation and verification none of them supports symbolic computation Algorithmic manipulations of symbolic objects however have been identified as crucial if not indispensable for several verification tasks This paper proposes the first decision diagram approach for operating symbolic objects and verifying quantum circuits with symbolic terms As a notable example our symbolic tensor decision diagrams symbolic TDD could verify the functionality of the 160 qubit quantum Fourier transform circuit within three minutes Moreover as demonstrated on Bernstein Vazirani algorithm Grover s algorithm and the bit flip error correction code the symbolic TDD enables efficient verification of quantum circuits with user supplied oracles and or classical controls
Please use this identifier to cite or link to this item: