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

✨ Improved circuit decomposition for heuristic Clifford synthesis #305

Open
pehamTom opened this issue May 8, 2023 · 0 comments
Open
Labels
enhancement Anything related to improvements of the existing library

Comments

@pehamTom
Copy link
Member

pehamTom commented May 8, 2023

What's the problem this feature will solve?

The current implementation only allows for vertical splitting of circuits. Other decomposition schemes (like horizontal decompositions) have to be done manually before calling the solver several times. It would be an interesting direction to look at improved decomposition schemes.

Describe the solution you'd like

One way to provide maximal flexibility is to be able to specify a maximal depth and a maximal number of qubits that limit the kind of decompositions that are possible. Since parallelism of decomposed circuit is traded off with depth, an even more advanced way would be to figure the "optimal" parameters out without user input. Something like an analysis of the connectivity of the unoptimized input circuit could provide key insights.

@pehamTom pehamTom added the enhancement Anything related to improvements of the existing library label May 8, 2023
@burgholzer burgholzer removed their assignment May 8, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement Anything related to improvements of the existing library
Projects
None yet
Development

No branches or pull requests

2 participants