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

single_qubit_gates benchmark #3

Open
overshiki opened this issue May 5, 2022 · 0 comments
Open

single_qubit_gates benchmark #3

overshiki opened this issue May 5, 2022 · 0 comments

Comments

@overshiki
Copy link
Owner

The circuit in benchmark/single_qubit_gates.jl originally has 30 gates, and could be simplified into at least 20 gates. A naive cancellation strategy could achieve a simplification of 22 gates, while the remaining 2 gates require a combination of commute and nearby cancellation rules. If egraph idea is really powerful, it should be able to simplify the circuit to 20 gates.

However, the test shows it can not be saturated, and could only achieve a simplification to 22 gates, after a timeout.

Related issues of the hardness of saturations are egg discussion

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant