Stefan Krastanov

This task was marked as closed some time ago. The pull request should stay here until we find how we will take care of presenting the translations.

We have a task about the presentation problem http://www.google-melange.com/gci/task/view/google/gci2011/7127301

@hdavid16 , yes, it is because I am trying to avoid locking too many resources. However, I should admit that I am not experienced in this type of simulations, so...

to clarify: single-qubit Pauli ops are trivial. This is aimed at more interesting logical Clifford operations.

probably just reimplementing the few codes that are built in https://www.cgranade.com/python-quaec/stab.html#qecc.StabilizerCode.flip_code and adding more

this repository also has some related materials https://github.com/errorcorrectionzoo/eczoo_data/issues/269

also: - https://qecsim.github.io/ - https://github.com/qiskit-community/qiskit-qec - https://panqec.readthedocs.io/en/latest/index.html

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

also useful https://arxiv.org/pdf/quant-ph/0504097.pdf

also https://journals.aps.org/pra/pdf/10.1103/PhysRevA.69.022316