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.

Sign up for GitHub

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

Greedy topological sort of the binst graph to minimize qubit allocations / deallocations #1099

Merged
merged 9 commits into from
Jul 6, 2024

Remove qpic diagram test for decomposition since its not DAMP

12c3528
Select commit
Loading
Failed to load commit list.
Merged

Greedy topological sort of the binst graph to minimize qubit allocations / deallocations #1099

Remove qpic diagram test for decomposition since its not DAMP
12c3528
Select commit
Loading
Failed to load commit list.
Google CLA / cla/google succeeded Jul 6, 2024 in 0s

✅ All contributors are covered under a CLA with Google

See https://cla.developers.google.com/ for more info about Google's Contributor License Agreement (CLA).

ℹ️ Googlers: Go here to view more details and manage scans for this pull request.

Details

The following contributors were found for this pull request:

✅ 12c3528 Author: @tanujkhattar <tan******tar​@google.com>

(Only the first commit for a unique contributor is listed.)

View more details on Google CLA