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

IEEE Transactions on Information Theory

Approximate Unitary Designs Give Rise to Quantum Channels With Super Additive Classical Holevo Capacity

Aditya Nema, Pranab Sen

Published Apr 21, 2022• 1 citation
Publisher

Abstract

In a breakthrough, Hastings showed that there exist quantum channels whose classical Holevo capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings’ proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximate$n^{2/3}$-design gives rise to a quantum channel with superadditive classical Holevo capacity, where$n$is the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We follow the geometric functional analytic approach of Aubrun, Szarek and Werner in order to prove our result. More precisely we prove a sharp Dvoretzky-like theorem stating that, with high probability under the choice of a unitary from an approximate$t$-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low’s technique for proving concentration of measure for an approximate$t$-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Haar random unitaries require at least$\Omega (n^{2})$random bits in order to describe them with good precision. In contrast, there exist exact$n^{2/3}$-designs using only$O(n^{2/3} \log n)$random bits. Thus, our work can be viewed as a partial derandomisation of Hastings’ result, and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity. Finally we also show that for any$p > 1$, approximate unitary$n^{1.7}$-designs give rise to channels violating subadditivity of Rényi$p$-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest.

DOI
10.1109/tit.2022.3167604

Related papers

Approximate Unitary n^{2/3}-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity

Aditya Nema, Sen, Pranab

In a breakthrough, Hastings' showed that there exist quantum channels whose classical capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings' proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximate $n^{2/3}$-design gives rise to a quantum channel with superadditive classical Holevo capacity, where $n$ is the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We prove a sharp Dvoretzky-like theorem (similar to Aubrun, Szarek, Werner, 2010) stating that, with high probability under the choice of a unitary from an approximate $t$-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low's technique for proving concentration of measure for an approximate $t$-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Finally we also show that for any $p>1$, approximate unitary $(n^{1.7} \log n)$-designs give rise to channels violating subadditivity of Rényi $p$-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest. Hence, our work can be viewed as a partial derandomisation of Hastings' result and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity.

arXiv:1902.10808•Leibniz international proceedings in informatics•Jan 1, 2019•3 citations

Superadditivity of classical communication over quantum channels via random and deterministic permutations

Benjamin Lovitz, Peixue Wu

Since Hastings' proof of superadditivity of classical communication over quantum channels, considerable effort has been devoted to finding a structural explanation of this phenomenon that was originally established by concentration of measure for Haar random unitaries. The main observation of this work is that Haar randomness can be replaced by random permutations without changing the limiting geometry responsible for nonadditivity. This replacement turns a continuous problem over unitary matrices into a discrete combinatorial problem over zero--one permutation matrices, and thereby opens a path toward derandomization. The theorem of Bordenave and Collins shows that random permutations have the required limiting behavior and the algorithm of O'Donnell and Wu then provides a deterministic asymptotic construction, running in polynomial time in the size when the channel parameters and accuracy are fixed. Thus the random construction can be derandomized in an asymptotic algorithmic sense. Finally, a quantitative random permutation estimate by Chen, Garza-Vargas, Tropp and van Handel gives a fully numerical estimate: there exists a tuple of 57,836,025 permutations acting on a set of size \[ N \le 5.422\times 10^{116216}\] such that the associated finite dimensional channel exhibits nonadditivity. This enormous value remains an obstacle to a practical construction.

quant-pharXiv:2608.25961•Aug 27, 2026•6 citations

A quantum Johnson-Lindenstrauss lemma via unitary t-designs

Sen, Pranab

The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation with high probability. In this work, we show that the Haar random unitary can be replaced by a uniformly random unitary chosen from a finite set called an approximate unitary t-design for t = O(log n). Choosing a unitary from such a design requires only polylogarithmic random bits as opposed to exponential in dimension random bits required to choose a Haar random unitary with reasonable precision. Moreover, since such unitaries can be efficiently implemented in the superpositional setting, our result can be viewed as an efficient quantum Johnson-Lindenstrauss transform akin to efficient quantum Fourier transforms widely used in earlier work on quantum algorithms. We prove our result by leveraging a method of Low for showing concentration for approximate unitary t-designs. We discuss algorithmic advantages and limitations of our result and conclude with a toy application to private information retrieval.

