Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published September 2023 | Published
Journal Article Open

Tailoring Three-Dimensional Topological Codes for Biased Noise

Abstract

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high-storage-threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for several advantages including a transversal implementation of non-Clifford logical gates, single-shot decoding strategies, and parallelized decoding in the case of fracton codes, as well as construction of fractal-lattice codes. Motivated by this, we tailor 3D topological codes for enhanced storage performance under biased Pauli noise. We present Clifford deformations of various 3D topological codes, such that they exhibit a threshold error rate of 50% under infinitely biased Pauli noise. Our examples include the 3D surface code on the cubic lattice, the 3D surface code on a checkerboard lattice that lends itself to a subsystem code with a single-shot decoder, and the 3D color code, as well as fracton models such as the X-cube model, the Sierpiński model, and the Haah code. We use the belief propagation with ordered statistics decoder (BP OSD) to study threshold error rates at finite bias. We also present a rotated layout for the 3D surface code, which uses roughly half the number of physical qubits for the same code distance under appropriate boundary conditions. Imposing coprime periodic dimensions on this rotated layout leads to logical operators of weight O(n) at infinite bias and a corresponding exp[−O(n)] subthreshold scaling of the logical failure rate, where n is the number of physical qubits in the code. Even though this scaling is unstable due to the existence of logical representations with O(1) low-rate and O(n2/3) high-rate Pauli errors, the number of such representations scales only polynomially for the Clifford-deformed code, leading to an enhanced effective distance.

Copyright and License

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Acknowledgement

We thank Benjamin Brown for showing how to prove a nontrivial part of Theorem 1, i.e., the decoding of the plaquette syndromes. We thank Steve Flammia for comments, especially for asking whether our rotated layout has the robustness discussed in Sec. V C. We thank Dan Browne, Michael Gullans, Oscar Higgott, Armanda Quintavalle, Joschka Roffe, and George Umbrarescu for comments on the manuscript. A.P. is supported by the Engineering and Physical Sciences Research Council (EPSRC) (EP/S021582/1). E.H. was supported by the Perimeter Scholars International scholarship and the Fulbright Future Scholarship. E.H. acknowledges support from the National Science Foundation (NSF) through Quantum Leap Challenge Institutes (QLCI) Grant No. OMA-2120757. Research at Perimeter Institute is supported in part by the Government of Canada through the Department of Innovation, Science and Economic Development Canada and by the Province of Ontario through the Ministry of Colleges and Universities. CTC acknowledges support from the Swiss National Science Foundation through the Sinergia grant (CRSII5-186364), the National Centres for Competence in Research in Quantum Science and Technology (QSIT) and The Mathematics of Physics (SwissMAP), and the ETH Zurich Quantum Center. A.D. is supported by the Simons Foundation through the collaboration on Ultra-Quantum Matter (651438, AD) and by the Institute for Quantum Information and Matter, an NSF Physics Frontiers Center (PHY-1733907).

Files

PRXQuantum.4.030338.pdf
Files (7.1 MB)
Name Size Download all
md5:3f28515423b2b475be7b5ba838a8536f
7.1 MB Preview Download

Additional details

Created:
October 16, 2023
Modified:
October 16, 2023