Targeted Clifford logical gates for hypergraph product codes
- URL: http://arxiv.org/abs/2411.17050v1
- Date: Tue, 26 Nov 2024 02:32:44 GMT
- Title: Targeted Clifford logical gates for hypergraph product codes
- Authors: Adway Patra, Alexander Barg,
- Abstract summary: 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.
- Score: 61.269295538188636
- License:
- Abstract: We construct explicit targeted logical gates for hypergraph product codes. Starting with symplectic matrices for CNOT, CZ, Phase, and Hadamard operators, which together generate the Clifford group, we design explicit transformations that result in targeted logical gates for arbitrary HGP codes. As a concrete example, we give logical circuits for the $[[18,2,3]]$ toric code.
Related papers
- 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) - Low-Overhead Entangling Gates from Generalised Dehn Twists [7.059472280274009]
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.
arXiv Detail & Related papers (2024-11-05T17:55:46Z) - 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) - 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) - 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) - Partitioning qubits in hypergraph product codes to implement logical
gates [0.0]
Transversal gates are the simplest type of fault-tolerant logical gates.
We show that gates can be used as the basis for universal quantum computing on LDPC codes.
arXiv Detail & Related papers (2022-04-22T16:45:19Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - 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) - Limitations on transversal gates for hypergraph product codes [1.218340575383456]
We analyze the structure of the logical operators from a class of quantum codes that generalizes the surface codes.
By generalizing an argument of Bravyi and K"onig, we find that gates for these codes must be restricted to the Clifford group.
arXiv Detail & Related papers (2020-12-10T17:34:42Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.