Efficiently Implement clifford groups for single and two qubit clifford groups #6389
Labels
area/clifford-group
good part time project
A meaty non-urgent issue with a substantial amount of work to be done.
kind/feature-request
Describes new functionality
priority/p1
Fix is needed as soon as possible. Should be staffed. It is blocking some major flows for users
triage/accepted
A consensus emerged that this bug report, feature request, or other action should be worked on
Is your feature request related to a use case or problem? Please describe.
https://github.com/quantumlib/Cirq/blob/main/cirq-core/cirq/experiments/qubit_characterizations.py practically implements single and two qubit clifford groups in order to do sampling. However the implementation is inefficient taking ~3s to sample 1000 cliffords. that's because the clifford groups are implemented directly as matricies and operations are done as matrix multiplication, inversion or mapping to/from index.
Describe the solution you'd like
update SingleQubitCliffordGate
Cirq/cirq-core/cirq/ops/clifford_gate.py
Line 461 in 7c9b713
What is the urgency from your perspective for this issue? Is it blocking important work?
P1 - I need this no later than the next release (end of quarter)
The text was updated successfully, but these errors were encountered: