You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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.
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.
The text was updated successfully, but these errors were encountered: