We present two methods for the construction of quantum circuits for quantum error- correcting codes (QECC). The underlying quantum systems are tensor products of subsystems (qudits) of equal dimension which is a prime power. For a QECC encoding k qudits into n qudits, the resulting quantum circuit has O(n(n - k)) gates. The running time of the classical algorithm to compute the quantum circuit is O(n(n - k) 2 ).
No takes yet. Share an insight, caveat, or question.
Grassl et al. (2003) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: