@article{grassl2002efficient,
author = {Grassl, Markus and Roetteler, Martin and Beth, Thomas},
title = {Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes},
year = {2002},
month = {November},
abstract = {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).},
url = {http://approjects.co.za/?big=en-us/research/publication/efficient-quantum-circuits-non-qubit-quantum-error-correcting-codes/},
pages = {757-775},
journal = {International Journal of Foundations of Computer Science (IJFCS)},
volume = {14},
edition = {International Journal of Foundations of Computer Science (IJFCS)},
number = {5},
}