Spin ensembles are promising quantum technological platforms, but their utility relies on the ability to perform quantum error correction (QEC) for the specific decoherence in these systems. Typical QEC for ensembles requires addressing individually resolved qubits, but this is practically challenging in most realistic architectures. Here, we propose QEC schemes for unresolvable spin ensembles. By using degenerate superpositions of excited states, which are fundamentally mixed, we find codes that can protect against both individual and collective errors, including dephasing, decay, and pumping. 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.
Spin ensembles are promising quantum technological platforms, but their utility relies on the ability to perform quantum error correction (QEC) for the specific decoherence in these systems. Typical QEC for ensembles requires addressing individually resolved qubits, but this is practically challenging in most realistic architectures. Here, we propose QEC schemes for unresolvable spin ensembles. By using degenerate superpositions of excited states, which are fundamentally mixed, we find codes that can protect against both individual and collective errors, including dephasing, decay, and pumping. 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.
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.
Logical qubits can be protected from decoherence by performing quantum error-correction (QEC) cycles repeatedly. Algorithms for fault-tolerant QEC must be compiled to the specific hardware platform under consideration in order to practically realize a quantum memory that operates for in principle arbitrary long times. All circuit components must be assumed as noisy unless specific assumptions about the form of the noise are made. Modern QEC schemes are challenging to implement experimentally in physical architectures where in-sequence measurements and feed forward of classical information cannot be reliably executed fast enough or even at all. Here we provide a novel scheme to perform QEC cycles without the need of measuring qubits that is fully fault-tolerant with respect to all components used in the circuit. Our scheme can be used for any low-distance CSS code since its only requirement towards the underlying code is a transversal gate. Similarly to Steane-type EC, we coherently copy errors to a logical auxiliary qubit but then apply a coherent feedback operation from the auxiliary system to the logical data qubit. The logical auxiliary qubit is prepared fault tolerantly without measurements, too. We benchmark logical failure rates of the scheme in comparison to a flag-qubit-based EC cycle. We map out a parameter region where our scheme is feasible and estimate physical error rates necessary to achieve the break-even point of beneficial QEC with our scheme. We outline how our scheme could be implemented in ion traps and with neutral atoms in a tweezer array. For recently demonstrated capabilities of atom shuttling and native multiatom Rydberg gates, we achieve moderate circuit depths and beneficial performance of our scheme while not breaking fault tolerance. These results thereby enable practical fault-tolerant QEC in hardware architectures that do not support midcircuit measurements. Published by the American Physical Society 2024
Quantum error correction is essential for fault-tolerant quantum computation, yet most existing codes rely on local control and stabilizer measurements that are difficult to implement in systems dominated by collective interactions. Inspired by spin-GKP codes in PhysRevA.108.022428, we develop a general framework for Holstein-Primakoff spin codes, which maps continuous-variable bosonic codes onto permutation-symmetric spin ensembles via the Holstein-Primakoff approximation. We show that HP codes are robust to both collective and local-spin noise and propose an explicit measurement-free local error recovery procedure to map local noise into correctable collective-spin errors.
This paper presents a novel approach to quantum error correction (QEC) that integrates coding with feedback control. The core idea is to leverage multi-particle error-correcting codes and dynamically calibrate individual qubits based on measurement outcomes. This synergistic combination aims to significantly enhance error correction efficiency and achieve high fidelity quantum information transmission. The proposed framework addresses the critical challenge of environmental noise-induced decoherence, a major impediment to practical quantum computation and communication. We outline the design principles, key formulas, and the underlying mechanisms driving this approach. Specifically, we detail the application of a specific concatenated code structure and introduce a control system that utilizes feedback loops to counteract identified errors. The effectiveness of this combined approach is discussed theoretically, highlighting the potential for improved error correction rates and robustness against various noise models.
Quantum error correction (QEC) has emerged as a cornerstone in the quest for scalable and fault-tolerant quantum technologies. While quantum systems promise exponential advantages over classical computation, their extreme susceptibility to noise and decoherence presents a formidable challenge. This review critically examines the trajectory of QEC from its theoretical foundations to recent experimental realizations. Foundational codes, including Shor’s and Steane’s constructions, laid the groundwork for the stabilizer formalism and the development of topological and bosonic codes. Over the past decade, experimental demonstrations have validated these concepts, with logical qubits surpassing the lifetimes of physical qubits on platforms such as superconducting circuits, trapped ions, and photonics. Emerging approaches, including low-density parity-check codes, hybrid mitigation–correction strategies, and artificial intelligence–driven decoders, further illustrate the field’s dynamism. By synthesizing theoretical progress, empirical validation, and cross-platform innovations, this review highlights both achievements and persistent challenges particularly the overhead of physical qubits, the speed of real-time decoding, and integration into full-stack architectures. The analysis concludes that while scalable fault-tolerant quantum computing remains a work in progress, recent breakthroughs mark a decisive transition from abstraction to practicality, establishing QEC as a central pillar in the development of quantum computation, communication, and sensing.
We show a way to correct collective error through a three-qubit quantum code. The encoding and decoding (i.e., error recovery) operations for such a code, which protects one qubit of quantum information perfectly (with infinite ``distance'') against collective decoherence, are presented. The code is actually a manifestation of a noiseless subsystem first reported by Knill, Laflamme, and Viola [Phys. Rev. Lett. 84, 2525 (2000)], and provides a good illustration of the relationship between noiseless subsystems and error-correcting codes already noted by these authors. We also show in detail how this code can be used to preserve an arbitrary joint state (including entangled states) of two qubits, by pairing each of them with two other qubits, even in the case in which the two resulting clusters interact in nonequivalent ways with a common environment.