Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.38148

Experimental Observation of Error-Resilience Phase Transition on Superconducting Quantum Processor

Emanuel Dallas, Mario Morford-Oberst, Eric Weine

quant-phSubmitted Oct 28, 2026• Announced Oct 29, 2026• 1 citation
arXivHTMLPDF

Abstract

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 \approx 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 \approx 1.01$, well below the theoretical value. Inputting noiseless simulated data into the same model yields $α_c \approx 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.

AI Summary

The paper investigates whether the predicted error-resilience transition in random encoding–decoding circuits can be detected on superconducting hardware. The protocol encodes an initial product state, applies identical coherent $Z$ rotations of angle $\alpha$, decodes, and post-selects ancillas in their initial state. For Haar-random encoding at logical rate $k/N=1/2$, theory predicts a transition at $\alpha_c\approx1.14$ from recovery to vanishing logical fidelity, accompanied by extensive entanglement and non-stabilizerness. Experiments on IBM’s Heron r3 processor use depth-$N$ brickwork encoders assembled from native gates, with four encoding instances per size. Fidelity is measured up to $N=26$, subsystem Rényi-2 entropy up to $N=20$, and stabilizer Rényi-2 entropy up to $N=18$. Randomized measurements estimate the entropy observables; processing combines M3 readout mitigation, quadratic zero-noise extrapolation, and normalization against $\alpha=0$. The experiments use approximately $5.07\times10^8$ shots. A joint Gaussian-process finite-size-scaling fit gives an effective $\alpha_c\approx1.01$; noiseless simulations of the implemented ensemble give approximately $1.05$, with overlapping 95% credible intervals. Applying the same fit to unmitigated data does not consistently identify critical behavior. The stated evidence consists of finite-size crossings, scaling collapses, and agreement with simulations, rather than a hypothesis test establishing a transition. The encoders are not Haar-random, and the fitted threshold is not identified with the thermodynamic-limit value. Post-selection probability decreases exponentially with size, limiting precision. Hardware states remain mixed: subsystem entropy is therefore not strictly entanglement entropy, and the global-purity correction to stabilizer entropy is omitted.

Little sign of AI-generated textOverclaimsStrong assumptions

Central claim may not hold: The experiment establishes finite-size signatures consistent with an assumed scaling ansatz, rather than independently establishing the thermodynamic transition or its critical angle. The experimental reduced-state entropy is not an entanglement measure for the acknowledged mixed logical states, and the experimental magic estimator omits the unmeasured full-state purity correction required by the theoretical definition. The GP likelihood omits cross-angle correlations arising from reused random encodings and shared estimated normalization baselines, leaving its posterior uncertainty inadequately justified. The stated annealed-average definition gives asymptotically zero purity-corrected stabilizer entropy at alpha=pi, contradicting the extensive value in the paper's quoted formula. Agreement between experimental and noiseless fitted angles supports an encoding-ensemble explanation but does not uniquely establish insufficient circuit depth as the cause of the discrepancy from Haar theory.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Error-Resilience Phase Transitions in Encoding-Decoding Quantum Circuits

Xhek Turkeshi, Piotr Sierant

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.

arXiv:2308.06321•Physical Review Letters•Apr 1, 2024•38 citations

Error-Correction Transitions in Finite-Depth Quantum Channels

Arman Sauliere, Guglielmo Lami, Pedro Ribeiro +2 more

We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limit is governed by random matrix theory, which predicts a universal phase transition at a critical noise rate. This critical point separates an error correcting phase, in which encoded information is preserved, from a phase in which it is irretrievably lost. Going beyond the infinite depth limit, we characterize the systematic finite depth deviations from random matrix universality. In particular, we show that these deviations behave parametrically differently depending on whether the noise acts after the encoding or also affects the encoding itself. For noiseless encoders, the approach is exponential in circuit depth, although boundary effects can delay perfect encoding relative to the circuit design time. For noisy encoders, we find that the circuit fidelity effectively replaces the Hashing bound, and perfect encoding is approached polynomially with depth.

quant-pharXiv:2603.20369•Physical Review Letters•Mar 24, 2026•2 citations

Error correction phase transition in noisy random quantum circuits

Jon Nelson, Joel Rajakumar, Michael J. Gullans

In this work, we study the task of encoding logical information via a noisy quantum circuit. It is known that at superlogarithmic depth, the output of any noisy circuit without reset gates or intermediate measurements becomes indistinguishable from the maximally mixed state, implying that all input information is destroyed. This raises the question of whether there is a low-depth regime where information is preserved as it is encoded into an error-correcting codespace by the circuit. When considering noisy random encoding circuits, our numerical simulations show that there is a sharp phase transition at a critical depth of order $p^{-1}$, where $p$ is the noise rate, such that below this depth threshold quantum information is preserved, whereas after this threshold it is lost. Furthermore, we rigorously prove that this is the best achievable trade-off between depth and noise rate for any noisy circuit encoding a constant rate of information. Thus, random circuits are optimal noisy encoders in this sense.

arXiv:2510.07512•Oct 8, 2025•5 citations

Phase transitions in random circuit sampling

Alexis Morvan, Benjamin Villalonga, Xiao Mi +97 more

Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2–8. Nevertheless, quantum algorithms’ outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors. By implementing random circuit sampling, experimental and theoretical results establish the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.

arXiv:2304.11119•Nature•Oct 9, 2024•248 citations

Hardware-Efficient Error Mitigation and Shot-Efficient Sampling on IBM Quantum Hardware

Sumit Chongder

We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.

quant-pharXiv:2608.28535•Aug 31, 2026•0 citations

Error Resilience and Unitary 2-Designs

Zheng-Hang Sun, Fabian Ballar Trigueros, Xhek Turkeshi +1 more

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.

