Quantum error-correcting codes over finite Frobenius rings

DOI10.1090/conm/747/15046zbMath1442.81019OpenAlexW3013178325MaRDI QIDQ3296044

Andrew Nemec, Sangjun Lee, Andreas Klappenecker

Publication date: 3 July 2020

Published in: Topological Phases of Matter and Quantum Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/conm/747/15046

Mathematics Subject Classification ID

Quantum computation (81P68) Quasi-Frobenius rings (16L60) Frobenius induction, Burnside and representation rings (19A22) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On admissible rings
• Cyclic and Negacyclic Codes Over Finite Chain Rings
• QUADRATIC RESIDUE CODES OVER ℤ₉
• Duality for modules over finite rings and applications to coding theory
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Fundamentals of Error-Correcting Codes
• Quantum Error Correction and Orthogonal Geometry
• On Isodual Cyclic Codes over Finite Chain Rings
• Characterization of finite Frobenius rings

This page was built for publication: Quantum error-correcting codes over finite Frobenius rings