Related papers: Cups and Gates I: Cohomology invariants and logical quantum operations

Cups and Gates I: Cohomology invariants and logical quantum operations

URL: http://arxiv.org/abs/2410.16250v1
Date: Mon, 21 Oct 2024 17:53:17 GMT
Title: Cups and Gates I: Cohomology invariants and logical quantum operations
Authors: Nikolas P. Breuckmann, Margarita Davydova, Jens N. Eberhardt, Nathanan Tantivasadakarn,
Abstract summary: We show how to equip quantum codes with a structure that relaxes certain properties of a differential graded algebra. The logical gates obtained from this approach can be implemented by a constant-depth unitary circuit.
Score: 5.749787074942512
License:
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.

Related papers

Targeted Clifford logical gates for hypergraph product codes [61.269295538188636]
We construct explicit targeted logical gates for hypergraph product codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
arXiv Detail & Related papers (2024-11-26T02:32:44Z)
Classifying Logical Gates in Quantum Codes via Cohomology Operations and Symmetry [0.0]
We construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes. We present a formalism for addressable and parallelizable logical gates in LDPC codes via higher-form symmetries. As a byproduct, we find new topological responses of finite higher-form symmetries using higher Pontryagin powers.
arXiv Detail & Related papers (2024-11-24T14:01:37Z)
Geometric structure and transversal logic of quantum Reed-Muller codes [51.11215560140181]
In this paper, we aim to characterize the gates of quantum Reed-Muller (RM) codes by exploiting the well-studied properties of their classical counterparts. A set of stabilizer generators for a RM code can be described via $X$ and $Z$ operators acting on subcubes of particular dimensions.
arXiv Detail & Related papers (2024-10-10T04:07:24Z)
SDP bounds on quantum codes [6.417777780911225]
This paper provides a semidefinite programming hierarchy based on state optimization to determine the existence of quantum codes. The hierarchy is complete, in the sense that if a $(!(n,K,delta)!)$ code does not exist then a level of the hierarchy is infeasible. While it is formally-free, we restrict it to qubit codes through quasi-Clifford algebras.
arXiv Detail & Related papers (2024-08-19T18:00:07Z)
Asymptotically Good Quantum Codes with Transversal Non-Clifford Gates [23.22566380210149]
We construct quantum codes that support $CCZ$ gates over qudits of arbitrary prime power dimension $q$. The only previously known construction with such linear dimension and distance required a growing alphabet size $q$.
arXiv Detail & Related papers (2024-08-17T16:54:51Z)
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes [1.8416014644193066]
Quantum low-density parity-check (qLDPC) codes offer a promising route to scalable fault-tolerant quantum computation with constant overhead. Recent advancements have shown that qLDPC codes can outperform the quantum memory capability of surface codes even with near-term hardware.
arXiv Detail & Related papers (2024-07-04T14:49:35Z)
Equivalence Classes of Quantum Error-Correcting Codes [49.436750507696225]
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. We represent QECC's in a form called a ZX diagram, consisting of a tensor network.
arXiv Detail & Related papers (2024-06-17T20:48:43Z)
Homological Quantum Rotor Codes: Logical Qubits from Torsion [51.9157257936691]
homological quantum rotor codes allow one to encode both logical rotors and logical qudits in the same block of code. We show that the $0$-$pi$-qubit as well as Kitaev's current-mirror qubit are indeed small examples of such codes.
arXiv Detail & Related papers (2023-03-24T00:29:15Z)
Morphing quantum codes [77.34726150561087]
We morph the 15-qubit Reed-Muller code to obtain the smallest known stabilizer code with a fault-tolerant logical $T$ gate. We construct a family of hybrid color-toric codes by morphing the color code.
arXiv Detail & Related papers (2021-12-02T17:43:00Z)
Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z)
Classical Coding Problem from Transversal $T$ Gates [10.478611957969145]
We show that triorthogonal codes are, essentially, the only family of CSS codes that realize logical $T$ via physical $T$. We also use Ax's theorem to characterize the logical operation realized on a family of quantum Reed-Muller codes.
arXiv Detail & Related papers (2020-01-14T16:45:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.