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

On quantum randomness and quantum resources

Zi-Wen Liu

Published Jan 1, 2018• 2 citations
OpenAlex

Abstract

This thesis is consisted of two independent parts. The first part is on entanglement, quantum randomness, and complexity beyond scrambling. More explicitly, we study the Rényi entanglement entropies of quantum designs. The results lay the mathematical foundation for studying the hierarchy of complexities in between scrambling and Haar randomness by entanglement. The second part explores the general aspects of quantum resource theory. We introduce three theories that do not rely on the specific resource: the theory of resource destroying maps, the one-shot operational resource theory, and the resource theory of quantum channels.

Related papers

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

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

Generalized Entanglement Entropies of Quantum Designs

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

The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This Letter investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Rényi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Rényi entanglement entropies and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Rényi entanglement entropies to the complexity of scrambling and quantum chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.

arXiv:1709.04313•Physical Review Letters•Mar 28, 2018•45 citations

Lecture Notes on Information Scrambling, Quantum Chaos, and Haar-Random States

Marcin Płodzień

Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution. The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.

quant-pharXiv:2511.14397•Nov 19, 2025•9 citations

Information-theoretic aspects of quantum channels

Elton Yechao Zhu

Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.

•Jan 1, 2019•0 citations

Entanglement complexity of quantum states, dynamics and quantum computation

Zhi-Cheng Yang

Quantum entanglement has become the key notion bridging originally distinct fields of research over the last decade, namely, quantum information and computation, condensed matter physics, and quantum gravity. Previous studies on quantum entanglement have largely focused on the entanglement entropy, which quantifies the amount of entanglement. However, a natural question arises: is there additional information of a quantum state that is not captured by the entanglement entropy alone? For ground states of gapped Hamiltonians, this question has been answered in the affirmative. In this dissertation, I extend this idea to study highly entangled states typically having volume law entropy, and demonstrate that there is indeed much richer information on the complexity of a quantum state beyond the entanglement entropy. \n \nIn the first part, I study the entanglement spectrum of highly entangled states corresponding to highly excited eigenstates of non-integrable Hamiltonians, time-evolved states after a quantum quench with Hamiltonians exhibiting different dynamical phases, and random unitary circuits consisting of random braids of non-Abelian anyons. I demonstrate that the entanglement spectrum is able to capture the degree of randomness of a quantum state, which we call the entanglement complexity. In the context of scrambling, this quantifies the degree of randomness produced by scrambling beyond entropic diagnostics. \n \nOur understanding of quantum entanglement in condensed matter systems and high energy physics have largely benefited from the field of quantum computation. In the second part of the dissertation, I present two examples of novel platforms for quantum computation using state-of-the-art experimental technologies. I demonstrate how one can use hybrid quantum-classical architecture to solve computational problems based on an optimal variational ansatz of the evolution protocol. I also present a hierarchical architecture of constructing logical Majorana zero modes which can be used for demonstrating non-Abelian braiding statistics experimentally.

•Jan 1, 2019•0 citations
This thesis is consisted of two independent parts. The first part is on entanglement, quantum randomness, and complexity beyond scrambling. More explicitly, we study the Rényi entanglement entropies of quantum designs. The results lay the mathematical foundation for studying the hierarchy of complexities in between scrambling and Haar randomness by entanglement. The second part explores the general aspects of quantum resource theory. We introduce three theories that do not rely on the specific resource: the theory of resource destroying maps, the one-shot operational resource theory, and the resource theory of quantum channels.
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].
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.
The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This Letter investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Rényi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Rényi entanglement entropies and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Rényi entanglement entropies to the complexity of scrambling and quantum chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.
Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution. The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.
Quantum information theory is an important element of quantum computing and quantum communication systems. Whenever a quantum computer needs to send an output state to another party, or two parties need to establish quantum entanglement or secure keys via quantum communication, a quantum channel is inevitably involved. Hence it is absolutely important to understand the properties of quantum channels for the purpose of communication. Here, quantum entanglement plays a huge role. Pre-shared entanglement could enhance the capacity, whereas entanglement across inputs could render the capacity formulae impossible to compute. The first part of this thesis seeks to address this issue, by studying the additivity properties in the communication of classical and quantum information, with or without entanglement assistance. I also study the reverse problem that, given a channel capacity, what can be said about the quantum channel itself. Quantum information theory also serves as an important tool in understanding other systems, for example, black holes. In this thesis, I model a closed random system by a unitary channel, and study how typical unitary channels process information. This provides huge insight into the strength of generalized entanglement measures, and the hierarchies in the complexity of information scrambling.
Quantum entanglement has become the key notion bridging originally distinct fields of research over the last decade, namely, quantum information and computation, condensed matter physics, and quantum gravity. Previous studies on quantum entanglement have largely focused on the entanglement entropy, which quantifies the amount of entanglement. However, a natural question arises: is there additional information of a quantum state that is not captured by the entanglement entropy alone? For ground states of gapped Hamiltonians, this question has been answered in the affirmative. In this dissertation, I extend this idea to study highly entangled states typically having volume law entropy, and demonstrate that there is indeed much richer information on the complexity of a quantum state beyond the entanglement entropy. \n \nIn the first part, I study the entanglement spectrum of highly entangled states corresponding to highly excited eigenstates of non-integrable Hamiltonians, time-evolved states after a quantum quench with Hamiltonians exhibiting different dynamical phases, and random unitary circuits consisting of random braids of non-Abelian anyons. I demonstrate that the entanglement spectrum is able to capture the degree of randomness of a quantum state, which we call the entanglement complexity. In the context of scrambling, this quantifies the degree of randomness produced by scrambling beyond entropic diagnostics. \n \nOur understanding of quantum entanglement in condensed matter systems and high energy physics have largely benefited from the field of quantum computation. In the second part of the dissertation, I present two examples of novel platforms for quantum computation using state-of-the-art experimental technologies. I demonstrate how one can use hybrid quantum-classical architecture to solve computational problems based on an optimal variational ansatz of the evolution protocol. I also present a hierarchical architecture of constructing logical Majorana zero modes which can be used for demonstrating non-Abelian braiding statistics experimentally.