The $2T$-qutrit, a two-mode bosonic qutrit

• URL: http://arxiv.org/abs/2210.16188v3
• Date: Wed, 31 May 2023 13:54:52 GMT
• Title: The $2T$-qutrit, a two-mode bosonic qutrit
• Authors: Aur\'elie Denys, Anthony Leverrier
• Abstract summary: Quantum computers often manipulate physical qubits encoded on two-level quantum systems. Bosonic qubit codes depart from this idea by encoding information in a well-chosen subspace of an infinite-dimensional Fock space. A bosonic qubit is usually defined in a single bosonic mode but it makes sense to look for multimode versions that could exhibit better performance.
• Score: 0.38073142980732994
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum computers often manipulate physical qubits encoded on two-level quantum systems. Bosonic qubit codes depart from this idea by encoding information in a well-chosen subspace of an infinite-dimensional Fock space. This larger physical space provides a natural protection against experimental imperfections and allows bosonic codes to circumvent no-go results that apply to states constrained by a 2-dimensional Hilbert space. A bosonic qubit is usually defined in a single bosonic mode but it makes sense to look for multimode versions that could exhibit better performance. In this work, building on the observation that the cat code lives in the span of coherent states indexed by a finite subgroup of the complex numbers, we consider a two-mode generalisation living in the span of 24 coherent states indexed by the binary tetrahedral group $2T$ of the quaternions. The resulting $2T$-qutrit naturally inherits the algebraic properties of the group $2T$ and appears to be quite robust in the low-loss regime. We initiate its study and identify stabilisers as well as some logical operators for this bosonic code.

Related papers

• Families of $d=2$ 2D subsystem stabilizer codes for universal Hamiltonian quantum computation with two-body interactions [0.0]
  In the absence of fault tolerant quantum error correction for analog, Hamiltonian quantum computation, error suppression via energy penalties is an effective alternative. We construct families of distance-$2$ stabilizer subsystem codes we call trapezoid codes'' We identify a family of codes achieving the maximum code rate, and by slightly relaxing this constraint, uncover a broader range of codes with enhanced physical locality.
  arXiv  Detail & Related papers  (2024-12-09T18:36:38Z)
• 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)
• Creation and manipulation of Schrödinger cat states of a nuclear spin qudit in silicon [28.4073170440133]
  We show the creation and manipulation of Schr"odinger cat states using the spin-7/2 nucleus of a single antimony atom. Results demonstrate high-fidelity preparation of nonclassical resource states and logical control in a single atomic-scale object.
  arXiv  Detail & Related papers  (2024-05-24T12:22:16Z)
• Improving Transmon Qudit Measurement on IBM Quantum Hardware [0.0]
  We propose and analyze two measurement strategies that improve the distinguishability of transmon qudit states. We discuss these strategies in the context of a practical implementation of the default measurement of a ququart on IBM Quantum hardware.
  arXiv  Detail & Related papers  (2023-07-25T13:58:11Z)
• Coherent dynamics in a five-level atomic system [62.997667081978825]
  coherent control of multi-partite quantum systems is one of the central prerequisites in quantum information processing. Laser-cooled neon atoms in the metastable state of state $1s2 2s2 2p5 3s$ are prepared. Coherence properties of the prepared states are studied using Ramsey and spin echo measurements.
  arXiv  Detail & Related papers  (2022-10-21T11:44:15Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• New Binary Quantum Codes Constructed from Quasi-Cyclic Codes [6.718184400443239]
  It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be symplectic dual-containing. As an application, we construct 8 binary quantum codes that exceed the best-known results.
  arXiv  Detail & Related papers  (2021-12-14T03:22:16Z)
• Balls and Walls: A Compact Unary Coding for Bosonic States [0.0]
  We introduce unary coding of bosonic occupation states based on the famous "balls and walls" counting for the number of configurations of $N$ indistinguishable particles on $L$ distinguishable sites. Each state is represented by an integer with a human readable bit that has a compositional structure allowing for the efficient application of operators that locally modify the number of bosons.
  arXiv  Detail & Related papers  (2021-09-15T18:14:08Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Log-domain decoding of quantum LDPC codes over binary finite fields [4.340338299803562]
  We study the decoding of quantum low-density parity-check (LDPC) codes over binary finite fields GF$(q=2l)$ by the sum-product algorithm, also known as belief propagation (BP) We show that scalar messages suffice for BP decoding of nonbinary quantum codes, rather than vector messages necessary for the conventional BP.
  arXiv  Detail & Related papers  (2021-04-01T07:15:41Z)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)
• Radiative topological biphoton states in modulated qubit arrays [105.54048699217668]
  We study topological properties of bound pairs of photons in spatially-modulated qubit arrays coupled to a waveguide. For open boundary condition, we find exotic topological bound-pair edge states with radiative losses. By joining two structures with different spatial modulations, we find long-lived interface states which may have applications in storage and quantum information processing.
  arXiv  Detail & Related papers  (2020-02-24T04:44:12Z)

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.