Quantum error-correcting codes over finite Frobenius rings
From MaRDI portal
Publication:3296044
DOI10.1090/conm/747/15046zbMath1442.81019MaRDI 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
81P68: Quantum computation
16L60: Quasi-Frobenius rings
19A22: Frobenius induction, Burnside and representation rings
81P73: Computational stability and error-correcting codes for quantum computation and communication processing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On admissible rings
- Cyclic and Negacyclic Codes Over Finite Chain Rings
- QUADRATIC RESIDUE CODES OVER ℤ9
- 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