We determine conditions on classical group algebra codes so that they have pre-orientation for cup products and copy-cup gates. This defines quantum codes that have constant-depth
CZ and
CCZ gates constructed via tensor products of classical group algebra codes, including hypergraph and balanced products. We show that determining the conditions relies on solving the perfect matching problem in graph theory. Conditions are fully determined for the 2- and 3-copy-cup gates, for group algebra codes up to weight 4, including for codes with odd check weight. These include the bivariate bicycle codes, which we show do not have the pre-orientation for either type of copy-cup gate. We show that abelian weight 4 group algebra codes satisfying the non-associative 3-copy-cup gate necessarily have a code distance of 2, whereas codes that satisfy conditions for the symmetric 3-copy-cup gate can have higher distances, and in fact also satisfy conditions for the 2-copy-cup gate. Finally we find examples of quantum codes from the product of abelian group algebra codes that have inter-code constant-depth
CZ and
CCZ 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
Λ Λ -fold cup product that can produce a logical operator in the
Λ Λ -th level of the Clifford hierarchy on
Λ Λ copies of the same quantum code, which we call the copy-cup gate . For any desired
Λ Λ , we can construct several families of quantum codes that support gates in the
Λ Λ -th level with various asymptotic code parameters.
Incompatibility is a feature of quantum theory that sets it apart from classical theory, and the inability to clone an unknown quantum state is one of the most fundamental instances. The no-hiding theorem is another such instance that arises in the context of the black-hole information paradox, and can be viewed as being dual to no-cloning. Here, we formulate both of these fundamental features of quantum theory in a single form that is amenable to efficient verification, and that is robust to errors arising in state preparation and measurements. We extend the notion of unitarity—an average figure of merit that for quantum theory captures the coherence of a quantum channel—to general physical theories. Then, we introduce the notion of compatible unitarity pair (CUP) sets, that correspond to the allowed values of unitarities for compatible channels in the theory. We show that a CUP set constitutes a simple “fingerprint” of a physical theory, and that incompatibility can be studied through them. We derive information-disturbance constraints on quantum CUP sets that encode both the no-cloning/broadcasting and no-hiding theorems of quantum theory. We then develop randomized benchmarking protocols that efficiently estimate quantum CUP sets and provide simulations using IBMQ of the simplest instance. Finally, we discuss ways in which CUP sets and quantum no-go theorems could provide additional information to benchmark quantum devices. Published by the American Physical Society 2024