Related papers: Low-Overhead Entangling Gates from Generalised Dehn Twists

Low-Overhead Entangling Gates from Generalised Dehn Twists

URL: http://arxiv.org/abs/2411.03302v1
Date: Tue, 05 Nov 2024 17:55:46 GMT
Title: Low-Overhead Entangling Gates from Generalised Dehn Twists
Authors: Ryan Tiew, Nikolas P. Breuckmann,
Abstract summary: We generalise the implementation of logical quantum gates via Dehn twists from topological codes to the hypergraph and balanced products of cyclic codes. These generalised Dehn twists implement logical entangling gates with no additional qubit overhead and $mathcalO(d)$ time overhead.
Score: 7.059472280274009
License:
Abstract: We generalise the implementation of logical quantum gates via Dehn twists from topological codes to the hypergraph and balanced products of cyclic codes. These generalised Dehn twists implement logical entangling gates with no additional qubit overhead and $\mathcal{O}(d)$ time overhead. Due to having more logical degrees of freedom in the codes, there is a richer structure of attainable logical gates compared to those for topological codes. To illustrate the scheme, we focus on families of hypergraph and balanced product codes that scale as $[[18q^2,8,2q]]_{q\in \mathbb{N}}$ and $[[18q,8,\leq 2q]]_{q\in \mathbb{N}}$ respectively. For distance 6 to 12 hypergraph product codes, we find that the set of twists and fold-transversal gates generate the full logical Clifford group. For the balanced product code, we show that Dehn twists apply to codes in this family with odd $q$. We also show that the $[[90,8,10]]$ bivariate bicycle code is a member of the balanced product code family that saturates the distance bound. We also find balanced product codes that saturate the bound up to $q\leq8$ through a numerical search.

Related papers

Quantum LDPC Codes with Transversal Non-Clifford Gates via Products of Algebraic Codes [0.9208007322096533]
We construct an explicit infinite family of quantum LDPC codes supporting a $Cr-1Z$ gate with length $N$, dimension $Kgeq N1-epsilon$, distance $Dgeq N1/r/namepoly(log N)$, and stabilizer weight $wleqoperatorname(log N)$.
arXiv Detail & Related papers (2024-10-18T17:52:59Z)
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)
Quantum Rainbow Codes [0.0]
We introduce rainbow codes, a novel class of quantum error correcting codes generalising colour codes and pin codes. Rainbow codes can be defined on any $Ddimensional simplicial complex that admits a valid $(D+1)$colouring of its $0simplices.
arXiv Detail & Related papers (2024-08-23T14:56:55Z)
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)
Genons, Double Covers and Fault-tolerant Clifford Gates [2.5866180357107242]
We show a construction that produces symplectic double code with naturally occurring fault-tolerant logical Clifford gates. We demonstrate this experimentally on Quantinuum's H1-1 trapped-ion quantum computer.
arXiv Detail & Related papers (2024-06-14T11:57:51Z)
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)
Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
arXiv Detail & Related papers (2022-04-22T12:37:56Z)
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)

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