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

Clifford Operation to Clifford Circuit transformation #11

Open
Krastanov opened this issue Jun 9, 2021 · 3 comments
Open

Clifford Operation to Clifford Circuit transformation #11

Krastanov opened this issue Jun 9, 2021 · 3 comments
Labels
enhancement New feature or request

Comments

@Krastanov
Copy link
Member

There are many ways to synthesize a circuit (with nothing bigger than 2-qubit gates) out of given Clifford Operation. They are also equivalent to a canonicalization procedure.

Track and implement them.

Implement sparse versions for each of the "assembler" gates.

@Krastanov
Copy link
Member Author

Some implemented in https://github.com/rharper2/Juqst.jl

Decomposing as a graph state is equivalent to a circuit decomposition

This is another method https://arxiv.org/abs/2003.09412

@Krastanov Krastanov added the enhancement New feature or request label Jan 5, 2022
@QCmonk
Copy link

QCmonk commented Jul 27, 2023

I have written code that performs this decomposition for the default canonical form. Shall I make a PR for it or are alternative methods already in the works?

Best,
QCmonk

@Krastanov
Copy link
Member Author

Please go ahead and do the PR, that would be the easiest way for me to review.

No, I do not know of anyone working on alternatives.

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

No branches or pull requests

2 participants