Quantum error-correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a way for quantum error-correcting codes to achieve higher rates than the one obtained by means of the traditional stabilizer formalism. Such codes are called entanglement-assisted quantum error-correcting (EAQEC) codes. In this paper, we utilize algebraic geometry codes to construct several families of EAQEC codes derived from the Euclidean and the Hermitian construction. Three families constructed here consist of codes whose quantum Singleton defect is equal to zero, one, or two. We also construct families of EAQEC codes with an encoding rate exceeding the quantum Gilbert-Varshamov bound. Additionally, asymptotically good towers of linear complementary dual codes are used to obtain asymptotically good families of EAQEC codes consuming maximal entanglement. Furthermore, a simple comparison with the quantum Gilbert-Varshamov bound demonstrates that, by utilizing the proposed construction, it is possible to generate an asymptotically family of EAQEC codes that exceeds this bound.

Entanglement-assisted quantum-error-correcting (EAQEC) codes are quantum codes which use entanglement as a resource. These codes can provide better error correction than the (entanglement unassisted) codes derived from the traditional stabilizer formalism. In this paper, we provide a general method to construct EAQEC codes from cyclic codes. Afterwards, the method is applied to Reed–Solomon codes, BCH codes, and general cyclic codes. We use the Euclidean and Hermitian construction of EAQEC codes. Three families have been created: two families of EAQEC codes are maximal distance separable (MDS), and one is almost MDS or almost near MDS. The comparison of the codes in this paper is mostly based on the quantum Singleton bound.

We introduce , a simple yet powerful way of constructing quantum codes that are local on a planar 2D lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer weight. Our construction does not compromise on the fact that the codes are local on a lattice with open boundary conditions. Despite its simplicity, we use our construction to find codes with parameters [ [ 288 , 8 , 12 ] ] using weight-6 stabilizers and [ [ 288 , 8 , 14 ] ] using weight-8 stabilizers, outperforming all previously known constructions in this direction. Allowing for a slightly higher nonlocality, we find a [ [ 512 , 18 , 19 ] ] code using weight-8 stabilizers, which outperforms the rotated surface code by a factor of more than 12. Our approach provides a unified framework for understanding the structure of codes that are local on a 2D planar lattice and offers a systematic way to explore the space of possible code parameters. In particular, due to its simplicity, the construction naturally accommodates various types of boundary conditions and stabilizer configurations, making it a versatile tool for quantum error-correction code design.

In this paper, we construct new families of classical convolutional codes (CCC’s) as well as new families of quantum convolutional codes (QCC’s). The CCC’s are derived from (block) algebraic geometry (AG) codes. Furthermore, new families of CCC’s are constructed by applying the techniques of puncturing, extending, expanding and by the direct product code construction applied to AG codes. Additionally, utilizing the new CCC’s constructed here, we obtain new families of QCC’s. The parameters of these new codes are good. More precisely, in the classical case, a family of almost near maximum distance separable (MDS) codes are presented; in the quantum case, we construct a family of MDS (optimal) quantum convolutional codes.

Achieving industrial quantum advantage is unlikely without the use of quantum error correction (QEC). Other QEC codes beyond surface code are being experimentally studied, such as color codes and quantum low-density parity check codes, that could benefit from new quantum processing unit (QPU) architectures. We introduce the six-qubit star lattice architecture that offers parallelism and effective local all-to-all connectivity and thus enables hardware-efficient implementation of certain QEC codes. As a first demonstration of this new architecture, we encode two logical qubits in a six-qubit superconducting QPU with a star topology using the ⟦ 4 , 2 , 2 ⟧ code and characterize the logical states with the classical shadow framework. Logical lifetime and logical error rate are measured over repeated quantum error detection cycles for various logical states including a logical Bell state. We measure logical state fidelities above 96% for every cardinal logical state, find logical lifetimes above the best physical element, and logical error-per-cycle values ranging from 0.25(2)% to 0.91(3)%. In future, such star units can be tiled into a lattice to enable QEC codes with high-weight and overlapping stabilizers for improved encoding rates.