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:2606.02122

Can scrambling protect quantum state distinguishability under noise?

Guoding Liu, Chushi Qin, Zitai Xu, Xiongfeng Ma, Zi-Wen Liu

quant-phSubmitted Jun 1, 2026• Announced Jun 2, 2026• 1 citation
arXivHTMLPDF

Abstract

Quantum state distinguishability is a fundamental concept in quantum information science that underpins a wide range of important practical tasks. Traditionally formulated for pairs of states, quantum state distinguishability is here extended to quantum state ensembles, which we characterize through the average pairwise trace distance. Motivated by both theoretical and practical interest in noisy quantum information processing, we ask whether ``minimally'' scrambled ensembles modeled by 2-designs protect distinguishability under noise, which sheds light on the fundamental competition between noise and information scrambling. Using a rigorous decoupling approach, we establish tight bounds on noisy ensemble distinguishability. We show that the distinguishability of noisy 2-design ensembles exhibits a sharp threshold and phase-transition behavior governed by channel conditional entropy: below the threshold, the states remain mutually distinguishable with high probability, while above it, distinguishability undergoes a sudden power-law decay and then collapses exponentially. On the other hand, under local purity-shrinking noise, post-measured noisy 2-design ensembles become exponentially indistinguishable for any measurement, precluding a noise threshold for learning tasks such as shadow tomography. These results reveal a sharp difference between unmeasured and post-measured scrambled ensembles: the former can retain high distinguishability for sufficiently small noise, whereas the latter exhibits no such protected regime. We discuss the implications of these results for crucial tasks ranging from quantum communication and cryptography to learning.

Comments
26 pages, 2 figures. Comments are welcome!

Related papers

Inaccessible information in probabilistic models of quantum systems, non-contextuality inequalities and noise thresholds for contextuality

Iman Marvian

Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.

arXiv:2003.05984•Mar 12, 2020•20 citations

Role of scrambling and noise in temporal information processing with quantum systems

Xiong, Weijie, Zoë Holmes, Armando Angrisani +3 more

Scrambling quantum systems have attracted attention as effective substrates for temporal information processing. Here we consider a quantum reservoir processing framework that captures a broad range of physical computing models with quantum systems. We examine the scalability and memory retention of the model with scrambling reservoirs modelled by high-order unitary designs in both noiseless and noisy settings. In the former regime, we show that measurement readouts become exponentially concentrated with increasing reservoir size, yet strikingly do not worsen with the reservoir iterations. Thus, while repeatedly reusing a small scrambling reservoir with quantum data might be viable, scaling up the problem size deteriorates generalization unless one can afford an exponential shot overhead. In contrast, the memory of early inputs and initial states decays exponentially in both reservoir size and reservoir iterations. In the noisy regime, we also prove that memory decays exponentially in time for local noisy channels. These results required us to introduce new proof techniques for bounding concentration in temporal quantum models. Beyond this extreme scrambling regime, we numerically demonstrate that exponential concentration can still exist even with a physical reservoir such as an Ising model whenever the reservoir operates in a quantum-chaotic phase. In contrast, physical reservoirs in a many-body localized phase and at the edge of chaos appear to not suffer from such phenomena

arXiv:2505.10080•May 15, 2025•22 citations

Scrambling-induced entanglement suppression in noisy quantum circuits

Lea Haas, Christian Carisch, Oded Zilberberg

Quantum information scrambling is a process happening during thermalization in quantum systems and describes the delocalization of quantum information. It is closely tied to entanglement, a key resource for quantum technologies and an order parameter for quantum many-body phenomena. We investigate the effect of dephasing noise on a multi-qubit teleportation protocol that experimentally validated quantum information scrambling. We find that while scrambling enhances information distribution, it is highly noise-sensitive, leading to decreased teleportation fidelity and an increase in the classical mixing of the quantum state. Using negativity as a mixed-state entanglement measure, we identify two fundamentally different entanglement-scaling regimes: efficient entanglement generation under weak dephasing noise, and entanglement suppression under strong dephasing noise. We show that in the latter, the teleportation consumes more entanglement than the scrambling is able to create. Comparison with a SWAP-gate-based teleportation protocol confirms that the entanglement suppression is a consequence of the scrambling mechanism. Our findings suggest that the information dynamics during thermalization is critically affected by dephasing noise, and confirm that in present-day noisy quantum devices, local information exchange is preferable over long-range information scrambling.

arXiv:2408.02810•Aug 5, 2024•1 citation

Entanglement, quantum randomness, and complexity beyond scrambling

Zi-Wen Liu, Seth Lloyd, Elton Yechao Zhu +1 more

