Encoding qubits in multimode grid states

• URL: http://arxiv.org/abs/2201.12337v2
• Date: Mon, 7 Feb 2022 16:06:33 GMT
• Title: Encoding qubits in multimode grid states
• Authors: Baptiste Royer, Shraddha Singh, Steven M. Girvin
• Abstract summary: We propose to encode logical qubits in grid states of an ensemble of harmonic oscillator modes. We show numerically that multimode grid codes have, compared to their single-mode counterpart, increased robustness against propagation of errors. We highlight some interesting links between multidimensional lattices and single-mode grid codesd with qubit codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Encoding logical quantum information in harmonic oscillator modes is a promising and hardware-efficient approach to the realization of a quantum computer. In this work, we propose to encode logical qubits in grid states of an ensemble of harmonic oscillator modes. We first discuss general results about these multimode bosonic codes; how to design them, how to practically implement them in different experimental platforms and how lattice symmetries can be leveraged to perform logical non-Clifford operations. We then introduce in detail two two-mode grid codes based on the hypercubic and D4 lattices, respectively, showing how to perform a universal set of logical operations. We demonstrate numerically that multimode grid codes have, compared to their single-mode counterpart, increased robustness against propagation of errors from ancillas used for error correction. Finally, we highlight some interesting links between multidimensional lattices and single-mode grid codes concatenated with qubit codes.

Related papers

• Pruning qLDPC codes: Towards bivariate bicycle codes with open boundary conditions [1.6385815610837167]
  Quantum low-density parity-check codes are promising candidates for quantum error correcting codes. We introduce the concept of pruning quantum codes. We investigate fault-tolerant quantum computation using the constructed pruned codes by describing fold-transversal gates.
  arXiv  Detail & Related papers  (2024-12-05T14:20:44Z)
• 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)
• Crosstalk-Robust Quantum Control in Multimode Bosonic Systems [34.03303487556571]
  High-coherence superconducting cavities offer a hardware-efficient platform for quantum information processing. To achieve universal operations of bosonic modes, the requisite nonlinearity is realized by coupling them to a transmon ancilla. We employ quantum optimal control to engineer ancilla pulses that are robust to the frequency shifts.
  arXiv  Detail & Related papers  (2024-03-01T04:33:12Z)
• 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)
• 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)
• Two qubits in one transmon -- QEC without ancilla hardware [68.8204255655161]
  We show that it is theoretically possible to use higher energy levels for storing and controlling two qubits within a superconducting transmon. The additional qubits could be used in algorithms which need many short-living qubits in error correction or by embedding effecitve higher connectivity in qubit networks.
  arXiv  Detail & Related papers  (2023-02-28T16:18:00Z)
• Error Correction Code Transformer [92.10654749898927]
  We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths. We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately. The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
  arXiv  Detail & Related papers  (2022-03-27T15:25:58Z)
• Hybrid Neural Coded Modulation: Design and Training Methods [16.778378666167026]
  inner code is designed using a deep neural network (DNN) which takes the channel coded bits and outputs modulated symbols. The resulting constellations are shown to outperform the conventional quadrature amplitude modulation (QAM) based coding scheme for modulation order 16 and 64 with 5G standard LDPC codes.
  arXiv  Detail & Related papers  (2022-02-04T05:04:15Z)
• 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)
• 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.