Homological Quantum Rotor Codes: Logical Qubits from Torsion
- URL: http://arxiv.org/abs/2303.13723v3
- Date: Thu, 28 Sep 2023 12:54:16 GMT
- Title: Homological Quantum Rotor Codes: Logical Qubits from Torsion
- Authors: Christophe Vuillot and Alessandro Ciani and Barbara M. Terhal
- Abstract summary: 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.
- Score: 51.9157257936691
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We formally define homological quantum rotor codes which use multiple quantum
rotors to encode logical information. These codes generalize homological or CSS
quantum codes for qubits or qudits, as well as linear oscillator codes which
encode logical oscillators. Unlike for qubits or oscillators, homological
quantum rotor codes allow one to encode both logical rotors and logical qudits
in the same block of code, depending on the homology of the underlying chain
complex. In particular, a code based on the chain complex obtained from
tessellating the real projective plane or a M\"{o}bius strip encodes a qubit.
We discuss the distance scaling for such codes which can be more subtle than in
the qubit case due to the concept of logical operator spreading by continuous
stabilizer phase-shifts. We give constructions of homological quantum rotor
codes based on 2D and 3D manifolds as well as products of chain complexes.
Superconducting devices being composed of islands with integer Cooper pair
charges could form a natural hardware platform for realizing these codes: we
show that the $0$-$\pi$-qubit as well as Kitaev's current-mirror qubit -- also
known as the M\"{o}bius strip qubit -- are indeed small examples of such codes
and discuss possible extensions.
Related papers
- SSIP: automated surgery with quantum LDPC codes [55.2480439325792]
We present Safe Surgery by Identifying Pushouts (SSIP), an open-source lightweight Python package for automating surgery between qubit CSS codes.
Under the hood, it performs linear algebra over $mathbbF$ governed by universal constructions in the category of chain complexes.
We show that various logical measurements can be performed cheaply by surgery without sacrificing the high code distance.
arXiv Detail & Related papers (2024-07-12T16:50:01Z) - 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) - Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - Quantum spherical codes [55.33545082776197]
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes.
We apply this framework to bosonic coding, obtaining multimode extensions of the cat codes that can outperform previous constructions.
arXiv Detail & Related papers (2023-02-22T19:00:11Z) - Decoding quantum Tanner codes [0.38073142980732994]
We introduce sequential and parallel decoders for quantum Tanner codes.
Our decoders provably correct arbitrary errors of weight linear in the code length.
The same decoders are easily adapted to the expander lifted product codes of Panteleev and Kalachev.
arXiv Detail & Related papers (2022-08-10T19:50:18Z) - Grand Unification of continuous-variable codes [0.0]
Quantum error correction codes in continuous variables (also called CV codes, or single-mode bosonic codes) have been identified to be a technologically viable option for building fault-tolerant quantum computers.
Best-known examples are the GKP code and the cat-code, both of which were shown to have some advantageous properties over any discrete-variable, or qubit codes.
It was recently shown that the cat-code, as well as other kinds of CV codes, belong to a set of codes with common properties called rotation-symmetric codes.
arXiv Detail & Related papers (2022-06-03T18:00:01Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z) - Quantum Lego: Building Quantum Error Correction Codes from Tensor
Networks [0.0]
We represent complex code constructions as tensor networks built from the tensors of simple codes or states.
The framework endows a network geometry to any code it builds and is valid for constructing stabilizer codes.
We lay out some examples where we glue together simple stabilizer codes to construct non-trivial codes.
arXiv Detail & Related papers (2021-09-16T18:00: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) - Hardware-Encoding Grid States in a Non-Reciprocal Superconducting
Circuit [62.997667081978825]
We present a circuit design composed of a non-reciprocal device and Josephson junctions whose ground space is doubly degenerate and the ground states are approximate codewords of the Gottesman-Kitaev-Preskill (GKP) code.
We find that the circuit is naturally protected against the common noise channels in superconducting circuits, such as charge and flux noise, implying that it can be used for passive quantum error correction.
arXiv Detail & Related papers (2020-02-18T16:45:09Z)
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.