arXiv:2611.14314•Nov 10, 2026•0 citations
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α_c \approx 1.14α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=26N = 26N=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α_c \approx 1.01αc​≈1.01, well below the theoretical value. Inputting noiseless simulated data into the same model yields αc≈1.05α_c \approx 1.05α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.
The paper investigates whether the predicted error-resilience transition in random encoding–decoding circuits can be detected on superconducting hardware. The protocol encodes an initial product state, applies identical coherent ZZZ rotations of angle α\alphaα, decodes, and post-selects ancillas in their initial state. For Haar-random encoding at logical rate k/N=1/2k/N=1/2k/N=1/2, theory predicts a transition at αc≈1.14\alpha_c\approx1.14αc​≈1.14 from recovery to vanishing logical fidelity, accompanied by extensive entanglement and non-stabilizerness.
Experiments on IBM’s Heron r3 processor use depth-NNN brickwork encoders assembled from native gates, with four encoding instances per size. Fidelity is measured up to N=26N=26N=26, subsystem Rényi-2 entropy up to N=20N=20N=20, and stabilizer Rényi-2 entropy up to N=18N=18N=18. Randomized measurements estimate the entropy observables; processing combines M3 readout mitigation, quadratic zero-noise extrapolation, and normalization against α=0\alpha=0α=0. The experiments use approximately 5.07×1085.07\times10^85.07×108 shots. A joint Gaussian-process finite-size-scaling fit gives an effective αc≈1.01\alpha_c\approx1.01αc​≈1.01; noiseless simulations of the implemented ensemble give approximately 1.051.051.05, with overlapping 95% credible intervals. Applying the same fit to unmitigated data does not consistently identify critical behavior.
The stated evidence consists of finite-size crossings, scaling collapses, and agreement with simulations, rather than a hypothesis test establishing a transition. The encoders are not Haar-random, and the fitted threshold is not identified with the thermodynamic-limit value. Post-selection probability decreases exponentially with size, limiting precision. Hardware states remain mixed: subsystem entropy is therefore not strictly entanglement entropy, and the global-purity correction to stabilizer entropy is omitted.
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.
We study error correction type protocols in which a quantum channel encodes logical information into an enlarged Hilbert space. Specifically, we consider channels realized by one dimensional random noisy quantum circuits with spatially local interaction gates. We analyze both noise acting after the encoding and noise affecting the encoding circuit itself. Using the coherent information as a metric, we show that in both cases the infinite depth limit is governed by random matrix theory, which predicts a universal phase transition at a critical noise rate. This critical point separates an error correcting phase, in which encoded information is preserved, from a phase in which it is irretrievably lost. Going beyond the infinite depth limit, we characterize the systematic finite depth deviations from random matrix universality. In particular, we show that these deviations behave parametrically differently depending on whether the noise acts after the encoding or also affects the encoding itself. For noiseless encoders, the approach is exponential in circuit depth, although boundary effects can delay perfect encoding relative to the circuit design time. For noisy encoders, we find that the circuit fidelity effectively replaces the Hashing bound, and perfect encoding is approached polynomially with depth.
In this work, we study the task of encoding logical information via a noisy quantum circuit. It is known that at superlogarithmic depth, the output of any noisy circuit without reset gates or intermediate measurements becomes indistinguishable from the maximally mixed state, implying that all input information is destroyed. This raises the question of whether there is a low-depth regime where information is preserved as it is encoded into an error-correcting codespace by the circuit. When considering noisy random encoding circuits, our numerical simulations show that there is a sharp phase transition at a critical depth of order p−1p^{-1}p−1, where ppp is the noise rate, such that below this depth threshold quantum information is preserved, whereas after this threshold it is lost. Furthermore, we rigorously prove that this is the best achievable trade-off between depth and noise rate for any noisy circuit encoding a constant rate of information. Thus, random circuits are optimal noisy encoders in this sense.
Undesired coupling to the surrounding environment destroys long-range correlations in quantum processors and hinders coherent evolution in the nominally available computational space. This noise is an outstanding challenge when leveraging the computation power of near-term quantum processors1. It has been shown that benchmarking random circuit sampling with cross-entropy benchmarking can provide an estimate of the effective size of the Hilbert space coherently available2–8. Nevertheless, quantum algorithms’ outputs can be trivialized by noise, making them susceptible to classical computation spoofing. Here, by implementing an algorithm for random circuit sampling, we demonstrate experimentally that two phase transitions are observable with cross-entropy benchmarking, which we explain theoretically with a statistical model. The first is a dynamical transition as a function of the number of cycles and is the continuation of the anti-concentration point in the noiseless case. The second is a quantum phase transition controlled by the error per cycle; to identify it analytically and experimentally, we create a weak-link model, which allows us to vary the strength of the noise versus coherent evolution. Furthermore, by presenting a random circuit sampling experiment in the weak-noise phase with 67 qubits at 32 cycles, we demonstrate that the computational cost of our experiment is beyond the capabilities of existing classical supercomputers. Our experimental and theoretical work establishes the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors. By implementing random circuit sampling, experimental and theoretical results establish the existence of transitions to a stable, computationally complex phase that is reachable with current quantum processors.
We experimentally study error mitigation and finite-shot sampling on superconducting quantum hardware under a constrained execution budget. The study combines calibration-aware qubit selection, circuit-depth scaling, zero-noise extrapolation, dynamical decoupling, readout-error mitigation, and repeated-shot estimation on an IBM Quantum processor. Experiments are organized across ideal simulation, noise-model simulation, and physical-device execution to separate sampling uncertainty from device-induced error. We investigate how mitigation performance changes with circuit depth, effective noise scale, qubit connectivity, and measurement budget, and quantify accuracy using expectation-value error, mean-squared error, statistical uncertainty, and mitigation gain. A fixed hardware-execution budget is used to evaluate shot allocation strategies and repeated measurements without relying on unlimited sampling. The resulting analysis provides a hardware-aware characterization of when mitigation improves expectation-value estimation and when finite-shot fluctuations offset the benefit of additional mitigation overhead. The implementation uses contemporary Qiskit and IBM Quantum Runtime workflows and is designed to provide reproducible experimental evidence for error-mitigation studies on current quantum processors.
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.