Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Verify compilation for large circuits #62

Open
jordandsullivan opened this issue Nov 1, 2024 · 0 comments
Open

Verify compilation for large circuits #62

jordandsullivan opened this issue Nov 1, 2024 · 0 comments
Labels
feature New feature or request

Comments

@jordandsullivan
Copy link
Collaborator

jordandsullivan commented Nov 1, 2024

Our current tests for circuit logical equivalence before and after compilation work by comparing the state vectors, which restricts is to running small circuits of <20 qubits if we want our tests to finish promptly.

There are many options for checking equivalence: graph isomorphism, unwinding SWAP gates, near-Clifford simulation, and more formal methods.

The most immediately applicable may be from this paper, since it was written to verify the Qiskit compiler specifically by Fred Chong's group: Giallar: Push-Button Verification for the Qiskit Quantum Compiler.
@Misty-W found the repo: https://github.com/taorunz/Giallar/tree/master

If possible, it would be great to add to UCC as a testing dependency.

Other tools to be aware of are MQT-QCEC, written in C++ and more general.

@jordandsullivan jordandsullivan added the feature New feature or request label Nov 15, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
feature New feature or request
Projects
None yet
Development

No branches or pull requests

1 participant