Quantum error correction (QEC) is essential for operating quantum computers in the presence of noise. Here, we accurately decode arbitrary Calderbank-Shor-Steane (CSS) codes via the maximum satisfiability (MaxSAT) problem. We show how to map quantum maximum likelihood problem of CSS codes of arbitrary geometry and parity check weight into MaxSAT problems. We incorporate the syndrome measurements as hard clauses, while qubit and measurement error probabilities, including biased and non-uniform, are encoded as soft MaxSAT clauses. For the code capacity of color codes on a hexagonal lattice, our decoder has a higher threshold and superior scaling in noise suppression compared to belief propagation with ordered statistics post-processing (BP-OSD), while showing similar scaling in computational cost. Further, we decode surface codes and recently proposed bivariate quantum low-density parity check (QLDPC) codes where we find lower error rates than BP-OSD. Finally, we connect the complexity of MaxSAT decoding to a computational phase transition controlled by the clause density of the MaxSAT problem, where we show that our mapping is always in the computationally ''easy`` phase. Our MaxSAT decoder can be further parallelised or implemented on ASICs and FPGAs, promising potential further speedups of several orders of magnitude. Our work provides a flexible platform towards practical applications on quantum computers.
Auditing Syndrome-to-Decoder Mappings for Repetition, Surface, CSS, and Digitized-GKP Interfaces
Georgia Institute of Technology(佐治亚理工学院);TU Bergakademie Freiberg(弗莱贝格工业大学);Volkswagen AG(大众汽车集团);RWTH Aachen(亚琛工业大学);Federal University of Juiz de Fora(茹伊斯德福拉联邦大学)
Quantum Error Correction beyond the Bounded Distance Decoding Limit
在本文中,我们考虑在去极化信道上的量子纠错与非二进制低密度奇偶校验码定义在有限域的大小$2^p$。提出的量子纠错码是基于二进制准循环CSS(Calderbank,Shor and Steane)码。由此产生的量子码优于已知的最好的量子码,并超过了有界距离解码器的性能极限。通过增加底层伽罗瓦域的大小,即,$2^p$,错误平层得到显著改善。
Generalised Bit-Vector Abstractions for Formal Verification of Quantum Error-Detection and Entanglement Circuits over {H,X,C-NOT}: CSS Constructions, Soundness, and Mutation-Based Validation
Characterizing the Burst Error Correction Ability of Quantum Cyclic Codes
School of Cyber Science and Engineering, Nanjing University of Science and Technology(南京理工大学网络空间安全学院);Hon Hai Quantum Computing Research Center(鸿海量子计算研究中心)
Singer-Difference-Set Qudit Stabilizer Codes from Non-Degenerate Quadrics in PG(d,q)PG(d,q): Construction, Structural Theorems, and Monte-Carlo Performance
Rice University(莱斯大学);University of Southampton(南安普顿大学)
Manning College of Information and Computer Sciences, University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校曼宁信息与计算机科学学院);Research Laboratory of Electronics, Massachusetts Institute of Technology(麻省理工学院电子研究实验室);Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology(麻省理工学院电气与计算机工程系);Department of Physics, University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校物理系)
Fault tolerance of quantum circuits with tensor networks and symplectic geometry
Technical University of Munich(慕尼黑工业大学);BMFTR Research Hub 6G-Life, Germany(德国 BMFTR 研究枢纽 6G-Life);Munich Centre for Quantum Science and Technology (MCQST)(慕尼黑量子科学与技术中心);Munich Quantum Valley (MQV)(慕尼黑量子谷);Cluster of Excellence CeTI, Technical University of Dresden(德累斯顿工业大学卓越集群 CeTI);Centre for Quantum Technologies, National University of Singapore(新加坡国立大学量子技术中心);Nanyang Quantum Hub, Nanyang Technological University(南洋理工大学南洋量子枢纽)