Encoding-error-decoding circuits provide a setting for studying protection of quantum information against errors. In these circuits, an encoding unitary is followed by an error layer, decoding by the inverse unitary, and ancilla postselection. For encoders drawn from unitary 2-design ensembles, these circuits exhibit an error-protecting phase below a threshold error strength in which the fidelity between the input and recovered logical states approaches unity. Here, we show how departures from Haar second-moment statistics of the encoder can destabilize the error-protecting phase and derive a universal inequality linking recovery fidelity to the second unitary frame potential, which quantifies the ensemble's proximity to a unitary 2-design. This connection is exemplified by matchgate circuits doped with a tunable number of non-Gaussian gates. We analytically show that undoped circuits lack a stable error-protecting phase in the thermodynamic limit and that increasing the doping restores the error protection mechanism as the encoder ensemble approaches an approximate unitary 2-design. Further examples of Hamiltonian encoders, including an experimentally motivated all-to-all spin model, follow the same mechanism. Our results identify recovery fidelity as a diagnostic of departures from unitary 2-design behavior in quantum many-body systems.
Encoding-error-decoding circuits provide a setting for studying protection of quantum information against errors. In these circuits, an encoding unitary is followed by an error layer, decoding by the inverse unitary, and ancilla postselection. For encoders drawn from unitary 2-design ensembles, these circuits exhibit an error-protecting phase below a threshold error strength in which the fidelity between the input and recovered logical states approaches unity. Here, we show how departures from Haar second-moment statistics of the encoder can destabilize the error-protecting phase and derive a universal inequality linking recovery fidelity to the second unitary frame potential, which quantifies the ensemble's proximity to a unitary 2-design. This connection is exemplified by matchgate circuits doped with a tunable number of non-Gaussian gates. We analytically show that undoped circuits lack a stable error-protecting phase in the thermodynamic limit and that increasing the doping restores the error protection mechanism as the encoder ensemble approaches an approximate unitary 2-design. Further examples of Hamiltonian encoders, including an experimentally motivated all-to-all spin model, follow the same mechanism. Our results identify recovery fidelity as a diagnostic of departures from unitary 2-design behavior in quantum many-body systems.
Random unitaries scramble quantum information into highly nonlocal degrees of freedom, thereby providing protection from local noise. However, as demonstrated by Turkeshi and Sierant (Phys. Rev. Lett. 132, 140401, 2024 and arXiv:2603.00235), this protection may fail once local noise grows sufficiently strong. These works describe a phase transition in a noisy random encoding-decoding circuit model between an error-protecting phase, in which encoded information is recoverable, and an error-vulnerable phase, in which encoded information is lost, with the transition occurring at a critical coherent noise angle αc≈1.14. Here, we present the first experimental observation of this transition, conducted on IBM's ibm_pittsburgh Heron r3 device for system sizes of up to N=26 qubits. We detect this transition via three order parameters: fidelity, Rényi-2 entanglement entropy, and stabilizer Rényi-2 entropy. For the latter two, we employ randomized measurement protocols to construct estimators, and for all three, we rely on zero-noise extrapolation and M3 SPAM error mitigation. We then jointly model the finite-size scaling collapse across all three order parameters with a Gaussian process regression, yielding a critical angle αc≈1.01, well below the theoretical value. Inputting noiseless simulated data into the same model yields αc≈1.05, implying that the discrepancy between experiment and theory is due to our encoding circuits, which are not deep enough to be truly Haar-random. Finally, we observe that the same model cannot adequately identify critical behavior in unmitigated, raw experimental data. This indicates that error mitigation techniques are crucial for detecting the transition on hardware.
Present-day quantum processors are open systems in which dissipation and decoherence degrade the information carried by a quantum state as it propagates through a circuit. We study this degradation in dissipative random quantum circuits, modeling each two-qubit gate as a diluted unitary that interpolates between the intended unitary operation and a random dissipative quantum channel. Using the fidelity between the ideal and noisy output states as a diagnostic, we show that sufficiently random unitary gates or dissipative Kraus operators lead to a universal decay of the average fidelity. This decay is determined only by the dissipation strength, system size, and circuit depth, while microscopic details of the gates and noise, including the Kraus rank, appear only in subleading corrections to higher moments. We derive a closed-form expression for the average fidelity in terms of three physically meaningful error parameters, dissipation strength, coherent two-qubit gate-error strength, and connectivity-error probability. Finally, we identify the cases when dissipative effects can be reproduced by an unitary-noise model and when dissipation-induced decoherence remains distinguishable from coherent noise at the level of the average fidelity.
Understanding how errors deteriorate the information encoded in a many-body quantum system is a fundamental problem with practical implications for quantum technologies. Here, we investigate a class of encoding-decoding random circuits subject to local coherent and incoherent errors. We analytically demonstrate the existence of a phase transition from an error-protecting phase to an error-vulnerable phase occurring when the error strength is increased. This transition is accompanied by Rényi entropy transitions and by onset of multifractal features in the system. Our results provide a new perspective on storing and processing quantum information, while the introduced framework enables an analytic understanding of a dynamical critical phenomenon in a many-body system.
Quantum magic resources, or nonstabilizerness, are a central ingredient for universal quantum computation. In noisy many-body systems, the interplay between these resources and errors leads to sharp magic phase transitions. However, the microscopic mechanism behind these critical phenomena is still an open question, especially since early empirical evidence showed conflicting results regarding their universality classes. In this work, we provide a comprehensive picture of magic phase transitions for the class of encoding-decoding quantum circuits to resolve these ambiguities. We analytically show that the behavior of magic resources is fundamentally dictated by the chosen measurement protocol. When we fix, or post-select, the class of measurement syndromes, the magic transition inherits the universal features of the error-resilience phase transition in the circuits. Interestingly, this clean transition survives even for fully random Haar encoders showing that it is a consequence of initial's state retrieval, and not an artifact of the Clifford encoders. On the other hand, if we consider realistic Born-rule sampling, the intrinsic statistical fluctuations of a given syndrome measurement act as a relevant perturbation. This brings in strong finite-size drifts and an apparent multifractality, which end up altering the critical behavior of the system. We reveal that magic phase transitions are actually direct manifestations of error-resilience thresholds, rather than independent critical phenomena, reconciling conflicting observations from the earlier literature. Ultimately, our framework clarifies how the quantum computational power can survive, or be irreversibly destroyed, due to the competition between scrambling, measurements, and errors.
Most quantum error-correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $|0\ensuremath{\rangle}$ which can be used as ancilla qubits to prepare multiqubit logical states. In this Brief Report, we examine the consequences of relaxing this assumption and propose a method to increase the fidelity produced by a given code when the ancilla qubits are initialized in mixed states, using the same number of qubits, at most doubling the number of gates when the recovery operation would already be implemented. The procedure implemented consists of altering the encoding operator to include the inverse of the unitary operation used to correct detected errors after decoding. This augmentation will be especially useful in quantum computing architectures that do not possess projective measurement, such as solid-state NMR quantum information processing.
Small high-rate non-CSS stabilizer codes provide compact platforms for encoded quantum computation, but mixed-Pauli checks and limited native transversal logical gates complicate fault-tolerant dynamics. Block-level constructions offer an alternative by mapping an entire logical block to a physical circuit rather than compiling separately protected logical gates. We investigate this approach using the high-rate [[8,3,3]] non-CSS code and logical Trotter circuits as a testbed. We construct flagged syndrome-extraction circuits and establish a circuit-level memory pseudo-threshold near 1.5×10−3. We then apply our symplectic-transvection construction, which maps a logical Trotter circuit to a physical circuit with the same block pattern for any stabilizer code. Although this mapping preserves the intended unitary algebraically, encoded Trotter circuits exhibit asymmetry between logical-X and logical-Z failure channels. Single-fault analysis identifies the mechanism: a fault on the shared parity ancilla can propagate through the uncomputation network into an undetectable logical operator, reducing the effective circuit distance in the affected sector. We evaluate flag-conditioned recovery, biased-noise decoding, CliNR resource verification, flag postselection, and asymmetric gate-noise models. These methods suppress propagated faults but do not simultaneously suppress both logical sectors in the realistic configurations studied. A diagnostic protected limit removing the identified malignant first-order locations restores pseudo-threshold behavior in both sectors, approaching memory performance. These results demonstrate the potential of block-level logical constructions for non-CSS codes without rich native transversal gate sets and the joint protection of the parity network, analog rotation, and recovery required to preserve fault-tolerant distance.