Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress decoherence. Here we show that logical noise can instead be turned into a calibrated resource. We treat the error-correction cycle as a programmable primitive: one fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing. This enables direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. We derive an accuracy criterion for multi-step simulation in which the code distance is chosen so that uncontrolled logical errors remain a small fraction of the intended dissipation per step, rather than being driven below an arbitrarily small closed-system tolerance. Partial quantum error correction thus repurposes fault-tolerant structure to sculpt dissipation, offering a resource-efficient route to quantum simulation of open quantum systems.
Noise is typically treated as the adversary of quantum information processing. For open quantum dynamics, however, dissipation is part of the target physics, creating a tension with fault-tolerant architectures designed to suppress decoherence. Here we show that logical noise can instead be turned into a calibrated resource. We treat the error-correction cycle as a programmable primitive: one fault-tolerant round induces a logical completely positive trace-preserving map, and decoder/recovery randomization generates a controllable family of logical channels whose convex mixtures realize Kraus-channel mixing. This enables direct compilation of target dissipators into effective logical dynamics without explicit ancilla qubits for encoding the bath degree of freedoms. We derive an accuracy criterion for multi-step simulation in which the code distance is chosen so that uncontrolled logical errors remain a small fraction of the intended dissipation per step, rather than being driven below an arbitrarily small closed-system tolerance. Partial quantum error correction thus repurposes fault-tolerant structure to sculpt dissipation, offering a resource-efficient route to quantum simulation of open quantum systems.
A persistent assumption in quantum information and quantum thermodynamics holds that noise and dissipation are adversaries to be suppressed. A candidate reading of several recent preprints across quant-ph and cond-mat.stat-mech suggests a more structured picture: fluctuations — quantum phase slips, engineered logical decoherence, and thermodynamic irreversibility — occupy a spectrum from obstacle to resource, and the position on that spectrum is governed by identifiable geometric and thermodynamic mechanisms rather than by the magnitude of the noise alone. This synthesis draws on six to seven findings: the Keldysh path-integral analysis of quantum synchronization breakdown via phase-slip proliferation [corpus:arxiv:2605.30302]; the companion result on Fock-state limit cycles where phase slips decay exponentially and synchronization is achievable [corpus:arxiv:2605.30271]; the programmable-dissipation framework that repurposes fault-tolerant error correction to sculpt target open-system dynamics [corpus:arxiv:2605.30217]; a geometric argument that non-unital noise expands the manifold of reachable pure states, accelerating approach to Haar-like distributions [corpus:arxiv:2605.30026]; the universal thermokinetic decomposition showing that dissipation suppresses fluctuations of predictability rather than enhancing mean predictability at short times [corpus:arxiv:2605.29957]; and the non-linear spin-noise scaling in warm atomic vapors that reveals many-body correlations through a quadratic density dependence [corpus:arxiv:2605.31262]. A weakly connected addendum discusses the improved Lindbladian simulation sample-complexity bounds [corpus:arxiv:2605.30301] as a computational analogue of the same resource-vs-overhead tension. The synthesis is a heuristic reading, not a derivation: the sources share vocabulary and structural analogies but do not share a single formal framework. The central falsification path is: if non-unital noise channels can be shown to *not* accelerate convergence to Haar-like distributions in systems where phase-slip rates are independently controlled, the geometric expansion argument fails. --- Authorship: Saluca Agentic AI Research Team (Saluca LLC). AI-drafted from arXiv preprint corpus on the date in the filename. Cited arXiv preprints: 2605.29957, 2605.30026, 2605.30139, 2605.30217, 2605.30271, 2605.30301, 2605.30302, 2605.31262, 2605.31544
Quantum error correction protects fragile quantum information by encoding it into a larger quantum system. These extra degrees of freedom enable the detection and correction of errors, but also increase the operational complexity of the encoded logical qubit. Fault-tolerant circuits contain the spread of errors while operating the logical qubit, and are essential for realizing error suppression in practice. While fault-tolerant design works in principle, it has not previously been demonstrated in an error-corrected physical system with native noise characteristics. In this work, we experimentally demonstrate fault-tolerant preparation, measurement, rotation, and stabilizer measurement of a Bacon-Shor logical qubit using 13 trapped ion qubits. When we compare these fault-tolerant protocols to non-fault tolerant protocols, we see significant reductions in the error rates of the logical primitives in the presence of noise. The result of fault-tolerant design is an average state preparation and measurement error of 0.6% and a Clifford gate error of 0.3% after error correction. Additionally, we prepare magic states with fidelities exceeding the distillation threshold, demonstrating all of the key single-qubit ingredients required for universal fault-tolerant operation. These results demonstrate that fault-tolerant circuits enable highly accurate logical primitives in current quantum systems. With improved two-qubit gates and the use of intermediate measurements, a stabilized logical qubit can be achieved.
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an ε detection rate within O(1/ε2) epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.
Quantum thermodynamics and quantum information theory are often developed as neighboring subjects: the former studies energy, heat, work, irreversibility, and fluctuations in quantum systems, while the latter studies the representation, transmission, manipulation, and protection of information in quantum states. For fault-tolerant quantum technologies, however, the separation is artificial. A quantum memory or processor is an open, controlled, and dissipative information-processing system whose logical degrees of freedom are maintained against noise by repeated syndrome extraction, feedback, dissipation, and reset. This article develops a unifying framework in which quantum error correction (QEC) is interpreted as the stabilization of an emergent informational order in a driven nonequilibrium quantum system. The framework is organized around five common mathematical structures: density operators and quantum channels; relative entropy and nonequilibrium free energy; Gorini–Kossakowski–Lindblad–Sudarshan (GKLS) dynamics and entropy production; code subspaces, syndromes, and recovery channels; and Liouvillian spectral structure, metastability, and criticality. We show how active QEC can be viewed as an entropy-pumping cycle that transfers noise-generated uncertainty from protected degrees of freedom into syndrome and controller degrees of freedom, whose reuse requires thermodynamic reset. Continuous and autonomous QEC are formulated as competition between natural noise and engineered dissipative generators, yielding stationary or periodic nonequilibrium states with nonvanishing microscopic currents even when logical observables are approximately stationary. Complexity is introduced from the outset through multiscale organization, predictive coarse-graining, information dynamics, and spectral separation; these concepts distinguish structured persistence from entropy reduction alone. At the level of a conceptual synthesis, this perspective relates model-specific fault-tolerance thresholds to critical phenomena, logical subspaces with slow emergent manifolds, syndrome decoding with stochastic inference, and engineered dissipation with self-organization. We finally propose a thermodynamic-complexity description of QEC in terms of logical error rate, entropy-production rate, Liouvillian gap, information flow, and control power. The resulting framework provides a common language for quantum thermodynamics, nonequilibrium statistical mechanics, complexity science, and quantum information and identifies concrete questions for thermodynamically efficient fault-tolerant quantum architectures.
A quiet but structurally significant pattern runs through recent work in quantum information, nonequilibrium statistical mechanics, and open quantum systems: dissipation, long treated as the adversary of coherence and precision, is increasingly understood to serve as a *calibration mechanism* — a resource that suppresses fluctuations, sculpts target dynamics, and enables reliable information processing at a thermodynamic cost that can, in principle, be precisely accounted for. This synthesis draws on five to seven recent findings across quant-ph and cond-mat.stat-mech to argue for a unified structural thesis: **the relationship between dissipation and information reliability is not merely a trade-off but a decomposable, mechanism-specific coupling whose structure can be read off from the system's nonequilibrium geometry**. Specifically, we connect (i) the thermokinetic decomposition of information fluctuations in Langevin systems [corpus:arxiv:2605.29957], (ii) the programmable use of logical noise in fault-tolerant quantum circuits [corpus:arxiv:2605.30217], (iii) quantum synchronization and its breakdown via phase slips in continuous-variable systems [corpus:arxiv:2605.30302], (iv) measurement-assisted quantum battery charging with quantifiable resource costs [corpus:arxiv:2605.31319], (v) the noise-as-resource geometric mechanism in quantum computing [corpus:arxiv:2605.30026], and (vi) the partial entropy production framework for active particles with hidden states [corpus:arxiv:2605.29201], with supporting context from sample-based Lindbladian simulation [corpus:arxiv:2605.30301]. The central falsification path is structural: if dissipation's role in information reliability is purely subtractive (i.e., noise always reduces mutual information monotonically and uniformly), then the thermokinetic decomposition's prediction that dissipation suppresses *fluctuations* of predictability without affecting *average* predictability would be violated. Similarly, if programmable dissipation cannot be distinguished from uncontrolled decoherence in logical dynamics, the fault-tolerant sculpting proposal collapses. We identify the conditions under which each mechanism operates and where they might fail. --- Authorship: Saluca Agentic AI Research Team (Saluca LLC). AI-drafted from arXiv preprint corpus on the date in the filename. Cited arXiv preprints: 2605.29201, 2605.29957, 2605.30026, 2605.30217, 2605.30271, 2605.30301, 2605.30302, 2605.31319, 2605.31347, 2605.31379, 2605.31493
Quantum computers are highly sensitive to noise due to interactions with the environment, which severely limits the utility of near-term devices. Quantum error correction addresses this challenge by encoding logical information over multiple qubits in order to preserve information in the presence of noise. This facilitates the realization of the theoretical advantages of quantum computing such as exponential speed-up compared to classical computers for certain algorithms. Physical realizations of qubits may have different noise profiles, including biased noise, where phase-flip errors may be more likely than bit-flip errors. We propose a quantum error-correcting code, the XYZ² code, which is tailored to biased noise. The code has high error thresholds against biased noise, below which logical errors are exponentially suppressed with the linear dimension of the code. The important classical task of deriving corrections given partial information about errors is called decoding. We investigate several decoding strategies tailored to specific challenges, ranging from a novel maximum-likelihood sampling decoder, to a model-free, data-driven, neural-network-based decoder, to an efficient multi-step decoder for concatenated codes. We also study the link between quantum error-correcting codes and their statistical-mechanical counterparts by mapping to generalized random-bond Ising models and subsequently deriving the exact results for finite-size corrections under biased noise for moderate code sizes. Quantum error correction is still in its developing stages, and this work provides a useful contribution to the field by bridging a gap between theory and practice. By adapting well-studied topological codes to error models that are closer to reality, this work paves the way for the realization of a fault-tolerant quantum architecture.