Abstract Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that “hides” initially localized quantum information. Closely related notions include quantum chaos and thermalization. Such phenomena play key roles in the study of quantum gravity, many-body physics, quantum statistical mechanics, quantum information etc. Scrambling can exhibit different complexities depending on the degree of randomness it produces. For example, notice that the complete randomization implies scrambling, but the converse does not hold; in fact, there is a significant complexity gap between them. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Rényi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Rényi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Rényi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom. This paper is an extended version of Phys. Rev. Lett. 120 (2018) 130502 [1].

arXiv:1703.08104•Journal of High Energy Physics•Jul 1, 2018•66 citations

MEASUREMENT-INDUCED ENTANGLEMENT TRANSITIONS AND INFORMATION SCRAMBLING IN DISORDERED QUANTUM MANY-BODY SYSTEMS

Levente Nyáradi

Competition between unitary entanglement generation, local quantum measurement, and quenched disorder provides a useful setting for examining the operational meaning of information spreading in nonequilibrium many-body systems. This theoretical and comparative study analyzes monitored quantum circuits and disordered spin dynamics without presenting newly simulated data. It distinguishes trajectory-conditioned entanglement from ensemble-averaged mixed-state entropy, operator growth from recoverable quantum information, and measurement-driven disentanglement from localization-induced slowing. Particular attention is paid to finite-size crossover behavior, conservation laws, noncommuting measurement protocols, purification time, decoding tasks, and the limitations of statistical-mechanical mappings. An integrated evaluation framework is developed for comparing spatial entanglement scaling, reference-qubit purification, mutual information, operator diagnostics, and robustness to environmental noise. Disorder is shown to modify the routes by which correlations become accessible to measurements, but it does not furnish a universal criterion for a new entanglement phase. The analysis identifies conditions under which reported critical behavior can be interpreted as a genuine monitored-dynamics transition rather than as a sampling artifact, crossover, or consequence of an improperly specified observable. The resulting perspective connects foundational quantum information theory to practicable validation strategies for noisy many-body platforms.

•Nov 3, 2026•0 citations

Entropic scrambling complexities

Zi-Wen Liu, Huangjun Zhu, Elton Yechao Zhu +1 more

Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that hides initially localized quantum information. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Renyi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Renyi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Renyi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Renyi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom.

