Quantum error correction and the use of quantum error correction codes are likely to be essential for the realization of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes that are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm that searches for an optimal stabilizer code for a given error model, number of physical qubits, and number of encoded qubits. We demonstrate an efficient representation of stabilizer codes as binary strings, which allows for random generation of valid stabilizer codes as well as mutation and crossing of codes. Our algorithm finds stabilizer codes whose distance closely matches the best-known-distance codes of Grassl (2007) for n <= 20 physical qubits. We perform a search for optimal distance Calderbank-Steane-Shor codes and compare their distance to the best known codes. Finally, we show that the algorithm can be used to optimize stabilizer codes for biased error models, demonstrating a significant improvement in the undetectable error rate for [[12,1]](2) codes versus the best-known-distance code with the same parameters. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
原文链接
分享
引用
