Cups and Gates I: Cohomology invariants and logical quantum operations

TL;DR

This paper introduces a cohomology-based framework for constructing logical quantum gates in CSS codes, enabling constant-depth implementations and gates in higher Clifford hierarchy levels.

Contribution

It develops a novel approach using cup products and cohomology invariants to realize logical gates in CSS codes, including high-level Clifford hierarchy gates.

Findings

Cohomology invariants induce diagonal logical gates in CSS codes.

The framework supports constant-depth circuit implementations.

Constructs a Λ-fold cup product for Λ-level Clifford hierarchy gates.

Abstract

We take initial steps towards a general framework for constructing logical gates in general quantum CSS codes. Viewing CSS codes as cochain complexes, we observe that cohomology invariants naturally give rise to diagonal logical gates. We show that such invariants exist if the quantum code has a structure that relaxes certain properties of a differential graded algebra. We show how to equip quantum codes with such a structure by defining cup products on CSS codes. The logical gates obtained from this approach can be implemented by a constant-depth unitary circuit. In particular, we construct a $\Lambda$-fold cup product that can produce a logical operator in the $\Lambda$-th level of the Clifford hierarchy on $\Lambda$ copies of the same quantum code, which we call the copy-cup gate. For any desired $\Lambda$, we can construct several families of quantum codes that support gates in the $\Lambda$-th level with various asymptotic code parameters.