A fault-tolerant encoding for qubit-controlled collective spins

• URL: http://arxiv.org/abs/2603.15760v1
• Date: Mon, 16 Mar 2026 18:00:24 GMT
• Title: A fault-tolerant encoding for qubit-controlled collective spins
• Abstract summary: We introduce spin-N-Cat codes, which encode qubits in superpositions of spin-coherent states and generalize bosonic Cat codes to the modular subspaces of permutationally symmetric spin ensembles.<n>We also present an efficient physical realization in central-spin systems, such as a quantum dot, where encoding, decoding, and a universal, fault-tolerant, and bias-preserving gate set are implemented using only first-order interactions.
• Score: 0.05729426778193398
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction (QEC) is indispensable for scalable quantum computing, but implementing it with minimal hardware overhead remains a central challenge. Large spin systems with collective degrees of freedom offer a promising route to reducing the control complexity of qubit architectures while retaining a large Hilbert space for fault-tolerant encoding. However, existing proposals for logical gates and QEC in spin ensembles generally rely on inefficient higher-order interactions. Here we introduce spin-N-Cat codes, which encode logical qubits in superpositions of spin-coherent states and generalize bosonic Cat codes to the modular subspaces of permutationally symmetric spin ensembles. The code corrects collective and individual dephasing, excitation, and decay errors. We also present an efficient physical realization in central-spin systems, such as a quantum dot, where encoding, decoding, and a universal, fault-tolerant, and bias-preserving gate set are implemented using only first-order interactions. Numerical simulations demonstrate high logical fidelity under dephasing and excitation-decay noise, independent of noise bias, and that full QEC cycles are feasible with realistic microscopic parameters. For the large collective spins available in quantum dots, this translates into a substantial extension of coherence time. Our results establish spin-N-Cat codes as a scalable, hardware-efficient approach to QEC in spin-based quantum architectures.

Related papers

• CQM: Cyclic Qubit Mappings [0.3823356975862005]
  We show promise as a path towards fault tolerant quantum computing.<n>We propose cyclic qubit mappings (CQM), a dynamic remapping technique.<n>CQM shows initial promise given it's minimal execution time overhead and effective resource utilization.
  arXiv  Detail & Related papers  (2026-02-23T18:38:04Z)
• Bosonic quantum computing with near-term devices and beyond [0.0]
  This thesis investigates scalable fault-tolerant quantum computation.<n>We develop bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction.
  arXiv  Detail & Related papers  (2025-12-17T04:01:54Z)
• Exploiting Movable Logical Qubits for Lattice Surgery Compilation [43.290156259065554]
  We introduce a paradigm shift by exploiting movable logical qubits via teleportation during the logical lattice surgery CNOT gate.<n> Numerical simulations show that the proposed approach can substantially reduce the routed circuit depth.<n>An open-source implementation of our method is available on GitHub.
  arXiv  Detail & Related papers  (2025-12-03T19:00:04Z)
• Universal Quantum Gate Set for Gottesman-Kitaev-Preskill Logical Qubits [0.0]
  We report on the experimental demonstration of a universal gate set for the GKP code. This includes single-qubit gates and -- for the first time -- a two-qubit entangling gate between logical code words. We demonstrate single-qubit gates with a logical process fidelity as high as 0.960 and a two-qubit entangling gate with a logical process fidelity of 0.680.
  arXiv  Detail & Related papers  (2024-09-09T09:23:36Z)
• Quantum error correction for unresolvable spin ensemble [0.6554326244334868]
  We propose quantum error correction schemes for unresolvable spin ensembles. By using superpositions of excited states, which are fundamentally mixed, we find codes that can protect against both individual and collective errors. We show how information recovery can be achieved with only collective measurement and control, and illustrate its applications in extending memory lifetime and loss-tolerant sensing.
  arXiv  Detail & Related papers  (2024-08-21T13:56:07Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Beating the break-even point with a discrete-variable-encoded logical qubit [11.225411597366886]
  Quantum error correction (QEC) aims to protect logical qubits from noises by utilizing the redundancy of a large Hilbert space. In most QEC codes, a logical qubit is encoded in some discrete variables, e.g., photon numbers. Our work illustrates the potential of the hardware-efficient discrete-variable QEC codes towards a reliable quantum information processor.
  arXiv  Detail & Related papers  (2022-11-17T03:38:55Z)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.<n>We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• Hardware-efficient error-correcting codes for large nuclear spins [62.997667081978825]
  We present a hardware-efficient quantum protocol that corrects phase flips of a nuclear spin using explicit experimentally feasible operations. Results provide a realizable blueprint for a corrected spin-based qubit.
  arXiv  Detail & Related papers  (2021-03-15T17:14:48Z)

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.