Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes

Preprint

4 November 2002

preprint
Published by arXiv in arXiv

https://doi.org/10.48550/arXiv.quant-ph/0211014

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).

Keywords

QUANTUM ERROR CORRECTING
ERROR CORRECTING CODES
EFFICIENT QUANTUM
QUANTUM CIRCUIT
QUBIT QUANTUM
ALGORITHM

All Related Versions

Version 1, 2002-11-04, ArXiv
Published version: International Journal of Foundations of Computer Science, 14 (5), 757.

This publication has 0 references indexed in Scilit: