[Paper Review] 3D local qupit quantum code without string logical operator

Isaac H. Kim|arXiv (Cornell University)|Jan 1, 2011

Quantum Computing Algorithms and Architecture10 citations

TL;DR

This paper introduces a new family of 3D local qudit quantum codes with prime-dimensional qudits that lack string logical operators, leveraging stabilizer codes over finite fields. By classifying codes as symmetric or antisymmetric under inversion, the authors establish a duality between classes and prove a logarithmic energy barrier for logical errors, with the minimal viable qudit dimension being 5.

ABSTRACT

Recently Haah introduced a new quantum error correcting code embedded on a cubic lattice. One of the defining properties of this code is the absence of string logical operator. We present new codes with similar properties by relaxing the condition on the local particle dimension. The resulting code is well-defined when the local Hilbert space dimension is prime. These codes can be divided into two different classes: the local stabilizer generators are either symmetric or antisymmetric with respect to the inversion operation. These is a nontrivial correspondence between these two classes. For any symmetric code without string logical operator, there exists a complementary antisymmetric code with the same property and vice versa. We derive a sufficient condition for the absence of string logical operator in terms of the algebraic constraints on the defining parameters of the code. Minimal number of local particle dimension which satisfies the condition is 5. These codes have logarithmic energy barrier for any logical error.

Motivation & Objective

• To construct 3D local quantum error-correcting codes with no string logical operators using prime-dimensional qudits instead of composite dimensions.
• To explore whether such codes can achieve self-correcting behavior via a logarithmic energy barrier, as seen in Haah's code.
• To classify stabilizer codes based on their transformation under spatial inversion (symmetric vs. antisymmetric), and establish a duality between the two classes.
• To determine the minimal qudit dimension required to avoid string logical operators, extending beyond the known case of d=4 in Haah's code.
• To investigate the bulk topological properties and logical operator structure in relation to system size and boundary conditions.

Proposed method

• Construct stabilizer codes on a cubic lattice where each cube hosts one stabilizer generator, with local qudit dimension p (prime).
• Classify codes by their behavior under spatial inversion: symmetric (invariant) or antisymmetric (sign-flipped), using algebraic constraints on generator coefficients.
• Establish a one-to-one correspondence between symmetric and antisymmetric codes via local unitary transformations, preserving key topological properties.
• Derive algebraic conditions on the code parameters (coefficients in the stabilizer generators) that guarantee the absence of string logical operators.
• Analyze logical operators on planar surfaces and show that periodic boundary conditions restrict the existence of certain logical operators based on system size parity.
• Use the no-string rule and aspect ratio argument to prove a logarithmic energy barrier for logical error processes, generalizing Bravyi-Haah results to prime-dimensional qudits.

Experimental results

Research questions

• RQ1 Can 3D local quantum codes without string logical operators be constructed using prime-dimensional qudits, rather than composite dimensions like d=4?
• RQ2 What is the minimal qudit dimension p for which such codes can exist without string logical operators?
• RQ3 How are symmetric and antisymmetric codes under spatial inversion related, and does this duality preserve the absence of string logical operators?
• RQ4 Can the logarithmic energy barrier for logical errors be generalized to non-CSS codes over prime-dimensional qudits?
• RQ5 How does the system size and boundary condition affect the existence of logical operators in these codes?

Key findings

• The minimal local qudit dimension required to construct a 3D local stabilizer code without string logical operators is 5, with p=2 and p=3 inevitably leading to such operators.
• A one-to-one correspondence exists between symmetric and antisymmetric codes: for every symmetric code without string logical operators, there is a complementary antisymmetric code with the same property, and vice versa.
• The absence of string logical operators is determined by algebraic constraints on the coefficients of the stabilizer generators, which must satisfy specific polynomial conditions over the finite field GF(p).
• Antisymmetric codes always encode at least one logical qudit due to a global relation among stabilizer generators, while symmetric codes require explicit analysis of planar logical operators to confirm encoding.
• The energy barrier for logical errors scales logarithmically with system size, inherited from the no-string rule and bounded aspect ratio, ensuring potential self-correction in 3D.
• Logical operators on planar surfaces are constrained by system size: periodic structures exist only when both width and height are even, or when multiple operators are multiplied to form periodic patterns.