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

Compilation increases length of chains of conditional single-qubit gates #557

Open
cqc-alec opened this issue Dec 17, 2024 · 1 comment
Open
Assignees

Comments

@cqc-alec
Copy link
Collaborator

If we start with the circuit

c = Circuit(2, 1).CZ(0, 1, condition=Bit(0))

and compile it at optimization level 1 or 2, we obtain a circuit containing 7 Rz, 8 PhasedX and 1 ZZPhase gate (all conditional).

If we repeat the compilation, we get 12 Rz, 16 PhasedX and 1 ZZPhase.

If we repeat the compilation again, we get 17 Rz, 24 PhasedX and 1 ZZPhase ...

Optimization levels 0 and 3 both produce the expected counts (2 Rz, 2 PhasedX and 1 ZZPhase).

@cqc-alec cqc-alec self-assigned this Dec 17, 2024
@cqc-alec
Copy link
Collaborator Author

Apparently caused by CQCL/tket#1723 .

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