arXiv:1807.08779•Jul 23, 2018•5 citations

Random Quantum Circuits Beyond Moment Matching

Shih-Han Hung

Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong $\varepsilon$-approximate unitary $k$-design on $n$ qubits, the distribution of each output probability is within $O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)$ in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters $1$ and $2^n-1$. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance $O(k^{-1/2}+\varepsilon)$. Every strong $\varepsilon$-approximate unitary $k$-design invariant on $\log k+O(1)$ qubits achieves error $2^{-Ω(k)}+O(\varepsilon)$ in Kolmogorov distance and $2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))$ in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong $\varepsilon$-approximate $k$-design is concentrated around its Haar value $n-Θ(1)$: its mean differs from the Haar mean by $O(k^{-1/4}+\varepsilon^{1/2})$ and its standard deviation is $O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})$. Consequently, a trusted device sampling such circuits generates $n-O(1)$ bits of entropy per sample, which makes them useful for random number generation.

quant-pharXiv:2610.02135•Oct 2, 2026•0 citations

High Probability Decoupling via Approximate Unitary Designs and Efficient Relative Thermalization

Aditya Nema, Pranab Sen

We prove a new concentration result for non-catalytic decoupling by showing that, for suitably large$t$, applying a unitary chosen uniformly at random from an approximate$t$-design on a quantum system followed by a fixed quantum operation almost decouples, with high probability, the given system from another reference system to which it may initially have been correlated. Earlier works either did not obtain high decoupling probability, or used provably inefficient unitaries, or required catalytic entanglement for decoupling. In contrast, our approximate unitary designs always guarantee decoupling with exponentially high probability and, under certain conditions, lead to computationally efficient unitaries. As a result we conclude that, under suitable conditions, efficiently implementable approximate unitary designs achieve relative thermalisation in quantum thermodynamics with exponentially high probability. We also show the scrambling property of black hole, when the black hole evolution is according to pseudorandom approximate unitary$t$-design, as opposed to the Haar random evolution considered earlier by Hayden-Preskill.

arXiv:2002.00247•IEEE Transactions on Information Theory•Jan 26, 2024•5 citations

LOW ENTROPY OUTPUT STATES FOR PRODUCTS OF RANDOM UNITARY CHANNELS

Benoît Collins, Motohisa Fukuda, Ion Nechita

In this paper, we study the behavior of the output of pure entangled states after being transformed by a product of conjugate random unitary channels. This study is motivated by the counterexamples by Hastings [Superadditivity of communication capacity using entangled inputs, Nat. Phys.5 (2009) 255–257] and Hayden–Winter [Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1, Comm. Math. Phys.284(1) (2008) 263–280] to the additivity problems. In particular, we study in depth the difference of behavior between random unitary channels and generic random channels. In the case where the number of unitary operators is fixed, we compute the limiting eigenvalues of the output states. In the case where the number of unitary operators grows linearly with the dimension of the input space, we show that the eigenvalue distribution converges to a limiting shape that we characterize with free probability tools. In order to perform the required computations, we need a systematic way of dealing with moment problems for random matrices whose blocks are i.i.d. Haar distributed unitary operators. This is achieved by extending the graphical Weingarten calculus introduced in [B. Collins and I. Nechita, Random quantum channels I: Graphical calculus and the Bell state phenomenon, Comm. Math. Phys.297(2) (2010) 345–370].

arXiv:1208.1449•Random Matrices Theory and Application•Jan 1, 2013•8 citations
In a breakthrough, Hastings showed that there exist quantum channels whose classical Holevo capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings’ proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximaten2/3n^{2/3}n2/3-design gives rise to a quantum channel with superadditive classical Holevo capacity, wherennnis the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We follow the geometric functional analytic approach of Aubrun, Szarek and Werner in order to prove our result. More precisely we prove a sharp Dvoretzky-like theorem stating that, with high probability under the choice of a unitary from an approximatettt-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low’s technique for proving concentration of measure for an approximatettt-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Haar random unitaries require at leastΩ(n2)\Omega (n^{2})Ω(n2)random bits in order to describe them with good precision. In contrast, there exist exactn2/3n^{2/3}n2/3-designs using onlyO(n2/3log⁡n)O(n^{2/3} \log n)O(n2/3logn)random bits. Thus, our work can be viewed as a partial derandomisation of Hastings’ result, and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity. Finally we also show that for anyp>1p > 1p>1, approximate unitaryn1.7n^{1.7}n1.7-designs give rise to channels violating subadditivity of Rényippp-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest.
In a breakthrough, Hastings' showed that there exist quantum channels whose classical capacity is superadditive i.e. more classical information can be transmitted by quantum encoding strategies entangled across multiple channel uses as compared to unentangled quantum encoding strategies. Hastings' proof used Haar random unitaries to exhibit superadditivity. In this paper we show that a unitary chosen uniformly at random from an approximate n2/3n^{2/3}n2/3-design gives rise to a quantum channel with superadditive classical Holevo capacity, where nnn is the dimension of the unitary exhibiting the Stinespring dilation of the channel superoperator. We prove a sharp Dvoretzky-like theorem (similar to Aubrun, Szarek, Werner, 2010) stating that, with high probability under the choice of a unitary from an approximate ttt-design, random subspaces of large dimension make a Lipschitz function take almost constant value. Such theorems were known earlier only for Haar random unitaries. We obtain our result by appealing to Low's technique for proving concentration of measure for an approximate ttt-design, combined with a stratified analysis of the variational behaviour of Lipschitz functions on the unit sphere in high dimension. The stratified analysis is the main technical advance of this work. Finally we also show that for any p>1p>1p>1, approximate unitary (n1.7log⁡n)(n^{1.7} \log n)(n1.7logn)-designs give rise to channels violating subadditivity of Rényi ppp-entropy. In addition to stratified analysis, the proof of this result uses a new technique of approximating a monotonic differentiable function defined on a closed bounded interval and its derivative by moderate degree polynomials which should be of independent interest. Hence, our work can be viewed as a partial derandomisation of Hastings' result and a step towards the quest of finding an explicit quantum channel with superadditive classical Holevo capacity.
Since Hastings' proof of superadditivity of classical communication over quantum channels, considerable effort has been devoted to finding a structural explanation of this phenomenon that was originally established by concentration of measure for Haar random unitaries. The main observation of this work is that Haar randomness can be replaced by random permutations without changing the limiting geometry responsible for nonadditivity. This replacement turns a continuous problem over unitary matrices into a discrete combinatorial problem over zero--one permutation matrices, and thereby opens a path toward derandomization. The theorem of Bordenave and Collins shows that random permutations have the required limiting behavior and the algorithm of O'Donnell and Wu then provides a deterministic asymptotic construction, running in polynomial time in the size when the channel parameters and accuracy are fixed. Thus the random construction can be derandomized in an asymptotic algorithmic sense. Finally, a quantitative random permutation estimate by Chen, Garza-Vargas, Tropp and van Handel gives a fully numerical estimate: there exists a tuple of 57,836,025 permutations acting on a set of size N≤5.422×10116216 N \le 5.422\times 10^{116216}N≤5.422×10116216 such that the associated finite dimensional channel exhibits nonadditivity. This enormous value remains an obstacle to a practical construction.
The famous Johnson-Lindenstrauss lemma states that for any set of n vectors, there is a linear transformation into a space of dimension O(log n) that approximately preserves all their lengths. In fact, a Haar random unitary transformation followed by projection onto the first O(log n) coordinates followed by a scaling works as a valid transformation with high probability. In this work, we show that the Haar random unitary can be replaced by a uniformly random unitary chosen from a finite set called an approximate unitary t-design for t = O(log n). Choosing a unitary from such a design requires only polylogarithmic random bits as opposed to exponential in dimension random bits required to choose a Haar random unitary with reasonable precision. Moreover, since such unitaries can be efficiently implemented in the superpositional setting, our result can be viewed as an efficient quantum Johnson-Lindenstrauss transform akin to efficient quantum Fourier transforms widely used in earlier work on quantum algorithms. We prove our result by leveraging a method of Low for showing concentration for approximate unitary t-designs. We discuss algorithmic advantages and limitations of our result and conclude with a toy application to private information retrieval.
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong ε\varepsilonε-approximate unitary kkk-design on nnn qubits, the distribution of each output probability is within O(k−1/2(1+k/2n)−1/2+ε)O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)O(k−1/2(1+k/2n)−1/2+ε) in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters 111 and 2n−12^n-12n−1. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance O(k−1/2+ε)O(k^{-1/2}+\varepsilon)O(k−1/2+ε). Every strong ε\varepsilonε-approximate unitary kkk-design invariant on log⁡k+O(1)\log k+O(1)logk+O(1) qubits achieves error 2−Ω(k)+O(ε)2^{-Ω(k)}+O(\varepsilon)2−Ω(k)+O(ε) in Kolmogorov distance and 2−Ω(k)+O(εlog⁡(2/ε))2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))2−Ω(k)+O(εlog(2/ε)) in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong ε\varepsilonε-approximate kkk-design is concentrated around its Haar value n−Θ(1)n-Θ(1)n−Θ(1): its mean differs from the Haar mean by O(k−1/4+ε1/2)O(k^{-1/4}+\varepsilon^{1/2})O(k−1/4+ε1/2) and its standard deviation is O(2−n/2+k−1/8+ε1/4)O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})O(2−n/2+k−1/8+ε1/4). Consequently, a trusted device sampling such circuits generates n−O(1)n-O(1)n−O(1) bits of entropy per sample, which makes them useful for random number generation.
We prove a new concentration result for non-catalytic decoupling by showing that, for suitably largettt, applying a unitary chosen uniformly at random from an approximatettt-design on a quantum system followed by a fixed quantum operation almost decouples, with high probability, the given system from another reference system to which it may initially have been correlated. Earlier works either did not obtain high decoupling probability, or used provably inefficient unitaries, or required catalytic entanglement for decoupling. In contrast, our approximate unitary designs always guarantee decoupling with exponentially high probability and, under certain conditions, lead to computationally efficient unitaries. As a result we conclude that, under suitable conditions, efficiently implementable approximate unitary designs achieve relative thermalisation in quantum thermodynamics with exponentially high probability. We also show the scrambling property of black hole, when the black hole evolution is according to pseudorandom approximate unitaryttt-design, as opposed to the Haar random evolution considered earlier by Hayden-Preskill.
In this paper, we study the behavior of the output of pure entangled states after being transformed by a product of conjugate random unitary channels. This study is motivated by the counterexamples by Hastings [Superadditivity of communication capacity using entangled inputs, Nat. Phys.5 (2009) 255–257] and Hayden–Winter [Counterexamples to the maximal p-norm multiplicativity conjecture for all p > 1, Comm. Math. Phys.284(1) (2008) 263–280] to the additivity problems. In particular, we study in depth the difference of behavior between random unitary channels and generic random channels. In the case where the number of unitary operators is fixed, we compute the limiting eigenvalues of the output states. In the case where the number of unitary operators grows linearly with the dimension of the input space, we show that the eigenvalue distribution converges to a limiting shape that we characterize with free probability tools. In order to perform the required computations, we need a systematic way of dealing with moment problems for random matrices whose blocks are i.i.d. Haar distributed unitary operators. This is achieved by extending the graphical Weingarten calculus introduced in [B. Collins and I. Nechita, Random quantum channels I: Graphical calculus and the Bell state phenomenon, Comm. Math. Phys.297(2) (2010) 345–370].