Generalized Toric Codes on Twisted Tori for Quantum Error Correction

The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we intro...

Full description

Saved in:
Bibliographic Details
Main Authors: Zijian Liang, Ke Liu, Hao Song, Yu-An Chen
Format: Article
Language:English
Published: American Physical Society 2025-06-01
Series:PRX Quantum
Online Access:http://doi.org/10.1103/rmy6-9n89
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1849683457827930112
author Zijian Liang
Ke Liu
Hao Song
Yu-An Chen
author_facet Zijian Liang
Ke Liu
Hao Song
Yu-An Chen
author_sort Zijian Liang
collection DOAJ
description The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters [[n,k,d]] for n≤400, yielding novel codes such as [[120,8,12]], [[186,10,14]], [[210,10,16]], [[248,10,18]], [[254,14,16]], [[294,10,20]], [[310,10,≤22]], and [[340,16,18]]. Moreover, we present a new realization of the [[360,12,≤24]] quantum code using the (3,3)-bivariate bicycle code on a twisted torus defined by the basis vectors (0,30) and (6,6), improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.
format Article
id doaj-art-5543da458c074ca0bf086dfbbae4728e
institution DOAJ
issn 2691-3399
language English
publishDate 2025-06-01
publisher American Physical Society
record_format Article
series PRX Quantum
spelling doaj-art-5543da458c074ca0bf086dfbbae4728e2025-08-20T03:23:52ZengAmerican Physical SocietyPRX Quantum2691-33992025-06-016202035710.1103/rmy6-9n89Generalized Toric Codes on Twisted Tori for Quantum Error CorrectionZijian LiangKe LiuHao SongYu-An ChenThe Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters [[n,k,d]] for n≤400, yielding novel codes such as [[120,8,12]], [[186,10,14]], [[210,10,16]], [[248,10,18]], [[254,14,16]], [[294,10,20]], [[310,10,≤22]], and [[340,16,18]]. Moreover, we present a new realization of the [[360,12,≤24]] quantum code using the (3,3)-bivariate bicycle code on a twisted torus defined by the basis vectors (0,30) and (6,6), improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.http://doi.org/10.1103/rmy6-9n89
spellingShingle Zijian Liang
Ke Liu
Hao Song
Yu-An Chen
Generalized Toric Codes on Twisted Tori for Quantum Error Correction
PRX Quantum
title Generalized Toric Codes on Twisted Tori for Quantum Error Correction
title_full Generalized Toric Codes on Twisted Tori for Quantum Error Correction
title_fullStr Generalized Toric Codes on Twisted Tori for Quantum Error Correction
title_full_unstemmed Generalized Toric Codes on Twisted Tori for Quantum Error Correction
title_short Generalized Toric Codes on Twisted Tori for Quantum Error Correction
title_sort generalized toric codes on twisted tori for quantum error correction
url http://doi.org/10.1103/rmy6-9n89
work_keys_str_mv AT zijianliang generalizedtoriccodesontwistedtoriforquantumerrorcorrection
AT keliu generalizedtoriccodesontwistedtoriforquantumerrorcorrection
AT haosong generalizedtoriccodesontwistedtoriforquantumerrorcorrection
AT yuanchen generalizedtoriccodesontwistedtoriforquantumerrorcorrection