Simple quantum error-correcting codes
Abstract
Methods of finding good quantum error-correcting codes are discussed, and many example codes are presented. The recipe ${\mathit{C}}_{2}^{\mathrm{\ensuremath{\perp}}}$\ensuremath{\subset}${\mathit{C}}_{1}$, where ${\mathit{C}}_{1}$ and ${\mathit{C}}_{2}$ are classical codes, is used to obtain codes for up to 16 information quantum bits (qubits) with correction of small numbers of errors. The results are tabulated. More efficient codes are obtained by allowing ${\mathit{C}}_{1}$ to have reduced distance, and introducing sign changes among the code words in a systematic manner. This systematic approach leads to single-error-correcting codes for 3, 4, and 5 information qubits with block lengths of 8, 10, and 11 qubits, respectively. \textcopyright{} 1996 The American Physical Society.
Read the paper
Related studies
- Quantum dots: synthesis, bioapplications, and toxicity
- A Guide to In Silico Drug Design
- Quantum Computing for Healthcare: A Review
- Automated in Silico Design of Homogeneous Catalysts
- Identification of Novel 3-Hydroxy-pyran-4-One Derivatives as Potent HIV-1 Integrase Inhibitors Using in silico Structure-Based Combinatorial Library Design Approach
- In silico structural elucidation of RNA-dependent RNA polymerase towards the identification of potential Crimean-Congo Hemorrhagic Fever Virus inhibitors
Go deeper in Evidence Hub
Evidence Hub adds a study data sheet (design, sample size, evidence level, key numbers), an AI summary and a chat grounded in the paper's text.