The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes
arXiv:1903.10013 · doi:10.1109/isit.2019.8849380
Abstract
Quantum error-correcting codes are used to protect quantum information from decoherence. A raw state is mapped, by an encoding circuit, to a codeword so that the most likely quantum errors from a noisy quantum channel can be removed after a decoding process. A good encoding circuit should have some desired features, such as low depth, few gates, and so on. In this paper, we show how to practically implement an encoding circuit of gate complexity for an quantum stabilizer code with the help of pairs of maximally-entangled states. For the special case of an stabilizer code with , the encoding complexity is , which is previously known to be . For this suggests that the benefits from shared entanglement come at an additional cost of encoding complexity. Finally we discuss decoding of entanglement-assisted quantum stabilizer codes and extend previously known computational hardness results on decoding quantum stabilizer codes.
arXiv commentaccepted by the 2019 IEEE International Symposium on Information Theory (ISIT2019)
References in corpus (13)
- Good Quantum Error-Correcting Codes Exist
- Improved Simulation of Stabilizer Circuits
- Stabilizer Codes and Quantum Error Correction
- Correcting Quantum Errors with Entanglement
- Efficient Computations of Encodings for Quantum Error Correction
- Catalytic quantum error correction
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Entanglement Increases the Error-Correcting Ability of Quantum Error-Correcting Codes
- Entanglement-Assisted Quantum Quasi-Cyclic Low-Density Parity-Check Codes
- NP-hardness of decoding quantum error-correction codes
- Entanglement-Assisted Quantum Convolutional Coding
- On the Hardnesses of Several Quantum Decoding Problems
- Encoding Subsystem Codes