•Mar 23, 2017•2 citations
Quantum state distinguishability is a fundamental concept in quantum information science that underpins a wide range of important practical tasks. Traditionally formulated for pairs of states, quantum state distinguishability is here extended to quantum state ensembles, which we characterize through the average pairwise trace distance. Motivated by both theoretical and practical interest in noisy quantum information processing, we ask whether ``minimally'' scrambled ensembles modeled by 2-designs protect distinguishability under noise, which sheds light on the fundamental competition between noise and information scrambling. Using a rigorous decoupling approach, we establish tight bounds on noisy ensemble distinguishability. We show that the distinguishability of noisy 2-design ensembles exhibits a sharp threshold and phase-transition behavior governed by channel conditional entropy: below the threshold, the states remain mutually distinguishable with high probability, while above it, distinguishability undergoes a sudden power-law decay and then collapses exponentially. On the other hand, under local purity-shrinking noise, post-measured noisy 2-design ensembles become exponentially indistinguishable for any measurement, precluding a noise threshold for learning tasks such as shadow tomography. These results reveal a sharp difference between unmeasured and post-measured scrambled ensembles: the former can retain high distinguishability for sufficiently small noise, whereas the latter exhibits no such protected regime. We discuss the implications of these results for crucial tasks ranging from quantum communication and cryptography to learning.
Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources for information processing tasks. A common feature of these models is the presence of inaccessible information, as captured by the concept of preparation contextuality: There are ensembles of quantum states described by the same density operator, and hence operationally indistinguishable, and yet in any probabilistic (ontological) model, they should be described by distinct probability distributions. In this work, we quantify the inaccessible information of a model in terms of the maximum distinguishability of probability distributions associated to any pair of ensembles with identical density operators, as quantified by the total variation distance of the distributions. We obtain a family of lower bounds on this maximum distinguishability in terms of experimentally measurable quantities. In the case of an ideal qubit this leads to a lower bound of, approximately, 0.07. These bounds can also be interpreted as a new class of robust preparation non-contextuality inequalities. Our non-contextuality inequalities are phrased in terms of generalizations of max-relative entropy and trace distance for general operational theories, which could be of independent interest. Under sufficiently strong noise any quantum system becomes preparation non-contextual, i.e., can be described by models with zero inaccessible information. Using our non-contextuality inequalities, we show that this can happen only if the noise channel has the average gate fidelity less than or equal to 1/D(1+1/2+...+1/D), where D is the dimension of the Hilbert space.
Scrambling quantum systems have attracted attention as effective substrates for temporal information processing. Here we consider a quantum reservoir processing framework that captures a broad range of physical computing models with quantum systems. We examine the scalability and memory retention of the model with scrambling reservoirs modelled by high-order unitary designs in both noiseless and noisy settings. In the former regime, we show that measurement readouts become exponentially concentrated with increasing reservoir size, yet strikingly do not worsen with the reservoir iterations. Thus, while repeatedly reusing a small scrambling reservoir with quantum data might be viable, scaling up the problem size deteriorates generalization unless one can afford an exponential shot overhead. In contrast, the memory of early inputs and initial states decays exponentially in both reservoir size and reservoir iterations. In the noisy regime, we also prove that memory decays exponentially in time for local noisy channels. These results required us to introduce new proof techniques for bounding concentration in temporal quantum models. Beyond this extreme scrambling regime, we numerically demonstrate that exponential concentration can still exist even with a physical reservoir such as an Ising model whenever the reservoir operates in a quantum-chaotic phase. In contrast, physical reservoirs in a many-body localized phase and at the edge of chaos appear to not suffer from such phenomena
Quantum information scrambling is a process happening during thermalization in quantum systems and describes the delocalization of quantum information. It is closely tied to entanglement, a key resource for quantum technologies and an order parameter for quantum many-body phenomena. We investigate the effect of dephasing noise on a multi-qubit teleportation protocol that experimentally validated quantum information scrambling. We find that while scrambling enhances information distribution, it is highly noise-sensitive, leading to decreased teleportation fidelity and an increase in the classical mixing of the quantum state. Using negativity as a mixed-state entanglement measure, we identify two fundamentally different entanglement-scaling regimes: efficient entanglement generation under weak dephasing noise, and entanglement suppression under strong dephasing noise. We show that in the latter, the teleportation consumes more entanglement than the scrambling is able to create. Comparison with a SWAP-gate-based teleportation protocol confirms that the entanglement suppression is a consequence of the scrambling mechanism. Our findings suggest that the information dynamics during thermalization is critically affected by dephasing noise, and confirm that in present-day noisy quantum devices, local information exchange is preferable over long-range information scrambling.
Abstract Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that “hides” initially localized quantum information. Closely related notions include quantum chaos and thermalization. Such phenomena play key roles in the study of quantum gravity, many-body physics, quantum statistical mechanics, quantum information etc. Scrambling can exhibit different complexities depending on the degree of randomness it produces. For example, notice that the complete randomization implies scrambling, but the converse does not hold; in fact, there is a significant complexity gap between them. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Rényi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Rényi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Rényi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Rényi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom. This paper is an extended version of Phys. Rev. Lett. 120 (2018) 130502 [1].
Competition between unitary entanglement generation, local quantum measurement, and quenched disorder provides a useful setting for examining the operational meaning of information spreading in nonequilibrium many-body systems. This theoretical and comparative study analyzes monitored quantum circuits and disordered spin dynamics without presenting newly simulated data. It distinguishes trajectory-conditioned entanglement from ensemble-averaged mixed-state entropy, operator growth from recoverable quantum information, and measurement-driven disentanglement from localization-induced slowing. Particular attention is paid to finite-size crossover behavior, conservation laws, noncommuting measurement protocols, purification time, decoding tasks, and the limitations of statistical-mechanical mappings. An integrated evaluation framework is developed for comparing spatial entanglement scaling, reference-qubit purification, mutual information, operator diagnostics, and robustness to environmental noise. Disorder is shown to modify the routes by which correlations become accessible to measurements, but it does not furnish a universal criterion for a new entanglement phase. The analysis identifies conditions under which reported critical behavior can be interpreted as a genuine monitored-dynamics transition rather than as a sampling artifact, crossover, or consequence of an improperly specified observable. The resulting perspective connects foundational quantum information theory to practicable validation strategies for noisy many-body platforms.
Scrambling is a process by which the state of a quantum system is effectively randomized due to the global entanglement that hides initially localized quantum information. In this work, we lay the mathematical foundations of studying randomness complexities beyond scrambling by entanglement properties. We do so by analyzing the generalized (in particular Renyi) entanglement entropies of designs, i.e. ensembles of unitary channels or pure states that mimic the uniformly random distribution (given by the Haar measure) up to certain moments. A main collective conclusion is that the Renyi entanglement entropies averaged over designs of the same order are almost maximal. This links the orders of entropy and design, and therefore suggests Renyi entanglement entropies as diagnostics of the randomness complexity of corresponding designs. Such complexities form a hierarchy between information scrambling and Haar randomness. As a strong separation result, we prove the existence of (state) 2-designs such that the Renyi entanglement entropies of higher orders can be bounded away from the maximum. However, we also show that the min entanglement entropy is maximized by designs of order only logarithmic in the dimension of the system. In other words, logarithmic-designs already achieve the complexity of Haar in terms of entanglement, which we also call max-scrambling. This result leads to a generalization of the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom.