Entanglement, quantum randomness, and complexity beyond scrambling

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].


Introduction
Scrambling describes a property of the dynamics of isolated quantum systems, in which initially localized quantum information spreads out over the whole system, thereby becoming inaccessible to local observers. The notion of scrambling originates from the study of black holes in quantum gravity [2][3][4]. The thermal nature of the Hawking radiation [5][6][7] indicates that the state of any matter and information falling into the black hole has been scrambled and so gets lost from the perspective of an external observer. In particular, the "fast scrambling conjecture" [3] states that the fastest scramblers take time logarithmic in the system size to scramble information, and that black holes are the fastest scramblers. Scrambling and similar notions play important roles in other areas of physics as well. For example, scrambling is closely related to many-body localization and quantum thermalization (see [8] for a recent review): quantum systems that exhibit localization clearly do not scramble or thermalize, since local quantum information may fail to spread, and so remains accessible to certain local measurements. By contrast, a many-body system that undergoes scrambling evolves to states that appear random with respect to local measurements: here, the notion of scrambling can be seen as a form of thermalization at infinite temperature. Quantum chaos is also a close relative of scrambling. Under chaotic dynamics, initially local operators grow to overlap with the whole system (the butterfly effect). That is, chaotic quantum systems are scramblers [9]. In particular, the behaviors of the so-called out-of-time-order (OTO) correlators can probe the growth of local perturbations.
This work is mainly motivated by two key features of scrambling. First, scrambling of quantum information and the growth of entanglement go hand in hand: information initially present in local perturbations ends up being irretrievable by local or simple measurements even though closed-system (unitary) evolutions do not actually erase any information, since it gets encoded in global entanglement. Entanglement captures the nonclassical essence of scrambling, and could be a natural and powerful probe of scrambling properties. Second, scrambling is intimately connected to the generation of randomness. Loosely speaking, scrambling and chaos describe the phenomenon that the system is effectively randomized. Indeed, the effects of information scrambling such as local indistinguishability [22] and the decay of OTO correlators [9] can be achieved by random dynamics given by a random unitary channel drawn from the group-invariant Haar measure. A key idea of the seminal Hayden-Preskill work [2] is to use random dynamics to model the scrambling behaviors of black holes. However, such observations are essentially one-way: scrambling do not necessarily imply full randomness. As we shall further clarify, there is in fact a large gap of complexity between information scrambling and complete randomness. The notion of "scrambling" needs to be refined since it can correspond to vastly different randomness complexities.
The major goal of this paper is to connect these two features and lay the mathematical foundations of diagnosing the randomness complexities associated with scrambling by entanglement. This is achieved by studying the interplay between the degrees of entanglement and quantum randomness. Note that studies along this line are also of great interest to many areas in quantum information. A basic result in this direction is that the expected entanglement entropy of a Haar random pure state is almost maximal, which is usually known as the Page's theorem [23][24][25][26]. However, this result is not tight in the sense that there is a large gap between the complexities of the Haar randomness and entanglement entropy conditions: the complexity of the Haar measure (given by e.g. the optimal depth of local circuits that approximate it) grows exponentially in the number of qubits [27], while the near-maximal entanglement entropy only needs finite moments of the Haar measure, which have only polynomial complexity and can be efficiently implemented [28][29][30][31]. This also illustrates the separation between the loss of local information or information scrambling and Haar randomness as large entanglement entropy indicates that local information is spread out (which will be discussed in more detail later). The regime in between information loss and complete randomness is not well understood in the contexts of both the dynamical behaviors of scrambling or chaos, and the kinematic entanglement properties.
To fill this gap, we consider more stringent entanglement measures and pseudorandom ensembles of quantum states and processes. In particular, we analyze the generalized entanglement entropies of pseudorandom ensembles of pure states and unitary channels known as designs, both parametrized by an order index. Generalized entanglement entropies of order α are entropic functions of the α-th power of the reduced density matrix. The higher the order of the generalized entropy, the more sensitive that entropy is to nonuniformity (such as sharp peaks) in the spectrum of the density matrix and so the JHEP07(2018)041 harder it is to maximize. (A particular family known as the Rényi entropy is most ideal for our purpose.) An α-design is an ensemble of pure states or unitary operators whose first α moments are indistinguishable from the Haar random states or unitaries. The higher the order of the design, the better it emulates the completely random Haar distribution. We establish a strong connection between the order of the generalized entanglement entropies and the order of designs, in both the random unitary channel and random state settings. (We note that a recent paper [18] establishes a related connection between 2αpoint OTO correlators and α-designs via frame potentials.) Our analysis indicates that α-designs induce almost maximal Rényi-α entanglement entropies, thereby tightening (in a complexity-theoretical sense) known results relating entanglement entropy and quantum randomness, such as Page's theorem for random states and similar results for random unitaries by Hosur/Qi/Roberts/Yoshida [9]. This result reveals a fine-grained hierarchy of randomness complexities between information and Haar scrambling defined relative to the moments of the Haar measure, and suggests Rényi entanglement entropies of the corresponding order as useful diagnostics. For example, if the Rényi-α entanglement entropy for some way of partitioning the system does not meet the maximality condition, then one can argue that the system has not reached the complexity of α-designs. Since our characterization of such complexities of designs rely on entropy, we also refer to the joint notions as "entropic scrambling/randomness complexities".
Interestingly, there cannot be infinitely many different orders of designs that can be separated by Rényi entanglement entropies. This is seen by analyzing the min entanglement entropy, i.e. the infinite order limit of Rényi entropy, which only depends on the largest eigenvalue and lower bounds all Rényi entropies. Large min entanglement entropy indicates that the entanglement spectrum is almost completely uniform, and therefore the local information is totally lost and the system looks completely random even if one has access to the whole reduced density matrix. That is, the system essentially becomes indistinguishable from being Haar random by entanglement. This corresponds to a strong form of information scrambling, which we call "max-scrambling". We show that the min entanglement entropy (and therefore all Rényi entanglement entropies) becomes almost maximal, for designs of an order that is only logarithmic in the dimension of the system. In terms of entanglement properties, there can be at most logarithmic "nontrivial" orders of designs or moments of the Haar measure. Designs of higher orders all behave like completely random and are essentially the same. This result leads to a strong estimate of the shortest maxscrambling time, which generalizes the fast scrambling conjecture, that max-scrambling can be achieved by physical dynamics in time roughly linear in the number of degrees of freedom. Now we summarize the mathematical techniques and results more specifically. We first focus on the intrinsic scrambling and randomness properties of physical processes, which are represented by unitary channels. We map unitary channels to a dual state via the Choi isomorphism, and study the entanglement associated with this dual state. As in [9], we partition the input register of the Choi state into two parts, A and B, and the output register into C and D. Our results rely on the calculation of average tr{ρ α AC }, the defining element of order-α entanglement entropies between AC and BD of the Choi JHEP07(2018)041 state. We mainly employ tools from combinatorics and Weingarten calculus to compute the Haar integrals of tr{ρ α AC } in various cases, which are equal to the average over unitary α-designs due to their defining properties. The convexity of Rényi entropies in the trace term allows us to use these results to lower bound the Rényi entanglement entropies by Jensen's inequality. The asymptotic result is that the Rényi-α entanglement entropies for equal partitions averaged over unitary α-designs are almost maximal, or more precisely, at most smaller than the maximal value by a constant that is independent of the dimension and the order. In other words, the difference is vanishingly small. This conclusion relies on a lemma on the number of cycles associated with permutations. In other words, a random unitary sampled from a unitary α-design is very likely to exhibit nearly maximal Rényi-α entanglement entropies, which supports the idea of using Rényi-α entanglement entropies as witnesses of the complexity of α-designs. For finite dimensions, we also derive explicit bounds on the α-design-averaged Rényi-α entanglement entropy using modern tools developed for Haar integrals. It is natural to ask how robust the above results are against small deviations from exact unitary designs. We derive error bounds for two common but slightly different ways to define approximate unitary designs. The extreme cases are actually quite interesting. In particular, we find that finite-order designs are sufficient to maximize the entanglement entropy given by the Rényi entropy of infinite order, namely the min entropy. As mentioned above, we show that, rather surprisingly, unitary designs of an order that scales logarithmically in the dimension of the unitary induce min entanglement entropy that is at most a constant away from the maximum, which implies that they are already indistinguishable from Haar by the entanglement spectrum alone.
Then we study the mathematically more straightforward and more well-known problem of entanglement in random states. The main results are very analogous to those in the random unitary setting, but the derivations are simpler since there are only two subsystems involved. Most importantly, we show that (projective) α-designs exhibit almost maximal Rényi-α entanglement entropies, which can be regarded as a collection of tight Page's theorems. And similarly, designs of logarithmic order maximize the min entanglement entropy. In addition, we are able to obtain the following separation result which is not there yet in the unitary setting. We show by representation theory that there exist 2designs whose Rényi entanglement entropies of higher orders are bounded away from the maximum. The existence of such 2-designs can be regarded as the indicator of a separation between the complexity of 2-designs and those of higher orders as diagnosed by Rényi entanglement entropies. The paper also includes several other results related to e.g. Rényi entropies, designs, and Weingarten calculus, which may be of independent interest. These mathematical results may find applications in many other relevant areas, such as quantum cryptography and quantum computing.
The paper is organized as follows. In section 2, we formally define the central concepts of this paper -the generalized quantum entropies, and projective and unitary designs. In sections 3 and 4, we study the Choi model of unitary channels and pure states respectively. We conclude in section 5 with open problems and some discussions on the connections and possible extensions of our results to several other topics. The appendix contains several peripheral results and technical tools. See e.g. [32] for a comprehensive introduction of JHEP07(2018)041 standard and soft notations of asymptotics (e.g. big-O and soft big-O) that will be used throughout this paper. This paper provides the technical details of the results in [1].

Preliminaries
The theme of this paper is to establish connections between generalized quantum entropies and quantum designs, which we shall formally introduce in this section.

Definitions of unified and Rényi entropies
Some parametrized generalizations of the Shannon and von Neumann entropy, most importantly the Rényi and Tsallis entropies, are found to be useful in both classical and quantum regimes. Here we focus on the entropies defined on a quantum state represented by density matrix ρ living in a finite-dimensional Hilbert space. A unified definition of generalized quantum entropies is given in [33,34]: Definition 1 (Quantum unified entropies). The quantum unified (α, s)-entropy of a density matrix ρ is defined as The two parameters α and s are respectively referred to as the order and the family of an entropy. In this paper, we mostly care about the cases where α is a positive integer and s is a nonnegative integer.
The tr{ρ α } element plays a key role in this paper. Entropies specified by a certain order α are collectively called α entropies. The α → 1 limit gives the von Neumann entropy. By fixing s, one obtains a family of entropies parametrized by order α. We define the following function to be the characteristic function of an entropy: which is obtained by treating tr{ρ α } as the argument x. The convexity of characteristic functions is important to many of our results. The most representative families of quantum entropies are Rényi (the limiting case s → 0) and Tsallis (s = 1) entropies. In this work, we shall mostly focus on the Rényi entropies: Definition 2 (Quantum Rényi entropies). The quantum Rényi-α entropy of a density matrix ρ is defined as R is singular and defined by taking a limit. S  Definition 3 (Quantum min entropy). The quantum min entropy of a density matrix ρ is defined as where ρ denotes the operator norm of ρ, and λ max (ρ) is the largest eigenvalue of ρ.
Other Rényi entropies are well defined by eq. (2.3). The α = 2 case S R (ρ) = − log tr{ρ 2 }, also called the second Rényi entropy or collision entropy for classical probability distributions, is also a widely used and highly relevant quantity. In the context of scrambling, a key result of [9] is that the Rényi-2 entanglement entropy is directly related to the 4-point OTO correlators, which has become a widely concerned quantity in recent years as a probe of chaos. Also notice that S (2) R is directly related to the quantum purity tr{ρ 2 } (recall that less pure subsystems dictate entanglement), and is thus frequently employed in the study of entanglement [35,36]. Figure 1 summarizes the important generalized entropies in the relevant regime.

Important features of Rényi entropies
We are particularly interested in the family of Rényi entropies since they have several desirable features that play important roles in our arguments throughout.
The following properties of each Rényi entropy are important for our purposes: 1. They have the same maximal value n for systems of n qubits (attained by the uniform spectrum). This allows meaningful comparisons with the maximal value and between different orders; 2. They are additive on product states, i.e., S (α) R (σ) for all α and density matrices ρ, σ. Otherwise it is not natural to define extensive quantities such as mutual information and tripartite information; This  allows us to use Jensen's inequality to lower bound the design-averaged values by  Haar integrals. These properties are all straightforward to verify. These properties do not simultaneously hold for other families. For example, it is easy to see that the first two fail for Tsallis entropies. Later we shall further explain why these properties are desirable in explicit contexts. However, we note that the calculations are essentially only about the trace term, so it is straightforward to obtain results for all families if one wishes.
In this work, we are particularly interested in the regimes where certain Rényi entropies are nearly maximal. The following "cutoff" phenomenon concerning the maximality is an important foundation of our scheme of characterizing the complexity of scrambling by Rényi entropies. First, notice that the unified entropy of a certain family, such as the Rényi entropy, is monotonically nonincreasing in the order: S (In particular, the min entropy sets a lower bound on all Rényi entropies: S min ≤ S (α) R for all α.) So if the Rényi entropy of some order is almost maximal, then those of lower orders are all almost maximal. Moreover, asymptotically, the values of Rényi entropies of different orders can be well separated, and for each order there exist inputs that attain almost maximal Rényi entropy of this order but those of all higher orders are small. As will become clearer later, this allows for the possibility of distinguishing between different complexities by the asymptotic maximality of Rényi entropies of certain orders. This feature can be illustrated by the following simple example. Given some orderα. Consider a density operator in the d-dimensional Hilbert space which has one large eigenvalue 1/dα −1 α , and the rest of the spectrum is uniform/degenerate. That is, the spectrum reads (2.5) The Rényi-α entropy (and thus all lower orders) is insensitive to this single peak: which is Θ(log d) (linear in the number of qubits) smaller than the maximal value log d. In fact, λ produces Θ(log d) gaps between all higher orders. The extreme case min entropy only cares about the largest eigenvalue by definition: which is small for all finiteα. That is, the slope of S (β) R (λ) in log d decreases with β. It equals one for β =α, and approachesα −1 α in the β → ∞ limit. So there can be an asymptotic separation between Rényi entropies of any orders. The intuition is simply that promoting the power of eigenvalues essentially amplifies the nonuniformity of the spectrum. We shall construct a similar separation for certain 2-designs, which indicates that Rényi entropies can distinguish low-degree pseudorandom states from truly random states.
In our calculations we often assume equal partitions for simplicity. Since the subsystems contain half the total degrees of freedom, the equal partitions admit the largest possible entanglement entropy. Also, the following simple argument ensures that as long as the (Rényi) entanglement entropies between all equal partitions are close to the maximum, then that between generic partitions must be close to the maximum as well. Notice that the quantum Rényi divergence/relative entropy (either the non-sandwiched or sandwiched/non-commutative version, see e.g. [37] for definitions) between ρ and the maximally mixed state yields the gap between the Rényi entropy of ρ and the maximum: For sandwiched Rényi divergence with α ≥ 1/2 (which covers the parameter range of interest in this paper), it is shown in [38,39] that the data processing inequality holds, which implies that the divergence is monotonically nonincreasing under partial trace. So the gap can only be smaller when we look at smaller subsystems.
In the appendix, we derive more properties of Rényi entropies, including inequalities relating different orders of Rényi entropies (appendix A), and a weaker form of subadditivity (appendix B). The above discussions on Rényi entropies are more or less tailored to our needs. We refer the interested readers to [37] for a more comprehensive discussion of the motivations and properties of quantum Rényi entropies and divergences. We also note that a close variant of the quantum Rényi entropy known as the "modular entropy", given bỹ S (α) R (ρ)), is found to be meaningful in the context of holography and admits a natural thermodynamic interpretation [40,41].

Designs
In quantum information theory, the notion of t-designs characterizes distributions of pure states or unitary channels that mimic the uniform distribution up to the first t moments,

JHEP07(2018)041
and so can be considered as good approximations to Haar randomness. Analogous classical notions such as t-wise independence and t-universal hash functions are also found to be very useful in computer science and combinatorics. We shall formally introduce the definitions of state and unitary designs relevant to this work in the following.

Complex projective designs
Complex projective t-designs, which we may call "t-designs" for short throughout the paper, are distributions of vectors on the complex unit sphere that are good approximations to the uniform distribution, or pseudorandom, in the sense that they reproduce the first t moments of the uniform distribution [42][43][44]. They are of interest in many research areas, such as approximation theory, experimental designs, signal processing, and quantum information. There are many equivalent definitions of exact designs (see [44] for an introduction). Here we mention a few that are directly relevant to the current study.
The canonical definition based on polynomials of vector entries will be directly used in deriving our results. Define Hom (t,t) (C d ) as the space of polynomials homogeneous of degree t both in the coordinates of vectors in C d and in their complex conjugates.

Definition 4 (t-designs by polynomials). An ensemble ν of pure state vectors in dimension
where the integral is taken with respect to the (normalized) uniform measure on the complex unit sphere in C d .
The second definition, based on the frame operator, is also widely used. Let Sym t (C d ) be the t-partite symmetric subspace of (C d ) ⊗t with corresponding projector P [t] . The dimension of Sym t (C d ) reads Definition 5 (t-designs by frame). The t-th frame operator of ν is defined as 14) and the t-th frame potential is The ensemble ν is a t-design if and only if F t (ν) = P [t] or, equivalently, if Φ t (ν) = D [t] [44].
The above definitions for exact designs are equivalent. However, they lead to slightly different ways to define approximate designs by directly considering the deviations from equality, which essentially represent different norms. We shall discuss the approximate designs in more detail later for error analysis.

Unitary designs
In analogy to complex projective t-designs, unitary t-designs are distributions on the unitary group that are good approximations to the Haar measure, in the sense that they reproduce the Haar measure up to the first t moments [44][45][46][47][48]. They also play key roles in many research areas, such as randomized benchmarking, data hiding, and decoupling. As in the case of state designs there are also many equivalent definitions of exact unitary designs (see [44]). Similarly, we formally define unitary designs by polynomials and frame operators/potentials. Let Hom (t,t) (U(d)) be the space of polynomials homogeneous of degree t both in the matrix elements of U ∈ U(d) and in their complex conjugates.
where the integral is taken over the normalized Haar measure on U(d).
Definition 7 (Unitary t-designs by frame). The t-th frame operator of ν is defined as 17) and the t-th frame potential is is the tth frame operator of the unitary group U(d) with Haar measure [44]. In addition, 19) and the lower bound is saturated if and only if ν is a unitary t-design [44,48,49]. When t ≤ d, which is the case we are mostly interested in, Again, the definitions are equivalent for exact unitary designs, but lead to different ways to define approximate unitary designs, which we shall look into later.

Generalized entanglement entropies and random unitary channels
Unitary channels describe the evolutions of closed quantum systems. Here we study the entanglement and scrambling properties of random unitary channels, which directly motivates this work. As suggested by [9], we employ the Choi isomorphism to map a unitary channel to a dual state, and study scrambling by the relevant entanglement properties of this state. In this section, we first briefly introduce the Choi state model, and then present the explicit calculations of generalized entanglement entropies averaged over unitary designs. The results lead to an entropic notion of scrambling or randomness complexities, which we shall discuss in depth.

Model: entanglement in the Choi state
Ref. [9] proposed that one can use the negativity of the tripartite information associated with the Choi state of a unitary channel to probe information scrambling. The negative tripartite information is actually a measure of global entanglement that quantifies the degree to which local information in the input to the channel becomes non-local in the output. We first introduce the definitions and motivations of this formalism to set the stage.
The Choi isomorphism (more generally, the channel-state duality) is widely used in quantum information theory to study quantum channels as states. It says that a unitary operator U acting on a d-dimensional is the mutual information, which measures the total correlation between A and C. Since the input and output are maximally mixed due to unitarity, the four subregions are all maximally mixed. For example, here I(A : C) is reduced to log d A d C − S(AC), so we only need to analyze the entanglement entropy S(AC). Note that −I 3 can be reduced to the conditional mutual information I(A : B|C) [50], which is a quantity of great interest in quantum information theory. The Haar-averaged (completely random) values of the terms in the von Neumann −I 3 was computed in [9], as a baseline for scrambling. However, it is clear that a pseudorandom ensemble (such as 2-designs) can already reach these roof values [18], which indicates that information scrambling only corresponds to randomness of low complexity in contrast to Haar. We are going to generalize the above quantities in the Choi state model using generalized entropies S (α) s . Since the maximally mixed states have maximal generalized entropies, we only need to analyze S (α) s (AC).

Relevant reduced density matrices of the Choi state
To calculate the generalized entanglement entropies, we first need to derive the moments of the reduced density matrix of AC and the expression for their traces.

JHEP07(2018)041
By using individual indices for different subregions, we rewrite the Choi state in eq. (3.1) as where k, l, m, o are respectively indices for A, B, C, D. The corresponding density matrix is then By tracing out BD, we obtain the reduced density matrix of AC: The entropy of ρ AC measures the entanglement between AC and BD. In order to compute the generalized α entanglement entropies, we need to raise ρ AC to the power α: (3.7) This result can also take more concise operator forms: where Γ even denotes partial transpose on even parties.
Other density matrices can be derived in a similar way. Again note that the input and output are maximally entangled due to unitarity, so all four individual subregions are maximally mixed.

General trace formula
We first employ tools from random matrix theory, combinatorics, and in particular Weingarten calculus, to compute the Haar integrals of the trace term in generalized entanglement entropies.
It is known that the Haar-averaged value of each monomial of degree α can be written in the following form [51]: (3.11) where S α is the symmetric group of α symbols, and are called Weingarten functions of U(d). Here λ α means λ is a partition of α, χ λ is the corresponding character of S α , and s λ is the corresponding Schur function/polynomial. Notice that s λ,d (1, · · · , 1) is simply the dimension of the irrep of U(d) associated with λ. The Weingarten function can be derived by various tools in representation theory, such as Schur-Weyl duality [52,53] and Jucys-Murphy elements [54]. Therefore, we obtain the following general result: where ξ(σ) is the number of disjoint cycles associated with σ, 1 and τ := (1 2 · · · α) is the 1-shift (canonical full cycle).
One can easily recover the α = 2 results given in [9] from eq. (3.14) as follows. The Weingarten functions for σ ∈ S 2 are 1 Every element of the symmetric group can be uniquely decomposed into a product of disjoint cycles (up to relabeling).

Large d limit asymptotics
We now analyze the asymptotic behaviors of generalized entanglement entropies in the d → ∞ limit to provide a big picture. Later we shall introduce some non-asymptotic bounds that hold for general d. To simplify the analysis, we consider equal partitions Trace. We first introduce a series of useful combinatorics lemmas, which play critical roles in the behavior of generalized entanglement entropies (in particular Rényi). These results are known in the contexts of random matrix theory and free probability theory. We refer the readers to [55] (cf. references therein) for a summary of related results or [56] for a textbook on the subject.
This result can be obtained by combining Lemmas A.1 and A.4 of [55]. See appendix C for our proof by induction.

JHEP07(2018)041
This result follows from Lemmas A.4 and A.5 of [55]. Such permutations lie on the geodesic from identity to τ . The above lemmas guarantee that the gap between the Haaraveraged Rényi entropies and the maximum value is independent of the system size, as will become clear shortly. We note that Catalan numbers frequently occur in counting problems. The first few Catalan numbers are 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, · · · . Some useful bounds on the Catalan numbers are derived in appendix D.
We also need the large d asymptotic behaviors of the Weingarten function: Lemma 5 (Asymptotics of Wg [52,57]). Given σ ∈ S α with cycle decomposition σ = C 1 · · · C k . Let |σ| be the minimal number of factors needed to write σ as a product of transpositions. The Möbius function of σ is defined by where Cat n is the n-th Catalan number (defined in Lemma 3). (Note that |C i | here is often replaced by |C i | − 1 in literature, where | · | means the length of the cycle.) Then, in the large d limit, the Weingarten function has the asymptotic behavior Corollary 6. We mainly need to distinguish the following two cases: • σ = I: |σ| = 0 and Moeb(σ) = 1, thus Wg(d, Some bounds on the Möbius function are derived in appendix E. Now we are equipped to derive the asymptotic behaviors of the Haar-averaged traces, dU tr {ρ α AC }:

JHEP07(2018)041
Proof. Starting from eq. (3.14), Theorem 1 where the second line follows from the equal bipartition assumption, the third line follows from Lemma 5 and Corollary 6, and the fourth line follows from Lemmas 2, 3 and some simple scaling analysis. Similarly, the asymptotic behavior of dU (tr {ρ α AC }) s follows from Corollary 4.
s > 0 entropies. The calculations of s > 0 entropies (e.g. Tsallis) are straightforward, since the term (tr{ρ α }) s linearly appears in the definition. By Theorem 7, for positive integers α, s: (3.27) Notice that the maximum value of S (α) s for a d-dimensional state is (achieved by the maximally mixed state I/d) So we see a gap between the Haar-averaged and the maximal value: which is vanishingly small in d.
As mentioned above, s > 0 entropies are less ideal than Rényi entropies for our study since they do not exhibit the three nice properties. Here we elaborate on the resulting problems one by one: 1. We see from eq. (3.28) that the roof (maximally mixed) values of s > 0 entropies vary with the order α. Therefore, it does not make much sense to compare s > 0 entropies of different orders α or with the roof value, on which our entropic characterization of scrambling and randomness complexities and several other arguments rely.

JHEP07(2018)041
2. The s > 0 entropies are not even additive on maximally mixed states. So the derived quantities of mutual information and tripartite information in terms of s > 0 entropies do not make good sense. Recall that all partitions are in the maximally mixed state I/ √ d. However, the generalized mutual information dU I (α) 3. The characteristic function for s ≥ 1 entropies are not convex (linear for Tsallis). Although Theorem 7 enables us to directly calculate the Haar-averaged s > 1 entanglement entropies, the nonconvexity prevents us from using Jensen's inequality to lower bound their design-averaged values.
Rényi entropy. Now we analyze the behaviors of the Rényi entropies, the s → 0 limit. Compared to s > 0 entropies, the calculations of Rényi are trickier because of the logarithm, which nevertheless directly leads to the desirable properties -constant roof value, additivity, and convexity. We are able to establish the following result: is the characteristic function. Since

JHEP07(2018)041
by Jensen's inequality. We note that this Jensen's lower bound due to convexity (E f R ≥ f R E) will be repeatedly used to establish bounds for Rényi entropies. Then according to eq. (3.21), Notice that the Cycle Lemma guarantees that the leading correction term (the second term) is independent of d asymptotically. In fact In conclusion, in the limit of large d, we have So the gap between the Haar-averaged and maximal value of S R (the "residual entropy") is∆ That is, the average Rényi entanglement entropies of the Haar measure are only bounded by a constant from the maximum. Recall the discussion in section 2.1.2: this O(1) gap holds for non-equal partitions as well. The result implies that a Haar random unitary typically has almost maximal Rényi entanglement entropies for any partition. Rigorous probabilistic arguments require more careful analysis using concentration inequalities, which we leave for future work. Now consider the Rényi mutual information and tripartite information based on the entanglement entropy results. First, we can directly obtain dU I (α) R by additivity. The results hold similarly for AD. That is, the Rényi mutual information between any two local regions of the input and output is vanishingly small compared to the system size. On the other hand, for any partition size, notice that

JHEP07(2018)041
where the second line follows from S (α) R (B) since the whole Choi state is pure, the third line follows from the fact that the three subregions involved are maximally mixed, and the fourth line follows from that d A d B = d. Under the equal partition assumption, I (α) R (A : CD) = log d. This is consistent with the fact that all information of A is kept in the whole output CD because of unitarity. As a result: (3.46) by plugging in all relevant terms. So the negative Rényi tripartite information of Haar scrambling is indeed close to the maximum. However, we note that the Rényi-α entropy is not subadditive except for α = 1, thus −I 3 is not necessarily nonnegative. A weaker form of subadditivity of Rényi entropies is given in appendix B.

Non-asymptotic bounds
Here we prove some explicit bounds on the Haar-averaged trace, Rényi entropies, and in particular the min entropy, in the non-asymptotic regime. These bounds sharpen the asymptotic results. Many useful lemmas are proved in the appendices.
Trace and Rényi entropies. We directly put the results of trace and Rényi entropies together. We need the following refined cycle lemma: Proof. Define c δ,α as the number of permutations in S α with genus δ, that is, Note that c 0,α is the Catalan number Cat α by Lemma 3. Then according to Lemma 39 in appendix G. As a consequence of this inequality and the as- where the last inequality follows from Lemma 29 in appendix D, which sets an upper bound on the Catalan numbers.

JHEP07(2018)041
In the following we still assume equal partitions so that d AC = d for simplicity. Recall that for generic partitions the residual entropy cannot be larger anyway. By Lemma 9, we can obtain the following non-asymptotic bounds for the Haar integrals of traces and Rényi entanglement entropies: where a α := Proof. By eq. (3.14) (Theorem 1): where A α is the set of even permutations, i.e. the alternating group. The first inequality follows from the fact that Wg(d, ζ) is negative when ζ is an odd permutation, the second inequality follows from the Cauchy-Schwarz inequality, noting that γ∈Sα d ξ(ζγτ )+ξ(ζγ) = γ∈Sα d ξ(γτ )+ξ(γ) , the third inequality follows from Lemma 9, and the last inequality follows from Lemma 35 in appendix F. By plugging eq. (3.58) into eq. (3.14), we immediately obtain the trace result eq. (3.51). The Rényi result eq. (3.52) then follows from Jensen's inequality.
We see that the leading terms indeed match the asymptotic results. The overall observation is similar: the Haar integrals of Rényi entanglement entropies are very close to the maximum for sufficiently large d.

JHEP07(2018)041
To gain intuition, we compute dU tr{ρ α AC } for α = 2, 3 based on the explicit formulas for Weingarten functions. When σ ∈ S 2 , Min entropy. The results so far only directly apply to positive integer α. The min entanglement entropy, which corresponds to the special limit α → ∞, plays a crucial role in our framework of scrambling complexities. Now we examine the Haar integral of the min entanglement entropy.

64)
where m d := min{7, 4(8 Proof. Suppose d ≤ 70. Then we have so that Consequently, − log. We note that slightly lower m d can in principle be obtained by computing to higher orders in eq. (3.65), which is nevertheless not important for the main idea.
As d gets large, m d approaches the limit 4, and log m d approaches the limit 2. As an implication of Lemma 28 in appendix B, Theorem 11 with d replaced by d AC also holds when the four subregions have different dimensions, as long as d A , d C ≤ √ d and d AC ≤ d. The same remark also applies to Theorem 17 below.
Note that the above results essentially confirm the conjecture in [58] that a Haar random unitary U and its reshuffled matrix U R are asymptotically free, and the conjecture in [59] (based on extensive numerical evidence) that U R converges to the Ginibre ensemble (of random non-Hermitian matrices) so that their moments will be asymptotically given by the Catalan numbers and the distribution of their spectra will be described by the famous Marchenko-Pastur distribution.

Average over unitary designs
Now we state a key observation: the Haar integral of tr{ρ α AC }, the defining term of α entropies, only uses the first α moments of the Haar measure. In other words, pseudorandom unitary α-designs are indistinguishable from Haar random by tr{ρ α AC }. More explicitly, let ν α be a unitary α-design ensemble, then we have by definition. Therefore, all Haar integrals of tr{ρ α AC } from section 3.3 (those derived from eqs. (3.14) and (3.21)) directly carry over to α-designs.
This observation is the essential basis for the order correspondence results and in turn the idea that α entropies can generically diagnose whether a scrambler is locally indistinguishable from random dynamics as powerful as α-designs. The Haar-averaged Tsallis-α entropies (s = 1) are exactly saturated by α-designs due to the linearity in tr{ρ α }. However, as mentioned, we cannot make analogous arguments for s > 1: the exact saturation requires f s and the Haar integral to commute asymptotically, which is not known to hold; and the lower bound following from Jensen's inequality does not hold since f s>1 becomes concave. In contrast, the Rényi entropies can be lower bounded because of the convexity. Due to the importance of the Rényi entropies, we state this result as a theorem:
72) where the inequality follows from Jensen's inequality, and the last equality follows from the fact that ν α is an α-design.
The lemma enables us to use the Haar integrals of traces to lower bound the designaveraged Rényi entanglement entropies in all dimensions. By combining this lemma and Theorem 7, we directly see that the O(1) upper bound on the residual Rényi-α entropy still holds: Theorem 13. In the large d limit, This is a key result of this work. We conclude that Rényi-α entanglement entropies are very likely to be almost maximal when sampling from unitary α-designs, as well as from the Haar measure. This result establishes the correspondence between the order of Rényi entropy and the order of designs, and lays the basis for the notion of entropic scrambling complexities. The non-asymptotic bound in Theorem 10 carries over in a similar fashion: where a α := Later we analyze the min entanglement entropy of designs in particular, which leads to another main result.

Error analysis: approximate unitary designs
The above analysis is based on exact unitary designs, but in most contexts we need to deal with the approximate versions of them. How robust or sensitive are these results under small deviations from exact unitary designs? One would expect ensembles that are very close to exact unitary α-designs to maintain near-maximal Rényi-α entanglement entropies. A subtlety is that different ways of measuring the deviation may lead to inequivalent definitions of approximate unitary designs, in contrast to the exact case. Here we discuss the deviation bounds for two commonly used definitions of approximate unitary designs, based on polynomials and frame operators respectively. This error analysis will be directly useful for e.g. relating the entropic scrambling complexities to circuit depth.
First, the canonical definition of unitary designs by polynomials leads to the following measure of deviation:

JHEP07(2018)041
Definition 8 (m-approximate unitary designs [29]). An ensemble ν is an -m-approximate unitary t-design ("m" represents monomial) if where q (k) (U ) = U i 1 j 1 · · · U i k j k U * m 1 n 1 · · · U * m k n k is a monomial of degree k both in the entries of U and in their complex conjugates.
Note that the bound is on each monomial with unit constant factor, otherwise the difference can be arbitrarily amplified by including more terms or changing the constant.
by triangle inequality, since tr {ρ α AC } is the sum of d 2α monomials according to eq. (3.7). Then where the first inequality follows from Jensen's inequality, and the second inequality follows from eq. (3.79) and the fact that − log is monotonically decreasing. We can then use the dU tr {ρ α AC } results to analyze the perturbation. Most importantly, in the large d limit, where the second line follows from eq. (3.26) and the following analysis, and the third line follows from the inequality that ln(1 + x) ≤ x when x > −1. Then we directly obtain eq. (3.78), which says that the error in S (α)

JHEP07(2018)041
Recall the other definition of exact designs by frame operators. The deviation of an ensemble from a unitary t-design can also be quantified by a suitable norm of the deviation operator ∆ t (ν) : The operator norm and trace norm of ∆ t (ν) are two common figures of merit. The latter choice is more convenient for the current study: Definition 9 (FO-approximate unitary designs). Ensemble ν is a λ-FO-approximate unitary t-design (FO represents frame operator) if Note that this definition is very similar to the quantum tensor product expander (TPE) [61]. TPEs conventionally use the operator norm, and the deviation operators relate to each other by partial transposes (like operators X, Y in eqs. (3.9), (3.10)).
Here we can directly use the operator form of local density operators derived earlier to do an error analysis of FO-approximate unitary designs. Let ω α be a λ-FO-approximate unitary α-design. We define∆ α , and explicitly write out ∆ α : (3.89) In the large d limit, Proof.
where the first inequality follows from Hölder's inequality, and the second line follows from the unitarity of Y α defined by eq. (3.10). The large d limit calculation simply resembles the above.
The essential difference between the m-and FO-approximate unitary designs is that the deviation is measured by different norms [31]. Letting , λ = 0 recovers equivalent definitions of exact designs. However, we can see from the asymptotic error bounds that JHEP07(2018)041 they pose constraints of different strengths. The -m-approximation condition is quite loose, in the sense that the deviation needs to be vanishingly small to guarantee that the residual entropy remains small. Or one could say that the Rényi entanglement entropy results can be very sensitive to this type of error. In contrast, the λ-FO-approximation condition is more stringent and suitable: the residual entropy remains O(1) as long as λ ≤ O(d), which implies that the FO-approximation may be a more suitable scheme.

Scrambling complexities by Rényi entanglement entropy
As motivated in the introduction, we expect that there is a hierarchy of scrambling complexities that lie in between information scramblers and Haar random unitaries, with different levels of the hierarchy indexed by the order of unitary designs needed to mimic the scrambler. Our results in the above link the randomness complexity of designs and the maximality of Rényi entanglement entropies of the corresponding order. This suggests that we can use the generic maximality of Rényi-α entanglement entropy as i) a necessary indicator of the resemblance to an α-design, and ii) a diagnostic of the entanglement complexity of α-designs, or "α-scrambling". The basic logic is that if a supposedly random unitary dynamics does not produce nearly maximal Rényi-α entanglement entropy in all valid partitions, as α-designs must do, then it is simply not close to any unitary α-design. This strategy is not directly relevant to testing designs at the global level, but it can probe the typical behaviors of entanglement between local regions of designs. Recall that Rényi entropy is monotonically nonincreasing in the order, and all orders share the same roof value. So α-scrambling necessarily implies α -scrambling, for α ≥ α . In scrambling dynamics, the Rényi-α entanglement entropy is expected to grow slower and saturate the maximum at a later time than Rényi-α in general.

Extreme orders: min-and max-scrambling
Now we discuss the 1-and ∞-scrambling more carefully, which respectively correspond to the weakest and strongest entropic scrambling complexities, given by the low and high ends of Rényi entropies.
Recall that α → 1 gives the von Neumann entropy, which probes information scrambling. First notice that unitary 1-designs do not necessarily create nontrivial entanglement or scramble quantum information. For example, the ensemble of tensor product of Pauli operators acting on each qubit forms a unitary 1-design [18]. However, this local Pauli ensemble clearly does not scramble in any sense, since it cannot create entanglement among qubits (so local operators do not grow). So any entanglement entropy will be zero. On the other hand, unitary 2-designs are sufficient to maximize Rényi-2 entropies, which lower bounds the corresponding von Neumann entropies. It is shown in [50] that there actually exists a clear gap between them. So information scrambling is strictly weaker than 2-scrambling, but on the other

JHEP07(2018)041
hand strictly stronger than 1-designs. More precise characterizations may depend on the specific signatures of min-scrambling one is using, and require more careful analysis of designs and generalized entropies in the non-integer order regime, which remains largely unclear and is left for future work. The other end of the spectrum is α → ∞, which leads to the min entropy S min (ρ) = − log ρ = − log λ max (ρ). Large min entanglement entropy directly indicates that the spectrum of the reduced density matrix is almost completely uniform, since it only cares about the largest eigenvalue. As the example of λ in section 2.1 shows, the min entropy is extremely sensitive to even one small peak in the entanglement spectrum. So it can be regarded as the "harshest" entropy measure and the strongest entropic diagnostic of scrambling: if the min entanglement entropy is almost maximal, then the system must be very close to maximally entangled in any sense and we cannot effectively distinguish the scrambler from Haar random by any Rényi entanglement entropy. This corresponds to the highest entropic scrambling complexity in our framework and thus we call this "maxscrambling". We shall see in a moment that designs of sufficiently high orders are simply indistinguishable from the Haar measure (also in the random state setting) by studying the min entanglement entropy of designs, which implies that max-scrambling is not an infinitely strong condition.

Nontrivial moments and fast max-scrambling
Given the definition of max-scrambling by the min entanglement entropy, one may wonder if the full Haar measure is needed to achieve this strongest form of entropic scrambling.
Here we answer this question in the negative: for a given dimension, only a finite number of moments (which scales logarithmically in the dimension) are needed to maximize the min entanglement entropy, which we call nontrivial moments.
First we note that the same Haar-averaged min entanglement entropy results in Theorem 11 hold if the average is taken over a unitary α-design with α ≥ √ d/2 . The conclusion is clear from the proof when d ≥ 50. When 17 ≤ d ≤ 49, √ d/2 ≥ 3, so the conclusion also follows from the proof. The conclusion is obvious when d ≤ 7. It remains to consider the case 8 ≤ d ≤ 16, which means √ d/2 = 2. Therefore, eq. (3.61) applies, so that

JHEP07(2018)041
In particular, if α ≥ log d , then Proof. If 1 ≤ α = log d/a ≤ √ d/2, then one can show that eq. (3.68) holds as in the proof of Theorem 11 even without additional restrictions. Therefore, This result is crucial to the understanding and characterization of max-scrambling. In particular, the observation that log-designs can already achieve max-scrambling leads to an interesting argument about max-scrambling in physical dynamics. The studies of the dynamical scrambling behaviors of physical systems primarily care about the amount of time needed for the system to scramble under certain constraints. The fast scrambling conjecture [3] is the standard general argument about the limitation on this scrambling time, roughly saying that the fastest min-scramblers take O(log n) time, where n ∼ log d is the number of degrees of freedom (and black holes, as in reason the most complex physical system and the fastest quantum information processor in nature, should achieve this bound).
Here we may ask similar questions for the complexities beyond min-scrambling: how fast can physical dynamics achieve certain scrambling complexities, in particular, maxscrambling? To make the assumption of "physical" more explicit, one typically requires the Hamiltonian governing the evolution to be local (meaning that each interaction term involves at most a finite number of degrees of freedom) and time-independent. Ref. [31] introduces the notion of design Hamiltonian, and conjectures that there are physical Hamiltonians that approximate unitary α-designs in time that scales roughly as O(α log n). Note that the approximation scheme and error dependence will be important in translating it to the language of scrambling complexities. For example, for m-approximation error , an ω(log log(1/ )) dependence is sufficient to dominate log n by the previous error analysis. Based on the above nontrivial moments result and the design Hamiltonian conjecture, the fastest max-scrambling time scales roughly as O(n log n). To absorb the non-primary effects, we state the conjecture using soft notations (absorbing polylogarithmic factors) as follows: Conjecture 1 (Fast max-scrambling conjecture). Max-scrambling can be achieved by physical dynamics inÕ(n) time, i.e. in time roughly linear in the number of degrees of freedom.

JHEP07(2018)041
To better formalize and study this fast max-scrambling conjecture, it would be important to further investigate the error dependency. Fast scrambling is an active research topic that has led to many key developments in quantum gravity and quantum many-body physics in recent years, such as the SYK model [62][63][64]. It could be interesting to generalize the studies about fast scrambling to this strong notion of max-scrambling.

On the gaps between entropic scrambling complexities
A further question then arises as to whether the entropic scrambling complexities form a strict hierarchy, i.e., whether different complexities are gapped.
A straightforward but strong definition of a separation between α-and α -scrambling (α < α) is the following: there exist scramblers such that the associated Rényi-α entropies are always near maximal, but some Rényi-α entropies can be bounded away from maximal. Such separations are in principle possible according to the properties of Rényi entropies (recall λ). However, by the nontrivial moments result, we already know that O(log d) and higher complexities are not truly separated.
We tried several approaches to establish general separations in the Choi model, with limited success. In particular, we attempted to generalize the partially scrambling unitary model [50], and attempted to extend the gap results in the random state setting (next section) to random unitaries. The partially scrambling unitary model is used in [50] to prove a large separation between von Neumann and Rényi-2 tripartite information in the Choi state setting. By contrast, as we analyze in appendix H, this model is not likely to provide similar separations among generalized entropies. The analysis nevertheless reveals a rather interesting tradeoff between sensitivity and robustness between Rényi and s > 0 entropies. However, we are able to establish gaps using projective designs in the random state setting (see next section), but the results cannot be directly generalized to unitary designs. The reasons will be explained in more detail in the next section. We leave the gap problem in the Choi model open for the moment. We note, however, that the absence of strict separations of this type is not indicating that the behaviors of Rényi entropies (of sublogarithmic orders) are not separated in physical scenarios. We may still expect, for example, that the higher orders grow slower than lower orders, so that they still separate different complexities.

Relating to other complexities
It would be interesting to relate the entropic scrambling complexities to other traditional types of complexities, such as circuit complexity. For example, consider the local random circuit model. It is shown in [28,29] that O(α 9 n[αn + log(1/ )]) Haar random local gates are sufficient to form an -m-approximate α-design of n qubits. By the error analysis result, one can easily see that the minimum number of gates/circuit depth needed to maximize Rényi-α entropies scales polynomially in α and n: let = 2 −3αn so that log(1/ ) = 3αn, then the number of gates scales as O(α 10 n 2 ), but meanwhile the deviation is sufficiently small such that the error in S (α) R (ρ AC ) is vanishingly small, which indicates that such circuit is a good α-scrambler. That is, the entropic scrambling complexity and the random circuit complexity (minimum number of random gates) can be polynomially related. We note JHEP07(2018)041 that the O(α 10 n 2 ) scaling can be improved to O(αn 2 ) for α = o( √ n) [31]. Moreover, the fast design and max-scrambling conjectures discussed in the last part can be regarded as connections to time complexity (in the physical sense).

Generalized entanglement entropies and random states
The previous section focused on Choi states, which are representations of the corresponding unitary channels. Here we consider a more straightforward problem -the entanglement in random and pseudorandom states -to generalize the connections between generalized entropies and designs. Note that the Page-like results, that a truly random state should typically be highly entangled, have been playing important roles in many fields including quantum gravity, quantum statistical mechanics, and quantum information theory for a long time. In this pure state setting, we obtain analogous main results that designs maximize corresponding Rényi entanglement entropies, closing the complexity gap in the Page's theorem, and that there are at most logarithmic nontrivial moments. These results suggest a similar hierarchy of entropic randomness complexities of states, which we call Page complexities. In addition, we are able to get solid results on the gap problem. We shall follow similar steps as in the random unitary setting, but with more focus on the different aspects. The presentation of similar arguments and derivations is going to be more compact.

Setting
The mathematical setting is as follows. Consider a bipartite system with Hilbert space We essentially need to compute the generalized entropies of the reduced density operator ρ A . From here on we use E to denote the average over states drawn uniformly from the unit sphere in H. Note that this uniform distribution on pure states is equivalent to the distribution generated by a Haar random unitary acting on some fixed fiducial state, so the induced uniformly random pure state is also called a Haar random state.
More explicitly, the Page's theorem (originally conjectured by Page in [23], proved in [24][25][26]) states that the average entanglement entropy of each reduced state is given by The gap between the average entropy and the maximum log d A is bounded by the dimension-independent constant 1/(2 ln 2). Similar observations were even earlier made by Lubkin [65] and Lloyd/Pagels [66]. In particular, [66] derived the distribution of the local eigenvalues of a random state, which may imply this result. Also see e.g. [67,68] for further studies of this phenomenon. In the following we shall strengthen this result by proving the gap between the average Rényi-α entropy of each reduced state and the roof value log d A is also bounded by a constant that is independent of the dimensions d A , d B and the order α.

Haar random states
Similarly, we first derive the integrals of the trace term and generalized entanglement entropies over the uniform measure.

General trace formula
Suppose |ψ is drawn uniformly from the unit sphere in H. The analytical formula for the average of the α-moment tr{ρ α A }, where ρ A is the reduced density matrix of |ψ for system A, is derived as follows. Expand |ψ in the standard product basis |ψ = jk ψ jk |jk , where j = 1, 2, . . . , d A label the basis elements for H A , and k = 1, 2, . . . , d B label the basis elements for H B . Then The general result on the Haar-averaged trace is as follows: where is the dimension of the symmetric subspace of H ⊗α .
Recall that the symmetric group S α acts on H ⊗α by permuting the tensor factors, and P [α] can be expressed as follows where U σ is the unitary operator associated with the permutation σ. Simple analysis shows that Consequently, (4.10)

JHEP07(2018)041
We noticed that similar results have been derived and rederived several times [65,[69][70][71][72]. Compared to known approaches, our approach seems simpler; in addition, it admits easy generalization to states drawn from (approximate) complex projective designs, which is not obvious for other approaches of which we are aware.
To get an intuitive understanding of eq. (4.3), it is worth taking a closer look at several concrete examples. When α = 2, we reproduce a formula derived by Lubkin [65]: From this equation we can derive a nearly-tight lower bound for the average Rényi-2 entanglement entropy, When d A = d B , the averages of the first few moments are given by Note that the gap of each Rényi entropy from the maximum is tied with the corresponding Catalan number. This is not a coincidence.

Large d limit
When d A = d B → ∞, the asymptotic results go as follows: Proof. The trace result also follows from the Cycle Lemma: (4.21)

JHEP07(2018)041
Therefore, This theorem suggests that the gap between the average Rényi-α entropy and the maximum log d A is bounded by a constant asymptotically.

Non-asymptotic bounds
The following bounds hold for any d A ≤ d B : Proof. According to Lemma 9, In fact we can show that the gap is at most 2: Proof. Recall that Rényi-α entropy is nonincreasing with α, so to establish the theorem, it suffices to prove the lower bound for the min entropy. For all α, where the second line follows from Lemma 22 below, by taking 0 < β ≤ (29d 2 B ) 1/3 .

JHEP07(2018)041
Proof. The conclusion is obvious when d A ≤ 4. When d B ≥ d A ≥ 5, note that (E ρ A α ) 1/α is nondecreasing with α for α > 0, so it suffices to prove the lemma in the case α = 29d 2/3 B . Then α 3/2 ≥ d B ≥ d A and 0.6 < q = α 3 /(32d 2 B ) ≤ 29/32. According to Lemma 20, which implies the lemma. Here the last inequality follows from the observation that f (q) := ] < 1 for 0.6 < q ≤ 29/32. This fact can be verified immediately if we notice that the derivative f (q) has a unique zero at q 0 = 4 − √ 13 in the interval 0 < q < 1 and that f (q) is monotonically decreasing for 0 < q < q 0 and monotonically increasing for q 0 < q < 1.
We also obtain the following bound, which improves Theorem 21 when d A d B : Proof. The proof goes similarly as Theorem 21. For all α ≥ 0, where c = 1 if H is real and c = 2 if H is complex. The second line follows from Lemma 24 stated below.
where c = 1 if H is real and c = 2 if H is complex.
The proof of this lemma is rather complicated, so we leave it in appendix I. We believe that the constant c in Theorem 23 and Lemma 24 can be set to 1 in both real and complex cases. We note that Hayden and Winter had a similar result [73], but they are not so explicit about the constant and the dimensions for which their result is applicable.

Average over designs and tight Page's theorems
Recall Page's theorem, which states that Haar-averaged von Neumann entanglement entropies of small subsystems are almost maximal. This theorem is not tight from the perspectives of both entropy and randomness: by the results above, the Haar-averaged Rényi entanglement entropies of higher orders are generically close to maximum as well, and the complete randomness is an overkill to maximize the entanglement entropies in terms of randomness complexity. Our results imply that Page's theorem can be strengthened from both sides. Similar to the random unitary setting, since E tr{ρ α A } only uses α moments of the uniform measure, all bounds on E tr{ρ α A } and E S (α) R (ρ A ) from the last part still hold if the average is over α-designs. So we arrive at the following bounds that can be regarded as tight Page's theorems for each order α, by Theorems 21, 23: Theorem 25 (Tight Page's theorems). Let ν α be an α-design. Then For all d A ≤ d B and all α ≥ 0, the following bounds hold: and where c = 1 if H is real and c = 2 if H is complex.
1) also hold in the limit of large d A .

Approximate designs
Here we directly consider the more relevant notion of approximate α-designs given by deviation in frame operators. This error analysis is important for characterizing the randomness complexity by Rényi entropies, as will be explained later.
Given an ensemble ν of quantum states, define

JHEP07(2018)041
Theorem 26. Let ω α be an λ-FO-approximate α-design with α ≥ 2. Then In the large d A limit, Proof. According to the same argument that leads to eq. (4.7), where the last inequality follows from the assumption ∆ α (ν) 1 ≤ λ and the fact that We see that the residual entropy remains O(1) as long as λ/D

Page complexities by Rényi entanglement entropy
Like the unitary case, our analysis of Rényi entanglement entropies lead to an entropic notion of randomness complexities: the complexity of α-designs can be witnessed by whether the average Rényi-α entanglement entropies are close enough to the maximum. Here we call them Page complexities as the foundation of this framework is the hierarchy of tight Page's theorems.
Here we provide an illustrating example based on the Clifford group. As an application of Lemma 26, let us consider the average Rényi entanglement entropy of Clifford orbits for a multiqubit system. For simplicity we assume Recall that the Clifford group is a unitary 3-design [74,75], so any orbit of the Clifford group forms a 3-design. Consequently, the average Rényi-α entanglement entropy for α ≤ 3 of any Clifford orbit is close to the maximum, for any ψ, where orb(ψ) denotes the Clifford orbit generated from ψ.

JHEP07(2018)041
However, the Clifford group is not a 4-design, and Clifford orbits are in general not 4designs [74][75][76]. If ψ is a stabilizer state, then ∆ 4 (orb(ψ)) 1 ≈ d 6 A /12 according to [44]. In this case the bounds for the fourth moment and Rényi-4 entropy provided by Theorem 26 is not very informative, note that E tr{ρ 4 A } ≈ 14d −3 A and D [4] ≈ (d A d B ) 4 /24 = d 8 A /24. For a typical Clifford orbit, by contrast, ∆ α (ν) 1 ≈ d 2 A is much smaller [44]. Now Theorem 26 implies that Therefore, eq. (4.46) also holds for typical Clifford orbits when α = 4. In our language, a Clifford orbit is very likely to have the Page complexity of 4-designs, although it is not really a 4-design in general. This is a rather nontrivial example indicating that the Page complexity is a necessary but not sufficient condition for certifying designs.

Nontrivial moments
Again, the min entanglement entropy witnesses the strongest Page complexity: if the average min entanglement entropies are always close to the maximum, then we simply cannot distinguish the ensemble from the completely random ensemble by the entanglement spectrum. The following theorem indicates that designs of order O(log d A ) maximize the min entanglement entropy and therefore achieve the max-Page complexity: In particular, Proof. According to Lemma 20, where the first inequality follows from the fact that q = α 3 /(32d 2 B ) ≤ 1/2 and h(q) ≤ 5/3 given that α 3 ≤ 16d 2 B by assumption. Consequently, In the case, a = 1 and α = log d A , the inequality α ≤ (16d 2 A ) 1/3 ≤ (16d 2 B ) 1/3 holds automatically; therefore, So again the hierarchy of distinguishable Page complexities can only extend to logarithmic designs.

Gaps between Page complexities
Following the definition of gaps between the entropic scrambling complexities, one may wonder here whether there exist α-designs such that Rényi entanglement entropies of orders larger than α are bounded away from the maximum, which we call "gap α-designs". In this random state setting, we are able to construct a family of gap 2-designs and so establish a strict gap between the second and α-th Page complexities with all α ≥ 3. Our construction is based on the orbits of a special subgroup of the unitary group on H = H A ⊗ H B . As mentioned before, any orbit of a unitary 2-design is a complex projective 2-design. What is interesting, our construction of projective 2-designs does not require unitary 2-designs. In this way, we also provide a novel recipe for constructing projective 2-designs, which is particularly useful when the dimension is not a prime power.
Consider the group G := U A ⊗ U B , where U A , U B are the unitary groups on H A , H B , respectively. It is irreducible, but does not form a 2-design. Simple analysis shows that G has four irreducible components on . By a similar continuity argument as employed in [44], there must exist an orbit of G that forms a 2-design. Let |ψ be a fiducial vector of a 2-design with reduced state ρ A for subsystem A. Then tr{ρ 2 A } is necessarily equal to the average over the uniform ensemble, that is, It turns out that this condition is also sufficient. To see this, note that the condition must be invariant under local unitary transformations and thus only depends on a symmetric polynomial of the eigenvalues of ρ A of degree 2, which is necessarily a function of tr{ρ 2 A } given the normalization condition tr{ρ A } = 1. It is worth pointing out that the same conclusion also holds if U A , U B are replaced by groups that form unitary 2-designs on H A , H B , respectively.
The following spectrum of ρ A with one large eigenvalue is a solution of eq. (4.53): Therefore, S min (ρ A ) ≥ log d A − 1, and the gap of all Rényi entropies from the maximum is bounded. The case in which the ratio d B /d A is bounded by a constant, say r, has very similar features to the α = 2 single-peak spectrum discussed in section 2.1. We have

JHEP07(2018)041
Consequently, As d A increases, the gap of S (α) R (ρ A ) from the maximum is unbounded whenever α > 2. We note that such construction cannot be directly generalized to establish gaps in the Choi setting. As mentioned, any orbit of a unitary t-design is a complex projective t-design, but to construct a projective t-design, a unitary t-design is not required. Here the complex projective 2-design is constructed using a group that is a tensor product. However, such a group can never be a unitary 2-design. Also, in the Choi setting, four parties are involved, and it is not easy to ensure unitarity using the idea for constructing projective designs. New approaches are necessary for such a construction.

Summary and open problems
This paper explores the complexity of scrambling by connecting it to the degrees of quantum randomness via entanglement properties. In particular, we study the entanglement of state and unitary designs to lay the mathematical foundations for using Rényi and other generalized entanglement to probe the randomness complexities corresponding to designs, which we introduce as entropic scrambling complexities (or Page complexities in the state setting). These complexities form a hierarchy that spans in between the most basic notions of scrambling and the max-scrambling which mimics the entanglement properties of Haar. In summary, our results mainly establish the following key features of entropic scrambling complexities: 1. α-designs and close approximations induce almost maximal Rényi-α entanglement entropies. This basic result links the maximality of Rényi entanglement entropies and the design complexity of corresponding orders.
2. O(log d)-designs are sufficient to maximize the min entanglement entropy, which means that they achieve the highest entropic scrambling complexity, namely maxscrambling. So all higher complexities collapse in the sense that they are simply indistinguishable from Haar scrambling by Rényi entanglement entropies.
3. We show that there exist projective 2-designs with non-maximal Rényi-3 (and therefore higher order) entanglement entropies. This establishes a strict separation between the order-2 complexity and higher levels, at least in the state setting.
The known structure of the entropic scrambling complexities based on our results is illustrated in figure 2. In summary, this study reveals the fine-grained complexity structure of the regime beyond information scrambling, and introduces a set of tools for studying it.
We also hope that this work initiates further research into this significant but relatively unknown regime.
JHEP07(2018)041 Figure 2. The hierarchy of entropic scrambling complexities. Each order is given by nearmaximality of corresponding Rényi entanglement entropies, which diagnose the complexity of corresponding designs. The highest such complexity, corresponding to the notion of max-scrambling, is achieved at an order that roughly scales logarithmically in the dimension of the system. The weakest form of scrambling, or min-scrambling, is weaker than order-2 but stronger than order-1.
Order-2 is strictly separated from higher orders in the state setting.
There are several technical open problems, especially in the setting of unitary channels. For example, we are not yet able to give a construction that opens a strict gap between the entropic scrambling complexities. Although we prove such gaps for projective 2-designs in the state setting, the similar techniques do not directly generalize to unitary channels. Moreover, due to the lack of subadditivity, we know that the negative tripartite information in terms of Rényi entropies are not necessarily nonnegative. It is worth looking into when this situation occurs, and further considering the meanings of such derived quantities. Furthermore, this paper mostly concerns the expected values. It would be important to further analyze the variances and derive probabilistic bounds using concentration inequalities, in order to talk about "typical" behaviors in a more rigorous sense.

Outlook
There are many interesting extensions to make. For example, our results suggest that Rényi entanglement entropies could be powerful tools to further advance the study of quantum randomness and pseudorandomness. A particularly interesting insight is that Rényi entropies of non-integer orders are naturally defined, which indicates that they can be helpful for characterizing and understanding the mysterious notion of designs of noninteger orders. This problem is of interest in quantum information, and as explained earlier, is key to a more precise characterization of the min-scrambling complexity. For example, it is reasonable to require that α-designs (where α can be non-integer) by any definition JHEP07(2018)041 must induce nearly maximal Rényi-α entanglement entropies. Then it is straightforward to see by eq. (4.58) that our gap 2-design induces small Rényi-(2 + ) entanglement entropy for any > 0, and so cannot be a (2 + )-design. However, the attempts in properly defining non-integer designs and constructing such examples have mostly been negative so far. We tried a few possible ways to construct random ensembles such that the maximalnonmaximal "phase transition" of Rényi entropy occurs at some non-integer order which do not work well. We also mention that the definition of designs by frame potential could be rather directly generalized to non-integer orders, but such generalization also suffers from fundamental problems. 2 We hope to give more well-behaved definitions or constructions of non-integer designs, or find more fundamental reasons that they are not meaningful notions -either of which is very interesting.
Also given that the entanglement properties of random states and channels play important roles in many areas in quantum information, including entanglement theory, quantum computing, and quantum cryptography, we expect the techniques and results here to find more interesting applications and advance the study of these fields. It is worth mentioning that the recent study of pseudorandom quantum states and unitaries from the perspective of computational indistinguishability [77], which represents a different notion of quantum pseudorandomness that is more directly related to the practical requirements for cryptographic security. It would be interesting to explore the role of entanglement in such computational quantum pseudorandomness, and find connections to our framework.
The current work focuses mostly on the kinematic or mathematical properties of unitary channels and states, which constitute a framework for further exploring the postscrambling physics. For example, it would be interesting to study the dynamical behaviors of Rényi entanglement entropies and randomness, and in particular investigate fast maxscrambling, in specific many-body or holographic systems. By doing so we may extend existing studies of entanglement growth such as "entanglement tsunami" [78,79]), and eventually understand the whole process of scrambling and especially its relation to randomness and complexity generation. In general, the study of randomness complexities may also shed new light on the fruitful idea of modeling complex systems (especially black holes [2]) by random states or dynamics. A recent study [80] on (a 1d variant of) the strongly chaotic SYK model (which has drawn considerable interest as a solvable toy model of quantum black holes and holography) shows that, after a quench, there is a "prethermal" regime where light modes rapidly scramble, but the Rényi entanglement entropies do not reach thermal values, which confirms our expectation that the randomness complexity of the system is still low. However, the late-time behaviors remain unclear. Another recent work [81] studies the Rényi entanglement entropies of random dynamics generated by Hamiltonians drawn from the Gaussian unitary ensemble (GUE). In general, the Rényi entanglement entropies are useful and analyzable quantities in the study of scrambling and chaos, and our work strengthens the motivation by connecting them to different randomness complexities.
We also hope to establish more solid connections between the randomness complexities and the conventional ones, such as computational, gate and Kolmogorov complexities,

JHEP07(2018)041
which play active roles in recent studies of holographic duality and black holes [82][83][84], and are of independent interest. Note that an interesting recent paper [84] directly concerns the evolution of complexity in generic physical dynamics. Here the complexity roughly means the computational/gate complexity, which is rather difficult to rigorously analyze. We feel that it is fruitful to combine their framework and viewpoints with ours.
Moreover, the notion of scrambling and randomness discussed here is associated with the entire Hilbert space. It would be nice to extend the techniques and results to the finite temperature regime or systems with conserved quantities, so as to apply our ideas in more physical scenarios and in general the study of quantum thermalization and manybody localization. We also hope to solidify the connections to several other relevant topics, including random tensor network holography [85] and OTO correlators. In summary, we believe that further research along the lines of research mentioned in this section could be essential to our understanding of quantum chaos, quantum statistical mechanics, quantum many-body physics, and quantum gravity.

A Inequalities relating Rényi entropies of different orders
First, we present a series of inequalities relating Rényi entropies of different orders. It is well known that the Rényi entropy is monotonically nonincreasing with the parameter α, that is S In particular, this equation yields a lower bound for the min entropy When α ≥ log d, we have

JHEP07(2018)041
so the difference between S (α) R (ρ) and S min (ρ) is less than 1. When β = α + 1, we have S R (ρ) and the min entropy in the case β ≥ α ≥ 1. The following equation In particular, any Rényi β-entropy with β ≥ 2 is lower bounded by a convex combination of Rényi 2-entropy and the min entropy,

B Weak subadditivity of the Rényi entropies
It is known that Rényi-α entropy is not subadditive except for the special case α = 1. The following lemma yields a weaker form of subadditivity: Lemma 28. Let ρ AB be any bipartite state on the product Hilbert space Let ρ A , ρ B be the two reduced states. Then 3) The first inequality in Lemma 28 means that the spectrum of ρ AB majorizes that of ρ A ⊗ I d B . The second and third inequalities are immediate consequences of the first one, which are equivalent. The second one can be seen as a weaker form of subadditivity, while the third one means that the gap of Rényi entropy of a joint state from the maximum is no smaller than the corresponding gap for each reduced state, which has already been discussed in a slightly different way.
Proof. Let |j for j = 1, 2, . . . , d B be an orthonormal basis for H B and P j = |j j| be the corresponding projectors. Let where ρ j are subnormalized states that sum up to ρ A . Define σ k = j ρ j ⊗ P j+k , k = 1, 2, · · · , d B , (B.5) JHEP07(2018)041 Figure 3. Comparison between σ − τ − and στ , when k +1 is a 1-cycle in σ. Dashed arrows represent the mappings that are in σ − τ − but no longer there in στ , and identical cycles are not shown. We see that in στ the element k + 1 is inserted in the cycle, but the total number of cycles does not change.
where the addition in the indices is modulo d B ; note that σ 0 = σ. Then all σ k have the same spectrum, which is majorized by ρ AB , that is, ρ AB σ k . Consequently, Since Rényi α-entropy is Schur concave for 0 ≤ α ≤ ∞, it follows that which confirms the second inequality in Lemma 28 and implies the third inequality.
Now compare the action of σ − τ − and στ on individual elements. The only differences is στ , and in addition στ [k + 1] = σ − τ − [k]. So στ simply increases the length of a cycle in σ − τ − by one, and does nothing to other cycles. This is illustrated in figure 3. So ξ(στ ) = ξ(σ − τ − ).

D Bounds on the Catalan numbers
It is well known that the Catalan number Cat k = (2k)!/[k!(k + 1)!] is approximated by 4 k / √ πk 3/2 when k is large. To make this statement more precise, here we provide both lower and upper bounds for Cat k .
Lemma 29. The Catalan number Cat k satisfies where k is not necessarily an integer.
Proof. The basis of our proof is the following Stirling approximation formula √ 2πk As an implication, (D.3) Figure 4. Comparison between σ − τ − and στ , when k + 1 is in a cycle of length > 1 in σ. Dashed arrows represent the mappings that are in σ − τ − but no longer there in στ , and identical cycles are not shown. There are two possible cases: (i) The relevant elements a − 1, b, σ [1], k belong to the same cycle in σ − τ − . In στ , this cycle is broken into two, so στ has one more cycle than σ − τ − ; (ii) {a − 1, b} and {k, σ[1]} belong to two cycles in σ − τ − . In στ , these two cycles are combined as one with element k + 1 inserted, so στ has one less cycle than σ − τ − .

JHEP07(2018)041
Here the second inequality follows from the inequality (D.4) note that the left hand side is monotonically decreasing with k and approaches e in the limit k → ∞.
On the other hand, (D.7) The first and second derivatives of f (k) read Since f (k) is negative, f (k) is monotonically decreasing, which implies that f (k) > 0 given that lim k→∞ f (k) = 0. Consequently, f (k) is monotonically increasing, which confirms our claim f (k) < 1 given that lim k→∞ f (k) = 1.
The following two corollaries are easy consequences of Lemma 29, though it is straightforward to prove them directly.
Corollary 30. Cat k ≤ Cat k+1 for any positive integer k.
Corollary 31. Cat j Cat k < Cat j+k for arbitrary positive integers j, k.

(E.2)
The lower bound is saturated iff σ is the identity or a product of disjoint transpositions. The upper bound |Moeb(σ)| ≤ Cat |σ| is saturated iff σ is a cycle of length |σ| + 1.
Proof. The lemma holds when σ is the identity. Otherwise, suppose σ has disjoint cycle decomposition σ = C 1 C 2 · · · C k , where C j for 1 ≤ j ≤ k are nontrivial cycles. Then given that Cat |C j | ≥ 1 for all j. The inequality is saturated iff |C j | = 1 for all j, that is, σ is a product of disjoint transpositions. On the other hand, where the two inequalities follow from Corollary 31 and Lemma 29, respectively. The first inequality is saturated when k = 1, but is strict whenever k ≥ 2. So the upper bound |Moeb(σ)| ≤ Cat |σ| is saturated iff σ is a cycle of length |σ| + 1.

F Bounds on the Weingarten function
The following theorem is reproduced from [86], Theorem 33. When d > √ 6k 7/4 , any σ ∈ S k satisfies (F.1) The following lemma is an immediate consequence of Theorem 33 and Lemma 32.

G Bounds on the number of permutations with a given genus
In this appendix, we provide an easy-to-use upper bound for the number of permutations with a given genus (Lemma 39 below), which plays a crucial role in understanding Rényi entanglement entropies of Haar random states as well as states drawn from designs. The basis of our endeavor is the following theorem due to Goupil and Schaeffer [87].

JHEP07(2018)041
where U S is α-scrambling, and D ≤ √ d controls the size of this α-scrambling subspace (labeled by subscript S). Then the Choi state ofŨ is The question is whether there exists some D that can lead to separations between higher Rényi entropies associated with this Choi state, say α and α , α > α ≥ 2. To establish such separations, we need to show a large (Θ(log d)) gap between Rényi-α entropies and the maximum for some small D, as well as upper bound the difference between Rényi-α entropies and the maximum by continuity. The gap side can work out by directly generalizing the corresponding calculation in [50]: let β = log( R (tr BD |Ũ Ũ |) = Θ(log d) as long as β is a positive constant. However, we find that the continuity bound for unified entropies can only give trivial results on the continuity side: Lemma 40 (Generalized Fannes' inequality [34]). Let ρ and ρ be density operators in Hilbert space of dimension d. Denote = D tr (ρ, ρ ). For α > 1 and s ≥ 0: where χ s = 1 for s ≥ 1, and χ s = d 2(α−1) for s = 0. H (α) denotes the α binary entropy.
It can be seen that this generalized Fannes' bound for Rényi entropies grows with the dimension d for α > 1, which indicates that even a tiny non-scrambling subspace may perturb the Rényi entropies drastically. Indeed, some simple scaling analysis can confirm that this bound is trivial even for the Rényi-2 entropy. Notice that = D tr (tr BD |Ũ Ũ |, I) ≤ O(D/ log √ d) = O(d (β−1)/2 ). Then it must hold that 2(α − 1) + α(β − 1)/2 < 0 so that log d − S (α) R (tr BD |Ũ Ũ |) = o(log d). This gives β < −3 + 4/α, which has no overlap with the β > 0 solution on the gap side when α ≥ 2. Equivalently, by plugging in β > 0 we can solve that the desired separation can exist when α < 2. Summarizing, in order to have a nontrivial bound on Rényi entropies D needs to be o(1), which is meaningless. This is hardly surprising: one expects that Rényi entropies are very sensitive, especially in the nearmaximum regime, due to the logarithm. In fact, we are able to obtain a large gap on the α side basically because of such exponential sensitivity. Suppose we consider s > 0 entropies instead. Then the continuity bound is strong since χ s = 1, but it becomes hard to find a gap on the other side. There is a fundamental tradeoff between sensitivity and robustness in these unified entropies. In conclusion, we believe that partially scrambling unitaries are not likely to produce separations between generalized entropies in the Choi model.

I Proof of Lemma 24
To prove Lemma 24, we need to introduce several auxiliary concepts and lemmas. An m×s matrix G is a (standard) Gaussian random matrix if the entries of G are i.i.d. standard Gaussian random variables (with mean 0 and variance 1). It is a complex Gaussian random matrix if its real part and imaginary part are independent Gaussian random matrices.

JHEP07(2018)041
where γ(m) := Γ( m+1 2 )/( √ mΓ( m 2 ), and the last inequality follows from the fact that γ(m) is monotonic increasing with m for m ≥ 1. This conclusion is intuitive if we observe that γ(m) is equal to the ratio of the mean length over the root mean square length of a standard Gaussian random vector with m components. To derive an analytical proof, we can compute the log-derivative of γ(m) with respect to m, note that the definition of γ(m) can be extended to positive real numbers. Straightforward calculations shows that (I.8) Here ψ (0) denotes the digamma function (instead of a ket), the inequality follows from the concavity of ψ (0) , and the last equality follows from the identity ψ (0) (x + 1) = ψ (0) (x) + 1 x . In the complex case, Lemmas 43 and 42 imply that where the second inequality follows from the monotonicity of γ(·), as in the real case.
Open Access. This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.