An official website of the United States government
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.
more »
« less
Y-cube model and fractal structure of subdimensional particles on hyperbolic lattices
Unlike ordinary topological quantum phases, fracton orders are intimately dependent on the underlying lattice geometry. In this work, we study a generalization of the X-cube model, dubbed the Y-cube model, on lattices embedded in H2×S1 space, i.e., a stack of hyperbolic planes. The name `Y-cube' comes from the Y-shape of the analog of the X-cube's X-shaped vertex operator. We demonstrate that for certain hyperbolic lattice tesselations, the Y-cube model hosts a new kind of subdimensional particle, treeons, which can only move on a fractal-shaped subset of the lattice. Such an excitation only appears on hyperbolic geometries; on flat spaces treeons becomes either a lineon or a planeon. Intriguingly, we find that for certain hyperbolic tesselations, a fracton can be created by a membrane operator (as in the X-cube model) or by a fractal-shaped operator within the hyperbolic plane.
more »
« less
- Award ID(s):
- 1917511
- PAR ID:
- 10417046
- Date Published:
- Journal Name:
- arXivorg
- ISSN:
- 2331-8422
- Page Range / eLocation ID:
- 2211.15829
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The X-cube model, a prototypical gapped fracton model, was shown in Ref. [1] to have a foliation structure. That is, inside the 3+1 D model, there are hidden layers of 2+1 D gapped topological states. A screw dislocation in a 3+1 D lattice can often reveal nontrivial features associated with a layered structure. In this paper, we study the X-cube model on lattices with screw dislocations. In particular, we find that a screw dislocation results in a finite change in the logarithm of the ground state degeneracy of the model. Part of the change can be traced back to the effect of screw dislocations in a simple stack of 2+1 D topological states, hence corroborating the foliation structure in the model. The other part of the change comes from the induced motion of fractons or sub-dimensional excitations along the dislocation, a feature absent in the stack of 2+1D layers.more » « less
-
We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in time steps, where refers to the system size and represents the maximum distance to constrain the application of the CNOT gates. Our algorithm reformulates the problem into a purely geometric one, facilitating its extension to attain the ground state of certain 3D topological phases, such as the 3D toric model in steps and the X-cube fracton model in steps. Furthermore, we introduce a gluing method involving measurements, enabling our technique to attain the ground state of the 2D toric code on an arbitrary planar lattice and paving the way to more intricate 3D topological phases.more » « less
-
Fracton models exhibit a variety of exotic properties and lie beyondthe conventional framework of gapped topological order. In , wegeneralized the notion of gapped phase to one of foliatedfracton phase by allowing the addition of layers of gappedtwo-dimensional resources in the adiabatic evolution between gappedthree-dimensional models. Moreover, we showed that the X-cube model is afixed point of one such phase. In this paper, according to thisdefinition, we look for universal properties of such phases which remaininvariant throughout the entire phase. We propose multi-partiteentanglement quantities, generalizing the proposal of topologicalentanglement entropy designed for conventional topological phases. Wepresent arguments for the universality of these quantities and show thatthey attain non-zero constant value in non-trivial foliated fractonphases.more » « less
-
Abstract We generalize the shuffle theorem and its $(km,kn)$ version, as conjectured by Haglund et al. and Bergeron et al. and proven by Carlsson and Mellit, and Mellit, respectively. In our version the $(km,kn)$ Dyck paths on the combinatorial side are replaced by lattice paths lying under a line segment whose x and y intercepts need not be integers, and the algebraic side is given either by a Schiffmann algebra operator formula or an equivalent explicit raising operator formula. We derive our combinatorial identity as the polynomial truncation of an identity of infinite series of $$\operatorname {\mathrm {GL}}_{l}$$ characters, expressed in terms of infinite series versions of LLT polynomials. The series identity in question follows from a Cauchy identity for nonsymmetric Hall–Littlewood polynomials.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- The DOI is not currently available.
