Quantum error correction is essential for achieving fault-tolerant quantum computation. However, most typical quantum error-correcting codes are designed for generic noise models, which may fail to accurately capture the intricate noise characteristics of real quantum devices, limiting their practical performance. This work introduces Variational Graphical Quantum Error Correction (VGQEC), a learning-based framework that enhances standard quantum codes by embedding tunable parameters into their associated Quon graphs. Consequently, VGQEC codes can adapt to device-specific noise models and interpolate between different code families, effectively integrating their respective strengths. As an application, we fine-tune the three-qubit repetition code and discover a compact code for amplitude damping noise. Furthermore, within a thermal relaxation model guided by experimental data, we refine the five-qubit [[5,1,3]] code, achieving near-optimal numerical performance. Finally, we experimentally demonstrate the effectiveness of the three-qubit VGQEC code in low-to-medium noise regime with a photonic system, highlighting its potential for real-world applications. Quantum error correction is essential for reliable quantum computing, but standard codes are usually designed for generic noise and may perform poorly on real devices. Here, the authors introduce a variational graphical framework that tunes known codes to device-specific noise, improving performance in simulations and photonic experiments.
Quantum error correction is essential for achieving fault-tolerant quantum computation. However, most typical quantum error-correcting codes are designed for generic noise models, which may fail to accurately capture the intricate noise characteristics of real quantum devices, limiting their practical performance. This work introduces Variational Graphical Quantum Error Correction (VGQEC), a learning-based framework that enhances standard quantum codes by embedding tunable parameters into their associated Quon graphs. Consequently, VGQEC codes can adapt to device-specific noise models and interpolate between different code families, effectively integrating their respective strengths. As an application, we fine-tune the three-qubit repetition code and discover a compact code for amplitude damping noise. Furthermore, within a thermal relaxation model guided by experimental data, we refine the five-qubit [[5,1,3]] code, achieving near-optimal numerical performance. Finally, we experimentally demonstrate the effectiveness of the three-qubit VGQEC code in low-to-medium noise regime with a photonic system, highlighting its potential for real-world applications. Quantum error correction is essential for reliable quantum computing, but standard codes are usually designed for generic noise and may perform poorly on real devices. Here, the authors introduce a variational graphical framework that tunes known codes to device-specific noise, improving performance in simulations and photonic experiments.
Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface code schemes, must devote a large fraction of their physical quantum bits to quantum error correction. Building from recent quantum machine learning techniques, we propose an alternative approach to quantum error correction aimed at reducing this overhead, which can be implemented in existing quantum hardware and on a myriad of quantum computing architectures. This method aims to optimize the average fidelity of encoding and recovery circuits with respect to the actual noise in the device, as opposed to that of an artificial or approximate noise model. The quantum variational error corrector (QVECTOR) algorithm employs a quantum circuit with parameters that are variationally-optimized according to processed data originating from quantum sampling of the device, so as to learn encoding and error-recovery gate sequences. We develop this approach for the task of preserving quantum memory and analyze its performance with simulations. We find that, subject to phase damping noise, the simulated QVECTOR algorithm learns a three-qubit encoding and recovery which extend the effective T2 of a quantum memory six-fold. Subject to a continuous-time amplitude- plus phase-damping noise model on five qubits, the simulated QVECTOR algorithm learns encoding and decoding circuits which exploit the coherence among Pauli errors in the noise model to outperform the five-qubit stabilizer code and any other scheme that does not leverage such coherence. Both of these schemes can be implemented with existing hardware.
Quantum error correction is believed to be a necessity for large-scale fault-tolerant quantum computation. In the past two decades, various constructions of quantum error-correcting codes (QECCs) have been developed, leading to many good code families. However, the majority of these codes are not suitable for near-term quantum devices. Here we present VarQEC, a noise-resilient variational quantum algorithm to search for quantum codes with a hardware-efficient encoding circuit. The cost functions are inspired by the most general and fundamental requirements of a QECC, the Knill-Laflamme conditions. Given the target noise channel (or the target code parameters) and the hardware connectivity graph, we optimize a shallow variational quantum circuit to prepare the basis states of an eligible code. In principle, VarQEC can find quantum codes for any error model, whether additive or non-additive, degenerate or non-degenerate, pure or impure. We have verified its effectiveness by (re)discovering some symmetric and asymmetric codes, e.g., ((n,2n−6,3))2 for n from 7 to 14. We also found new ((6,2,3))2 and ((7,2,3))2 codes that are not equivalent to any stabilizer code, and extensive numerical evidence with VarQEC suggests that a ((7,3,3))2 code does not exist. Furthermore, we found many new channel-adaptive codes for error models involving nearest-neighbor correlated errors. Our work sheds new light on the understanding of QECC in general, which may also help to enhance near-term device performance with channel-adaptive error-correcting codes.
This paper presents a novel adaptive optimization algorithm for quantum error correction (QEC) codes, designed to significantly enhance the resilience of quantum computations against errors. The core claim is that by dynamically adjusting QEC parameters based on real-time analysis of error characteristics, we can achieve a substantial improvement in error correction performance. This is achieved through the integration of quantum error models and machine learning techniques, specifically reinforcement learning, enabling the algorithm to learn and adapt to varying error distributions. Traditional QEC code design often relies on static parameters, limiting their effectiveness in handling the inherent noise and fluctuations within quantum systems. This research addresses this limitation by introducing a dynamic, self-optimizing approach. The algorithm's ability to respond to evolving error profiles represents a critical step towards practical, fault-tolerant quantum computing. The proposed method focuses on optimizing code parameters such as parity checking rates, code distance, and decoding strategies to minimize the impact of observed errors. The simulation results demonstrate a notable improvement in error correction rates compared to static code implementations.
Quantum error correction (QEC) plays a critical role in preventing information loss in quantum systems and provides a framework for reliable quantum computation. Identifying quantum codes with nice code parameters for physically motivated noise models remains an interesting challenge. While past work has primarily focused on qubit codes, here we identify a [4,1] qudit error correcting code tailored to protect against amplitude-damping noise. We show that this four-qudit code satisfies the error correction conditions for all single-qudit and a few two-qudit damping errors up to the leading order in the damping parameter $\ensuremath{\gamma}$. We devise a protocol to extract syndromes that unambiguously identify this set of errors, leading to a noise-adapted recovery scheme that achieves a fidelity loss of $O({\ensuremath{\gamma}}^{2})$. For the d=2 case, our QEC scheme is identical to the known example of the four-qubit code and the associated syndrome-based recovery. We also assess the performance of this code using the Petz recovery map and note some interesting deviations from the qubit case. Finally, we generalize this construction to a family of [2M+2,M] qudit codes that can approximately correct all the single-qudit and a few two-qudit amplitude-damping errors.
Quantum error correcting (QEC) plays a crucial role in protecting quantum information against decoherence and enabling scalable, reliable quantum computing. One of the most realistic and ubiquitous sources of noise affecting quantum hardware today is generalized amplitude-damping (GAD) noise. Conventional, deterministic QEC codes struggle to correct for GAD noise because of their inherent structure, leading to fidelity losses that scale linearly with the damping strength. In this work, we introduce the framework of probabilistic approximate quantum error correction (PAQEC), that combines the flexibility of approximate QEC with the potential of post-selected recovery, enabling high-fidelity, resource-efficient error correction. We construct a five-qubit permutation-invariant code that, under probabilistic recovery, achieves a fidelity loss quadratic in the damping strength, thus outperforming existing QEC codes. Formulating PAQEC as an optimization problem, we present a numerical technique based on Charnes-Cooper and semidefinite programming to identify the optimal recovery map for any PAQEC code. Our results establish PAQEC as a powerful tool for developing resource-efficient, high-fidelity quantum codes tailored to realistic noise, with promising implications for near-term quantum devices and future fault-tolerant architectures.
We describe the smallest quantum error correcting (QEC) code to correct for amplitude-damping (AD) noise, namely, a three-qubit code that corrects all the single-qubit damping errors. We generalize this construction to a family of codes that correct AD noise up to any fixed order of the damping strength. We underpin the fundamental connection between the structure of our codes and the noise structure, via a relaxed form of the Knill-Laflamme conditions, different from existing formulations of approximate QEC conditions. Although the recovery procedure for this code is nondeterministic, our codes are optimal with respect to overheads and outperform existing codes to tackle AD noise in terms of entanglement fidelity. This formulation of probabilistic QEC further leads us to a family of quantum codes tailored to AD noise and also gives rise to a noise-adapted quantum Hamming bound for AD noise. Finally, we construct a set of universal logical gates for the three-qubit code, thus providing a potential pathway to fault tolerance via this class of codes.