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

Jump to bottom

[Prototype] Efficient Graph-based Decomposition with Dijkstra's Algorithm #6302

Draft
wants to merge 4 commits into
base: master
Choose a base branch
from
Draft

[Prototype] Efficient Graph-based Decomposition with Dijkstra's Algorithm #6302

wants to merge 4 commits into from
+457 −0

Conversation

astralcai
Copy link
Contributor

  • Implements a DecompositionLibrary that holds different potential decompositions for operators.
  • Implements a DecompositionGraph that solves the graph traversal problem using Dijkstra's algorithm to find the most efficient decomposition paths for all operators in the graph.

@github-actions GitHub Actions
Copy link
Contributor

Hello. You may have forgotten to update the changelog!
Please edit doc/releases/changelog-dev.md with:

  • A one-to-two sentence description of the change. You may include a small working example for new features.
  • A link back to this PR.
  • Your name (or GitHub username) in the contributors section.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@astralcai