Related papers: Encoding Majorana codes

Encoding Majorana codes

URL: http://arxiv.org/abs/2402.07829v2
Date: Wed, 14 Feb 2024 18:37:32 GMT
Title: Encoding Majorana codes
Authors: Maryam Mudassar, Riley W. Chien and Daniel Gottesman
Abstract summary: Majorana codes are special since any gates that transform such codes must preserve fermionic parity. We present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes.
Score: 0.0
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: To implement a quantum error correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that transform such codes must preserve fermionic parity. In this paper, we present an algorithm that uses the stabilizer matrix to compute unitary encoding circuits for Majorana codes. We present two approaches, both of which use a version of Gaussian elimination with row operations replaced with elementary fermionic Clifford operations. One approach uses an additional ancilla mode and works for all Majorana stabilizer codes, while the second approach does not use ancilla but does not work if the total parity is inside the stabilizer group.

Related papers

Decoding Quasi-Cyclic Quantum LDPC Codes [23.22566380210149]
Quantum low-density parity-check (qLDPC) codes are an important component in the quest for fault tolerance. Recent progress on qLDPC codes has led to constructions which are quantumally good, and which admit linear-time decoders to correct errors affecting a constant fraction of codeword qubits. In practice, the surface/toric codes, which are the product of two repetition codes, are still often the qLDPC codes of choice.
arXiv Detail & Related papers (2024-11-07T06:25:27Z)
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)
Learning Linear Block Error Correction Codes [62.25533750469467]
We propose for the first time a unified encoder-decoder training of binary linear block codes. We also propose a novel Transformer model in which the self-attention masking is performed in a differentiable fashion for the efficient backpropagation of the code gradient.
arXiv Detail & Related papers (2024-05-07T06:47:12Z)
Extracting topological orders of generalized Pauli stabilizer codes in two dimensions [5.593891873998947]
We introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems. The algorithm applies to $mathbbZ_d$ qudits, including instances where $d$ is a nonprime number.
arXiv Detail & Related papers (2023-12-18T13:18:19Z)
Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
arXiv Detail & Related papers (2023-07-20T10:51:23Z)
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)
Implementing Logical Operators using Code Rewiring [0.0]
We describe a method to use measurements and correction operations in order to implement the Clifford group in a stabilizer code. In particular this provides a method to implement a logical Hadamard-type gate within the 15-qubit Reed-Muller quantum code.
arXiv Detail & Related papers (2022-10-25T14:56:31Z)
Error-correcting codes for fermionic quantum simulation [4.199246521960609]
We present methodologies for fermions via qubit systems on a two-dimensional lattice algorithm. We identify a family of stabilizer codes suitable for fermion simulation. Our method can increase the code distances without decreasing the (fermionic) code rate.
arXiv Detail & Related papers (2022-10-16T01:43:07Z)
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)
Trellis Decoding For Qudit Stabilizer Codes And Its Application To Qubit Topological Codes [3.9962751777898955]
We show that trellis decoders have strong structure, extend the results using classical coding theory as a guide, and demonstrate a canonical form from which the structural properties of the decoding graph may be computed. The modified decoder works for any stabilizer code $S$ and separates into two parts: a one-time, offline which builds a compact, graphical representation of the normalizer of the code, $Sperp$, and a quick, parallel, online computation using the Viterbi algorithm.
arXiv Detail & Related papers (2021-06-15T16:01:42Z)
Pruning Neural Belief Propagation Decoders [77.237958592189]
We introduce a method to tailor an overcomplete parity-check matrix to (neural) BP decoding using machine learning. We achieve performance within 0.27 dB and 1.5 dB of the ML performance while reducing the complexity of the decoder.
arXiv Detail & Related papers (2020-01-21T12:05:46Z)

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